Deeply transformed subspace clustering

Abstract Subspace clustering assumes that the data is separable into separate subspaces; this assumption may not always hold. For such cases, we assume that, even if the raw data is not separable into subspaces, one can learn a deep representation such that the learnt representation is separable into subspaces. To achieve the intended goal, we propose to embed subspace clustering techniques (locally linear manifold clustering, sparse subspace clustering and low rank representation) into deep transform learning. The entire formulation is jointly learnt; giving rise to a new class of methods called deeply transformed subspace clustering (DTSC). To test the performance of the proposed techniques, benchmarking is performed on image clustering problems. Comparison with state-of-the-art clustering techniques shows that our formulation improves upon them.

[1]  Inderjit S. Dhillon,et al.  Kernel k-means: spectral clustering and normalized cuts , 2004, KDD.

[2]  Zongben Xu,et al.  Sparse solution of underdetermined linear equations via adaptively iterative thresholding , 2013, Signal Process..

[3]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[4]  Yoram Bresler,et al.  Closed-form solutions within sparsifying transform learning , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[5]  Zhi-Quan Luo,et al.  Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems , 2014, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[6]  René Vidal,et al.  Sparse Subspace Clustering: Algorithm, Theory, and Applications , 2012, IEEE transactions on pattern analysis and machine intelligence.

[7]  Jyoti Maggu,et al.  Unsupervised Deep Transform Learning , 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[8]  Mehmet Türkan,et al.  A review of sparsity-based clustering methods , 2018, Signal Process..

[9]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .

[10]  Enhong Chen,et al.  Learning Deep Representations for Graph Clustering , 2014, AAAI.

[11]  Yong Yu,et al.  Robust Recovery of Subspace Structures by Low-Rank Representation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Ali Farhadi,et al.  Unsupervised Deep Embedding for Clustering Analysis , 2015, ICML.

[13]  Zhongzhi Shi,et al.  A multiway p-spectral clustering algorithm , 2019, Knowl. Based Syst..

[14]  Émilie Chouzenoux,et al.  Transformed Locally Linear Manifold Clustering , 2018, 2018 26th European Signal Processing Conference (EUSIPCO).

[15]  René Vidal,et al.  Latent Space Sparse Subspace Clustering , 2013, 2013 IEEE International Conference on Computer Vision.

[16]  Gang Wei,et al.  Accelerated reweighted nuclear norm minimization algorithm for low rank matrix recovery , 2015, Signal Process..

[17]  Yoram Bresler,et al.  Learning Sparsifying Transforms , 2013, IEEE Transactions on Signal Processing.

[18]  Yoram Bresler,et al.  Online Sparsifying Transform Learning—Part II: Convergence Analysis , 2015, IEEE Journal of Selected Topics in Signal Processing.

[19]  René Vidal,et al.  Subspace Clustering , 2011, IEEE Signal Processing Magazine.

[20]  René Vidal,et al.  Ieee Journal of Selected Topics in Signal Processing, Vol. X, No. X, Month 20xx 1 Latent Space Sparse and Low-rank Subspace Clustering , 2022 .

[21]  George Trigeorgis,et al.  A Deep Semi-NMF Model for Learning Hidden Representations , 2014, ICML.

[22]  René Vidal,et al.  Segmenting Motions of Different Types by Unsupervised Manifold Clustering , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[23]  Shifei Ding,et al.  A semi-supervised approximate spectral clustering algorithm based on HMRF model , 2018, Inf. Sci..

[24]  Bo Yang,et al.  Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering , 2016, ICML.