Constraint projections for semi-supervised affinity propagation

Authors:
Hongjun Wang;Ruihua Nie;Xingnian Liu;Tianrui Li
Affiliations:
School of Information Science & Technology, SouthWest Jiaotong University, 610031 Chengdu, China;State Key Laboratory of Hydraulics and Mountain River Engineering, Sichuan University, 610065 Chengdu, China;State Key Laboratory of Hydraulics and Mountain River Engineering, Sichuan University, 610065 Chengdu, China;School of Information Science & Technology, SouthWest Jiaotong University, 610031 Chengdu, China
Venue:
Knowledge-Based Systems
Year:
2012

Citing 9
Cited 0

Constrained K-means Clustering with Background Knowledge

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
A probabilistic framework for semi-supervised clustering

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Document Clustering Using Locality Preserving Indexing

IEEE Transactions on Knowledge and Data Engineering
Statistical Comparisons of Classifiers over Multiple Data Sets

The Journal of Machine Learning Research
Label Propagation through Linear Neighborhoods

IEEE Transactions on Knowledge and Data Engineering
Constraint projections for ensemble learning

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Clusterer ensemble

Knowledge-Based Systems
Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power

Information Sciences: an International Journal
Parallel Spectral Clustering in Distributed Systems

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Affinity propagation (AP) is introduced as an unsupervised learning algorithm for exemplar-based clustering. A few methods are stated to extend the AP model to account for semi-supervised clustering. In this paper, constraint (cannot-link and must-link) projections are illustrated for semi-supervised AP (CPSSAP), a hierarchical semi-supervised clustering algorithm. It is flexible for the relaxation of some constraints during the learning stage. First, the data points of instance-level constraints and other data points are together projected in a lower dimensional space guided by the constraints. Then, AP is performed on the new data points in the lower dimensional space. Finally, a few datasets are chosen for experimentation from the UCI machine learning repository. The results show that CPSSAP performs better than some existing algorithms. Furthermore, visualizations of the original data and data after the projections show that the data points overlap less after the constraint projections of the datasets.