Skip to Main content Skip to Navigation

Clustering bipartite graphs in terms of approximate formal concepts and sub-contexts

Abstract : The paper first 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 sub-contexts, which correspond to independent “conceptual worlds” that can be characterized by means of the new operators introduced, are disconnected sub-graphs 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 suggest new ideas for providing simplified views of datasets, taking also inspiration from the search for approximate itemsets in data mining (with relaxed requirements), and the detection of communities in hierarchical small worlds.
Complete list of metadatas

Cited literature [53 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Monday, March 9, 2015 - 9:39:24 AM
Last modification on : Thursday, March 26, 2020 - 5:33:02 PM
Document(s) archivé(s) le : Monday, April 17, 2017 - 5:41:12 AM


Files produced by the author(s)




Bruno Gaume, Emmanuel Navarro, Henri Prade. Clustering bipartite graphs in terms of approximate formal concepts and sub-contexts. International Journal of Computational Intelligence Systems, Atlantis Press, 2013, vol. 6 (n° 6), pp. 1125-1142. ⟨10.1080/18756891.2013.819179⟩. ⟨hal-01127983⟩



Record views


Files downloads