Scaled Simplex Representation for Subspace Clustering

The self-expressive property of data points, that is, each data point can be linearly represented by the other data points in the same subspace, has proven effective in leading subspace clustering (SC) methods. Most self-expressive methods usually construct a feasible affinity matrix from a coeffici...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on cybernetics Vol. 51; no. 3; pp. 1493 - 1505
Main Authors:	Xu, Jun, Yu, Mengyang, Shao, Ling, Zuo, Wangmeng, Meng, Deyu, Zhang, Lei, Zhang, David
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.03.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Affinity Algorithms Clustering Clustering algorithms Coefficients Computational modeling Constraints Correlation Data models Data points Iterative methods Mathematical analysis Matrix methods Optimization Representations Scaled simplex representation (SSR) self-expressiveness Statistical analysis subspace clustering (SC) Subspaces
ISSN:	2168-2267, 2168-2275, 2168-2275
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!