Repository | Book | Chapter
(2010) Formal concept analysis, Dordrecht, Springer.
We describe two algorithms for closure systems. The purpose of the first is to produce all closed sets of a given closure operator. The second constructs a minimal family of implications for the "logic" of a closure system. These algorithms then are applied to problems in concept analysis: Determining all concepts of a given context and describing the dependencies between attributes. The problem of finding all concepts is equivalent, e.g., to finding all maximal complete bipartite subgraphs of a bipartite graph.
Publication details
DOI: 10.1007/978-3-642-11928-6_22
Full citation:
Ganter, B. (2010)., Two basic algorithms in concept analysis, in L. Kwuida & B. Sertkaya (eds.), Formal concept analysis, Dordrecht, Springer, pp. 312-340.
This document is unfortunately not available for download at the moment.