CONVEX CONSTRAINED CLUSTERING WITH GRAPH-LAPLACIAN PCA

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)

2 Scopus Citations
View graph of relations

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publication2018 IEEE International Conference on Multimedia and Expo (ICME)
PublisherIEEE
ISBN (Electronic)978-1-5386-1737-3
Publication statusPublished - Jul 2018

Conference

Title2018 IEEE International Conference on Multimedia and Expo (ICME)
PlaceUnited States
CitySan Diego
Period23 - 27 July 2018

Abstract

In this paper, we propose a new algorithm for constrained clustering, in which a new regularizer elegantly incorporates a small amount of weakly supervisory information in the form of pair-wise constraints to regularize the similarity between the low-dimensional representations of a set of data samples. By exploring both the local and global structures of the data samples with the guidance of the supervisory information, the proposed algorithm is capable of learning the lowdimensional representations with strong separability. Technically, the proposed algorithm is formulated and relaxed as a convex optimization model, which is further efficiently solved with the global convergence guaranteed. Experimental results on multiple benchmark data sets show that our proposed model can produce higher clustering accuracy than state-ofthe-art algorithms.

Citation Format(s)

CONVEX CONSTRAINED CLUSTERING WITH GRAPH-LAPLACIAN PCA. / Jia, Yuheng; Kwong, Sam; Hou, Junhui; Wu, Wenhui.

2018 IEEE International Conference on Multimedia and Expo (ICME) . IEEE, 2018.

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)