%0 Conference Paper %1 10.1007/978-3-642-11928-6_22 %A Ganter, Bernhard %B Formal Concept Analysis %C Berlin, Heidelberg %D 2010 %E Kwuida, Léonard %E Sertkaya, Barıs %I Springer Berlin Heidelberg %K algorithms fca nextclosure %P 312--340 %T Two Basic Algorithms in Concept Analysis %X 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. %@ 978-3-642-11928-6

@inproceedings{10.1007/978-3-642-11928-6_22, abstract = {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.}, added-at = {2019-03-01T21:30:19.000+0100}, address = {Berlin, Heidelberg}, author = {Ganter, Bernhard}, biburl = {https://www.bibsonomy.org/bibtex/2e22d2afb99073533cc71ed743c78b8e9/tomhanika}, booktitle = {Formal Concept Analysis}, editor = {Kwuida, L{\'e}onard and Sertkaya, Bar{\i}{\c{s}}}, interhash = {f44d214d7176b9183d2bf29b8efbdc00}, intrahash = {e22d2afb99073533cc71ed743c78b8e9}, isbn = {978-3-642-11928-6}, keywords = {algorithms fca nextclosure}, pages = {312--340}, publisher = {Springer Berlin Heidelberg}, timestamp = {2019-03-01T21:30:19.000+0100}, title = {Two Basic Algorithms in Concept Analysis}, year = 2010 }