Indexed by:
Abstract:
Existing subspace clustering methods usually rest on a global linear data set, which expresses each data point as a linear combination of all other data points, and thus common methods are not well suited for the nonlinear data. To overcome this limitation, the local sparse subspace clustering and local least squares regression subspace clustering are proposed. The idea of the two new methods comes from manifold learning which expresses each data point as a linear combination of its k nearest neighbors, and is combined with sparse subspace clustering and least squares subspace clustering respectively. Experimental results show that our method is effective on two-moon synthetic data, six image data sets and four gene expression data sets. Copyright © 2016 Acta Automatica Sinica. All rights reserved.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
Acta Automatica Sinica
ISSN: 0254-4156
CN: 11-2109/TP
Year: 2016
Issue: 8
Volume: 42
Page: 1238-1247
Cited Count:
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: