Reference Hub10
Browsing Large Concept Lattices through Tree Extraction and Reduction Methods

Browsing Large Concept Lattices through Tree Extraction and Reduction Methods

Cassio Melo, Bénédicte Le-Grand, Marie-Aude Aufaure
Copyright: © 2013 |Volume: 9 |Issue: 4 |Pages: 19
ISSN: 1548-3657|EISSN: 1548-3665|EISBN13: 9781466635586|DOI: 10.4018/ijiit.2013100102
Cite Article Cite Article

MLA

Melo, Cassio, et al. "Browsing Large Concept Lattices through Tree Extraction and Reduction Methods." IJIIT vol.9, no.4 2013: pp.16-34. http://doi.org/10.4018/ijiit.2013100102

APA

Melo, C., Le-Grand, B., & Aufaure, M. (2013). Browsing Large Concept Lattices through Tree Extraction and Reduction Methods. International Journal of Intelligent Information Technologies (IJIIT), 9(4), 16-34. http://doi.org/10.4018/ijiit.2013100102

Chicago

Melo, Cassio, Bénédicte Le-Grand, and Marie-Aude Aufaure. "Browsing Large Concept Lattices through Tree Extraction and Reduction Methods," International Journal of Intelligent Information Technologies (IJIIT) 9, no.4: 16-34. http://doi.org/10.4018/ijiit.2013100102

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.