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
Spatial Clustering in the Presence of Obstacles
Proceedings of the 17th International Conference on Data Engineering
AUTOCLUST+: Automatic Clustering of Point-Data Sets in the Presence of Obstacles
TSDM '00 Proceedings of the First International Workshop on Temporal, Spatial, and Spatio-Temporal Data Mining-Revised Papers
Learning from Cluster Examples
Machine Learning
Segmentation Given Partial Grouping Constraints
IEEE Transactions on Pattern Analysis and Machine Intelligence
Integrating constraints and metric learning in 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
Supervised clustering with support vector machines
ICML '05 Proceedings of the 22nd international conference on Machine learning
Semi-Supervised Clustering with Metric Learning Using Relative Comparisons
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Semi-supervised model-based document clustering: A comparative study
Machine Learning
A Bayesian Model for Supervised Clustering with the Dirichlet Process Prior
The Journal of Machine Learning Research
Learning a distance metric for object identification without human supervision
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Hi-index | 0.00 |
Research into (semi-)supervised clustering has been increasing. Supervised clustering aims to group similar data that are partially guided by the user's supervision. In this supervised clustering, there are many choices for formalization. For example, as a type of supervision, one can adopt labels of data points, must/cannot links, and so on. Given a real clustering task, such as grouping documents or image segmentation, users must confront the question "How should we mathematically formalize our task?" To help answer this question, we propose the classification of real clusterings into absolute and relative clusterings, which are defined based on the relationship between the resultant partition and the data set to be clustered. This categorization can be exploited to choose a type of task formalization.