A parallel between extended formal concept analysis and bipartite graphs analysis

Publication Type:
Conference Proceeding
Citation:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, 6178 LNAI pp. 270 - 280
Issue Date:
2010-07-29
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013007798OK.pdf Published version344.14 kB
Adobe PDF
The paper offers a parallel between two approaches to conceptual clustering, namely formal concept analysis (augmented with the introduction of new operators) and bipartite graph analysis. It is shown that a formal concept (as defined in formal concept analysis) corresponds to the idea of a maximal bi-clique, while a "conceptual world" (defined through a Galois connection associated of the new operators) is a disconnected sub-graph in a bipartite graph. The parallel between formal concept analysis and bipartite graph analysis is further exploited by considering "approximation" methods on both sides. It leads to suggests new ideas for providing simplified views of datasets. © 2010 Springer-Verlag Berlin Heidelberg.
Please use this identifier to cite or link to this item: