Co-clustering documents and words using bipartite spectral graph partitioning
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Structured Features from Concept Lattices for Unsupervised Learning and Classification
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
An Attribute Redundancy Measure for Clustering
AI '98 Proceedings of the 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Preserving Patterns in Bipartite Graph Partitioning
ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
Computers and Operations Research
A parallel between extended formal concept analysis and bipartite graphs analysis
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Evaluating Community Structure in Bipartite Networks
SOCIALCOM '10 Proceedings of the 2010 IEEE Second International Conference on Social Computing
Possibility theory and formal concept analysis: Characterizing independent sub-contexts
Fuzzy Sets and Systems
Computer Science Review
A Possibility-Theoretic View of Formal Concept Analysis
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
| Hi-index | 0.00 |
In this paper we deal with data stated under the form of a binary relation between objects and properties. We propose an approach for clustering the objects and labeling them with characteristic subsets of properties. The approach is based on a parallel between formal concept analysis and graph clustering. The problem is made tricky due to the fact that generally there is no partitioning of the objects that can be associated with a partitioning of properties. Indeed a relevant partition of objects may exist, whereas it is not the case for properties. In order to obtain a conceptual clustering of the objects, we work with a bipartite graph relating objects with formal concepts. Experiments on artificial benchmarks and real examples show the effectiveness of the method, more particularly the fact that the results remain stable when an increasing number of properties are shared between objects of different clusters.