Formal Concept Analysis Homepage   --   Table of Contents/Sitemap   --   Uta Priss

Formal Concept Analysis Algorithms

One of the first FCA algorithms was Bernhard Ganter's Next Concept algorithm, which was published in "Two basic algorithms in concept analysis". Because the original publication is difficult to retrieve, I obtained permission from Bernhard to provide a scanned copy of the algorithm and an example on this site.

At the ICCS'09 there was a competition between FCA algorithms. The winner at that time was Fcbo (FCA algorithms) and the runner-up In-Close. However, subsequent advances in In-Close (notably the 'partial closure' canonicity test) have shown that In-Close now out-performs Fcbo.

Publications on FCA Algorithms

Data sources

There are no standard datasets for FCA. Different researchers use different sets from different sources (mostly data mining sources), such as A popular data set is the mushroom data from UCI.

Copyright 2007. Uta Priss
Please send comments about this site to: