Robust Subspace Clustering by Learning an Optimal Structured Bipartite Graph via Low-rank Representation

Wei Chang, Feiping Nie, Rong Wang, Xuelong Li

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

This paper addresses the subspace clustering problem based on low-rank representation. Combining with the idea of co-clustering, we proposed to learn an optimal structural bipartite graph. It's different with other classical subspace clustering methods which need spectral clustering as post-processing on the constructed graph to get the final result, our method can directly learn a structural graph with k connected components so that the different clusters are obtained easily. Furthermore, we introduce a regularization term of error matrix to our model which helps the proposed algorithm to be more effective to learn an optimal graph under the circumstances of various noise. Experimental results both on synthetic and benchmark datasets are presented to show the effectiveness and robustness of our model.

Original languageEnglish
Title of host publication2019 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3692-3696
Number of pages5
ISBN (Electronic)9781479981311
DOIs
StatePublished - May 2019
Event44th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019 - Brighton, United Kingdom
Duration: 12 May 201917 May 2019

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume2019-May
ISSN (Print)1520-6149

Conference

Conference44th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019
Country/TerritoryUnited Kingdom
CityBrighton
Period12/05/1917/05/19

Keywords

  • Bipartite Graph
  • Laplacian Rank Constraint
  • Low-Rank Representation
  • Subspace Clustering

Fingerprint

Dive into the research topics of 'Robust Subspace Clustering by Learning an Optimal Structured Bipartite Graph via Low-rank Representation'. Together they form a unique fingerprint.

Cite this