A Parallel between Extended Formal Concept Analysis and Bipartite Graphs Analysis - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

A Parallel between Extended Formal Concept Analysis and Bipartite Graphs Analysis

Résumé

The paper offers a parallel between two approaches to con-ceptual clustering, namely formal concept analysis (augmented with theintroduction of new operators) and bipartite graph analysis. It is shownthat a formal concept (as defined in formal concept analysis) correspondsto the idea of a maximal bi-clique, while a “conceptual world” (definedthrough a Galois connection associated of the new operators) is a dis-connected sub-graph in a bipartite graph. The parallel between formalconcept analysis and bipartite graph analysis is further exploited by con-sidering “approximation” methods on both sides. It leads to suggests newideas for providing simplified views of datasets.
Fichier principal
Vignette du fichier
ipmu10_274.pdf (278.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00992094 , version 1 (26-05-2016)

Identifiants

  • HAL Id : hal-00992094 , version 1

Citer

Bruno Gaume, Emmanuel Navarro, Henri Prade. A Parallel between Extended Formal Concept Analysis and Bipartite Graphs Analysis. International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems (IPMU 2010), Jun 2010, Heidelberg, Germany. pp.270--280. ⟨hal-00992094⟩
153 Consultations
261 Téléchargements

Partager

Gmail Facebook X LinkedIn More