Browsing Large Concept Lattices through Tree Extraction and Reduction Methods

Cassio Melo, Bénédicte Le Grand, Marie-Aude Aufaure · International Journal of Intelligent Information Technologies · 2013

Browsing concept lattices from Formal Concept Analysis (FCA) becomes a problem as the number of concepts can grow significantly with the number of objects and attributes. Interpreting the lattice through direct graph-based visualisation of the Hasse diagram rapidly becomes difficult and more synthetic representations are needed. In this work the authors propose an approach to simplify concept lattices by extracting and visualising trees derived from them. The authors further simplify the browse-able trees with two reduction methods: fault-tolerance and concept clustering.

Read the paper · More papers on PaperTik