The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2018 vol. 40)
ISSN: 0162-8828
pp: 2469-2483
Hongfu Liu , Northeastern University, Somerville, MA, USA
Zhiqiang Tao , Northeastern University, Somerville, MA, USA
Yun Fu , Northeastern University, Somerville, MA, USA
ABSTRACT
Constrained clustering uses pre-given knowledge to improve the clustering performance. Here we use a new constraint called partition level side information and propose the Partition Level Constrained Clustering (PLCC) framework, where only a small proportion of the data is given labels to guide the procedure of clustering. Our goal is to find a partition which captures the intrinsic structure from the data itself, and also agrees with the partition level side information. Then we derive the algorithm of partition level side information based on K-means and give its corresponding solution. Further, we extend it to handle multiple side information and design the algorithm of partition level side information for spectral clustering. Extensive experiments demonstrate the effectiveness and efficiency of our method compared to pairwise constrained clustering and ensemble clustering methods, even in the inconsistent cluster number setting, which verifies the superiority of partition level side information to pairwise constraints. Besides, our method has high robustness to noisy side information, and we also validate the performance of our method with multiple side information. Finally, the image cosegmentation application based on saliency-guided side information demonstrates the effectiveness of PLCC as a flexible framework in different domains, even with the unsupervised side information.
INDEX TERMS
Clustering algorithms, Partitioning algorithms, Noise measurement, Robustness, Algorithm design and analysis
CITATION

H. Liu, Z. Tao and Y. Fu, "Partition Level Constrained Clustering," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 40, no. 10, pp. 2469-2483, 2018.
doi:10.1109/TPAMI.2017.2763945
87 ms
(Ver 3.3 (11022016))