Local subspace clustering

DOI10.16383/J.AAS.2016.C150335zbMATH Open1374.68401WikidataQ118420547 ScholiaQ118420547MaRDI QIDQ5276271FDOQ5276271

Authors: Zhanjie Liu, Xiaoyun Chen 

Publication date: 14 July 2017

Recommendations

• Subspace clustering by \((k,k)\)-sparse matrix factorization
• scientific article; zbMATH DE number 7156497
• Robust subspace clustering
• A subspace clustering algorithm based on simultaneously sparse and low-rank representation
• High dimension small sample data clustering using kernel least square regression subspace segmentation

zbMATH Keywords

nearest neighborssubspace clusteringgene expression dataimage datalocal linear data set

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Cited In (14)

• Nonlinear skeletons of data sets and applications -- methods based on subspace clustering
• Low-rank local tangent space embedding for subspace clustering
• Reconstruction model and fast algorithm for subspace clustering
• Weighted low rank subspace clustering based on \({\ell_2}\) norm
• Lossy compression approach to subspace clustering
• An accelerated gradient method for nonconvex sparse subspace clustering problem
• A subspace clustering method based on class-wise sparse and low-rank representation
• High dimension small sample data clustering using kernel least square regression subspace segmentation
• Local multidimensional scaling
• Subspace learning by \(\ell^0\)-induced sparsity
• Title not available (Why is that?)
• A Novel Subspace Clustering Method for Dictionary Design
• Hybrid linear modeling via local best-fit flats
• Subspace clustering by \((k,k)\)-sparse matrix factorization

This page was built for publication: Local subspace clustering

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