Projective unsupervised flexible embedding with optimal graph

Wei Wang, Yan Yan, Feiping Nie, Xavier Alameda Pineda, Shuicheng Yan, Nicu Sebe

Research output: Contribution to conferencePaperpeer-review

Abstract

Graph based dimensionality reduction techniques have been successfully applied to clustering and classification tasks. The fundamental basis of these algorithms is the constructed graph which dominates their performance. Usually, the graph is defined by the input affinity matrix. However, the affinity matrix is sub-optimal for dimension reduction as there is much noise in the data. To address this issue, we propose the projective unsupervised flexible embedding with optimal graph (PUFE-OG) model. We build an optimal graph by adjusting the affinity matrix. To tackle the out-of-sample problem, we employ a linear regression term to learn a projection matrix. The optimal graph and projection matrix are jointly learned by integrating the manifold regularizer and regression residual into a unified model. An efficient algorithm is derived to solve the challenging model. The experimental results on several public benchmark datasets demonstrate that the presented PUFE-OG outperforms other state-of-the-art methods.

Original languageEnglish
Pages100.1-100.12
DOIs
StatePublished - 2016
Event27th British Machine Vision Conference, BMVC 2016 - York, United Kingdom
Duration: 19 Sep 201622 Sep 2016

Conference

Conference27th British Machine Vision Conference, BMVC 2016
Country/TerritoryUnited Kingdom
CityYork
Period19/09/1622/09/16

Fingerprint

Dive into the research topics of 'Projective unsupervised flexible embedding with optimal graph'. Together they form a unique fingerprint.

Cite this