LOF: identifying density-based local outliers
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Constrained K-means Clustering with Background Knowledge
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Integrating constraints and metric learning in semi-supervised clustering
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Landscape of Clustering Algorithms
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Learning a Mahalanobis Metric from Equivalence Constraints
The Journal of Machine Learning Research
A Discriminative Learning Framework with Pairwise Constraints for Video Object Classification
IEEE Transactions on Pattern Analysis and Machine Intelligence
BoostCluster: boosting clustering by pairwise constraints
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Clustering Using a Similarity Measure Based on Shared Near Neighbors
IEEE Transactions on Computers
Active semi-supervised fuzzy clustering
Pattern Recognition
Constrained Clustering: Advances in Algorithms, Theory, and Applications
Constrained Clustering: Advances in Algorithms, Theory, and Applications
Improving Classification with Pairwise Constraints: A Margin-Based Approach
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Unsupervised Face Annotation by Mining the Web
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
C-DBSCAN: Density-Based Clustering with Constraints
RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Some new directions in graph-based semi-supervised learning
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Semi-supervised clustering with metric learning: An adaptive kernel method
Pattern Recognition
Data clustering: 50 years beyond K-means
Pattern Recognition Letters
Value, cost, and sharing: open issues in constrained clustering
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
Flexible constrained spectral clustering
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Boosting Clustering by Active Constraint Selection
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
An Efficient Active Constraint Selection Algorithm for Clustering
ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
Active Learning for Semi-Supervised K-Means Clustering
ICTAI '10 Proceedings of the 2010 22nd IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Measuring constraint-set utility for partitional clustering algorithms
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
An adaptive kernel method for semi-supervised clustering
ECML'06 Proceedings of the 17th European conference on Machine Learning
Agglomerative hierarchical clustering with constraints: theoretical and empirical results
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Active constrained clustering by examining spectral eigenvectors
DS'05 Proceedings of the 8th international conference on Discovery Science
A Kernel Approach for Semisupervised Metric Learning
IEEE Transactions on Neural Networks
Active selection of clustering constraints: a sequential approach
Pattern Recognition
Hi-index | 0.01 |
In this article, we address the problem of automatic constraint selection to improve the performance of constraint-based clustering algorithms. To this aim we propose a novel active learning algorithm that relies on a k-nearest neighbors graph and a new constraint utility function to generate queries to the human expert. This mechanism is paired with propagation and refinement processes that limit the number of constraint candidates and introduce a minimal diversity in the proposed constraints. Existing constraint selection heuristics are based on a random selection or on a min-max criterion and thus are either inefficient or more adapted to spherical clusters. Contrary to these approaches, our method is designed to be beneficial for all constraint-based clustering algorithms. Comparative experiments conducted on real datasets and with two distinct representative constraint-based clustering algorithms show that our approach significantly improves clustering quality while minimizing the number of human expert solicitations.