A parallel between extended formal concept analysis and bipartite graphs analysis

Authors:
Bruno Gaume;Emmanuel Navarro;Henri Prade
Affiliations:
CLLE, ERSS, Université de Toulouse II;IRIT, Université de Toulouse III;IRIT, Université de Toulouse III
Venue:
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Year:
2010

Citing 6
Cited 3

Efficient mining of association rules using closed itemset lattices

Information Systems
Fuzzy Relational Systems: Foundations and Principles

Fuzzy Relational Systems: Foundations and Principles
Formal Concept Analysis: Foundations and Applications (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)

Formal Concept Analysis: Foundations and Applications (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)
A Possibility-Theoretic View of Formal Concept Analysis

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Finding Top-N Pseudo Formal Concepts with Core Intents

MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Survey: Graph clustering

Computer Science Review

Possibility theory and formal concept analysis: Characterizing independent sub-contexts

Fuzzy Sets and Systems
Clustering sets of objects using concepts-objects bipartite graphs

SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
From Frequent Features to Frequent Social Links

International Journal of Information System Modeling and Design

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.