Browsing Large Concept Lattices through Tree Extraction and Reduction Methods

Cassio Melo, Bénédicte Le-Grand and Marie-Aude Aufaure
Additional contact information
Cassio Melo: École Centrale Paris, Paris, France
Bénédicte Le-Grand: Centre de Recherche en Informatique, Université Paris 1 Panthéon, Sorbonne, France
Marie-Aude Aufaure: Mas Laboratory, École Centrale Paris, Paris, France

International Journal of Intelligent Information Technologies (IJIIT), 2013, vol. 9, issue 4, 16-34

Abstract: 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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://services.igi-global.com/resolvedoi/resolve ... 018/ijiit.2013100102 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jiit00:v:9:y:2013:i:4:p:16-34

Access Statistics for this article

International Journal of Intelligent Information Technologies (IJIIT) is currently edited by Vijayan Sugumaran

More articles in International Journal of Intelligent Information Technologies (IJIIT) from IGI Global
Bibliographic data for series maintained by Journal Editor ().