Representing a Concept Lattice by Neighborly Ideas

摘要

Concept lattices are an ordering of the maximal rectangles defined by a binary relation. This paper, using the idea of neighbor sets in graph theory, presents an approach to obtain all the concepts for a context, and simultaneously gets the diagram of the concept lattice.