A rank-constrained matrix representation for hypergraph-based subspace clustering

DOI10.1155/2015/572753MaRDI QIDQ1666026zbMATH OpenOpenAlexWikidataFDO

Authors Y. Aharonov

Publication date 27 August 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2015/572753

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Block diagonal representation learning for robust subspace clustering
• An efficient matrix factorization based low-rank representation for subspace clustering
• Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
• Robust subspace clustering
• Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel

Cites work

• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
• Hypergraph with sampling for image retrieval

Cited in

(4)

• Robust \(\ell_2\)-hypergraph and its applications
• Sparse subspace clustering for data with missing entries and high-rank matrix completion
• Nonnegative self-representation with a fixed rank constraint for subspace clustering
• Block diagonal representation learning for robust subspace clustering

Describes a project that uses

Uses Software

• AR face

This page was built for publication: A rank-constrained matrix representation for hypergraph-based subspace clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1666026)