Regularized ℓ1-Graph for data clustering

Yingzhen Yang, Zhangyang Wang, Jianchao Yang, Jiawei Han, Thomas S. Huang

Research output: Contribution to conferencePaperpeer-review


1-Graph has been proven to be effective in data clustering, which partitions the data space by using the sparse representation of the data as the similarity measure. However, the sparse representation is performed for each datum independently without taking into account the geometric structure of the data. Motivated by ℓ1-Graph and manifold leaning, we propose Regularized ℓ1-Graph (Rℓ1-Graph) for data clustering. Compared to ℓ1-Graph, the sparse representations of Rℓ1-Graph are regularized by the geometric information of the data. In accordance with the manifold assumption, the sparse representations vary smoothly along the geodesics of the data manifold through the graph Laplacian constructed by the sparse codes. Experimental results on various data sets demonstrate the superiority of our algorithm compared to ℓ1-Graph and other competing clustering methods.

Original languageEnglish (US)
StatePublished - 2014
Event25th British Machine Vision Conference, BMVC 2014 - Nottingham, United Kingdom
Duration: Sep 1 2014Sep 5 2014


Other25th British Machine Vision Conference, BMVC 2014
Country/TerritoryUnited Kingdom

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition


Dive into the research topics of 'Regularized ℓ1-Graph for data clustering'. Together they form a unique fingerprint.

Cite this