Pseudo-supervised Deep Subspace Clustering

Abstract

Auto-Encoder (AE)-based deep subspace clustering (DSC) methods have achieved impressive performance due to the powerful representation extracted using deep neural networks while prioritizing categorical separability. However, self-reconstruction loss of an AE ignores rich useful relation information and might lead to indiscriminative representation, which inevitably degrades the clustering performance. It is also challenging to learn high-level similarity without feeding semantic labels. Another unsolved problem facing DSC is the huge memory cost due to \(n\times n\) similarity matrix, which is incurred by the self-expression layer between an encoder and decoder. To tackle these problems, we use pairwise similarity to weigh the reconstruction loss to capture local structure information, while a similarity is learned by the self-expression layer. Pseudo-graphs and pseudo-labels, which allow benefiting from uncertain knowledge acquired during network training, are further employed to sup

Stats

• citations139
• S2 citations—
• github stars0
• HF likes0
• heat score16.10
• arxiv keylv2021pseudo

Related papers

• Deep Metric Learning Meets Deep Clustering: An Novel Unsupervised Approach For Feature Embedding (2020)2.26
• A New Similarity Space Tailored For Supervised Deep Metric Learning (2020)3.58
• A Probabilistic Approach For Learning Embeddings Without Supervision (2019)0.00
• Representation Learning By Reconstructing Neighborhoods (2018)0.00
• Graph-collaborated Auto-encoder Hashing For Multi-view Binary Clustering (2023)14.31
• Discriminative Supervised Subspace Learning For Cross-modal Retrieval (2022)0.00
• Learning Deep Optimal Embeddings With Sinkhorn Divergences (2022)0.00
• Contextually Affinitive Neighborhood Refinery For Deep Clustering (2023)2.26