Block diagonal representation learning for robust subspace clustering

DOI10.1016/j.ins.2020.03.103zbMath1458.68186OpenAlexW3014964857MaRDI QIDQ2663584

Jiawen Huang, Ruichu Cai, Ming Yin, Zhifeng Hao, Li Juan Wang

Publication date: 19 April 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2020.03.103

zbMATH Keywords

robustnessspectral clusteringsubspace clusteringblock diagonalsimilarity matrix

Mathematics Subject Classification ID

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

Related Items

A class-specific mean vector-based weighted competitive and collaborative representation method for classification ⋮ Multi-objective soft subspace clustering in the composite kernel space ⋮ Multi-view support vector ordinal regression with data uncertainty ⋮ A structure noise-aware tensor dictionary learning method for high-dimensional data clustering

Uses Software

• Fashion-MNIST

Cites Work

• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Robust principal component analysis?
• Introduction to Information Retrieval
• Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering
• Subspace Clustering via Learning an Adaptive Low-Rank Graph
• Metrics and models for handwritten character recognition