Integrating Pairwise Constraints into Clustering Algorithms: Optimization-Based Approaches
2011
In this paper we introduce new models for semi-supervised clustering problem, in particular we address this problem from the representation space point of view. Given a dataset enhanced with constraints (typically must-link and cannot-link constraints) and any clustering algorithm, the proposed approach aims at learning a projection space for the dataset that satisfies not only the constraints but also the required objective of the clustering algorithm on unenhanced data. We propose a boosting framework to weight the constraints and infers successive projection spaces in such a way that algorithm performance is improved. We experiment this approach on standard UCI datasets and show the effectiveness of our algorithm.
Keywords:
- Artificial intelligence
- Data stream clustering
- k-medians clustering
- Machine learning
- Computer science
- Cluster analysis
- Correlation clustering
- Canopy clustering algorithm
- Constrained clustering
- FLAME clustering
- CURE data clustering algorithm
- Pattern recognition
- Determining the number of clusters in a data set
- Data mining
- Fuzzy clustering
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
12
References
5
Citations
NaN
KQI