Fast training of support vector machines using sequential minimal optimization
Advances in kernel methods
Support vector domain description
Pattern Recognition Letters - Special issue on pattern recognition in practice VI
Two-phase clustering process for outliers detection
Pattern Recognition Letters
Clustering based on conditional distributions in an auxiliary space
Neural Computation
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
Integrating constraints and metric learning in semi-supervised clustering
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Boosting margin based distance functions for clustering
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Locally linear metric adaptation for semi-supervised clustering
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Learning a Mahalanobis Metric from Equivalence Constraints
The Journal of Machine Learning Research
Active semi-supervised fuzzy clustering
Pattern Recognition
Constrained Clustering: Advances in Algorithms, Theory, and Applications
Constrained Clustering: Advances in Algorithms, Theory, and Applications
Learning a Mahalanobis distance metric for data clustering and classification
Pattern Recognition
Minimum spanning tree based one-class classifier
Neurocomputing
Clustering with Constrained Similarity Learning
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
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
An Efficient Active Constraint Selection Algorithm for Clustering
ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
Constraint scores for semi-supervised feature selection: A comparative study
Pattern Recognition Letters
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
Improving constrained clustering with active query selection
Pattern Recognition
Active constrained clustering by examining spectral eigenvectors
DS'05 Proceedings of the 8th international conference on Discovery Science
Metric and kernel learning using a linear transformation
The Journal of Machine Learning Research
Fast semi-supervised clustering with enhanced spectral embedding
Pattern Recognition
Hi-index | 0.01 |
This paper examines active selection of clustering constraints, which has become a topic of significant interest in constrained clustering. Active selection of clustering constraints, which is known as minimizing the cost of acquiring constraints, also includes quantifying utility of a given constraint set. A sequential method is proposed in this paper to select the most beneficial set of constraints actively. The proposed method uses information of boundary points and transition regions extracted by data description methods to introduce a utility measure for constraints. Since previously selected constraints affect the utility of remaining candidate constraints, a method is proposed to update the utility of remaining constraints after selection of each constraint. Experiments carried out on synthetic and real datasets show that the proposed method improves the accuracy of clustering while reducing human interaction.