Algorithms for clustering data
Algorithms for clustering data
IEEE Transactions on Pattern Analysis and Machine Intelligence
Bayesian classification (AutoClass): theory and results
Advances in knowledge discovery and data mining
Knowledge Acquisition Via Incremental Conceptual Clustering
Machine Learning
Comparison of Three Objective Functions for Conceptual Clustering
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
Iterative optimization and simplification of hierarchical clusterings
Journal of Artificial Intelligence Research
Parameter-Free Hierarchical Co-clustering by n-Ary Splits
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Towards fault-tolerant formal concept analysis
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Towards constrained co-clustering in ordered 0/1 data sets
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
A bi-clustering framework for categorical data
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
From local pattern mining to relevant bi-cluster characterization
IDA'05 Proceedings of the 6th international conference on Advances in Intelligent Data Analysis
Contribution to gene expression data analysis by means of set pattern mining
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Parameter-less co-clustering for star-structured heterogeneous data
Data Mining and Knowledge Discovery
Hierarchical co-clustering: off-line and incremental approaches
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
In this paper, we consider unsupervised clustering as a combinatorial optimization problem. We focus on the use of Local Search procedures to optimize an association coefficient whose aim is to construct a couple of conceptual partitions, one on the set of objects and the other one on the set of attribute-value pairs. We present a study of the variation of the function in order to decrease the complexity of local search and to propose stochastic local search. Performances of the given algorithms are tested on synthetic data sets and the real data set Vote taken from the UCI Irvine repository.