A robust subspace clustering algorithm

MaRDI QIDQ2886526zbMATH OpenFDO

Authors Liuqing Peng, Junying Zhang

Publication date 1 June 2012

Published in Journal of Xi'an Jiaotong University (Search for Journal in Brave)

zbMATH Keywords

optimizationrobustnesssubspace clusteringweight

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Robust subspace clustering
• scientific article; zbMATH DE number 6961881
• Subspace clustering with automatic feature grouping
• scientific article; zbMATH DE number 5951453
• Noisy sparse subspace clustering

Cited in

(10)

• SMART: a subspace clustering algorithm that automatically identifies the appropriate number of clusters
• A geometric analysis of subspace clustering with outliers
• Robust subspace clustering
• Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
• Kernel truncated regression representation for robust subspace clustering
• Robust Subspace Clustering via Thresholding
• scientific article; zbMATH DE number 5951453 (Why is no real title available?)
• How to Round Subspaces: A New Spectral Clustering Algorithm
• scientific article; zbMATH DE number 7156497 (Why is no real title available?)
• Robust subspace clustering based on automatic weighted multiple kernel learning

This page was built for publication: A robust subspace clustering algorithm

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