One-step multi-view spectral clustering by learning common and specific nonnegative embeddings

Multi-view spectral clustering is a hot research area which has attracted increasing attention. Most existing multi-view spectral clustering methods utilize a two-step strategy. The first step obtains a common embedding by fusing spectral embeddings of different views, and the second step conducts hard clustering, such as K-means or spectral rotation, on the common embedding. Because the goal of the first step is not obtaining optimal clustering result, and the requirement to post-processing makes the final clustering result uncertain. In this paper, we propose a novel one-step multi-view spectral clustering method, in which the spectral embedding and nonnegative embedding are unified into one framework. Therefore, our method can avoid the uncertainty brought by post-processing and obtain optimal clustering result. Moreover, the nonnegative embedding is divided into two parts. The common nonnegative embedding indicates the shared cluster structure, and the specific nonnegative embedding indicates the exclusive cluster structure of each view. Hence, our method can well tackle with noises and outliers of different views. Furthermore, an alternating iterative algorithm is used to solve the joint optimization problem. Extensive experimental results on four real-world datasets have demonstrated the effectiveness of the proposed method.

[1]  Zenglin Xu,et al.  Auto-weighted multi-view co-clustering with bipartite graphs , 2020, Inf. Sci..

[2]  Rong Wang,et al.  Multi-view spectral clustering via integrating nonnegative embedding and spectral embedding , 2020, Inf. Fusion.

[3]  Feiping Nie,et al.  Multi-view spectral clustering via sparse graph learning , 2020, Neurocomputing.

[4]  Zhao Zhang,et al.  Multi-view clustering via spectral embedding fusion , 2018, Soft Comput..

[5]  Yuxuan Luo,et al.  A novel dataset-specific feature extractor for zero-shot learning , 2020, Neurocomputing.

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

[7]  Feiping Nie,et al.  Orthogonal and Nonnegative Graph Reconstruction for Large Scale Clustering , 2017, IJCAI.

[8]  Jiancheng Lv,et al.  COMIC: Multi-view Clustering Without Parameter Selection , 2019, ICML.

[9]  Tommy W. S. Chow,et al.  Tree2Vector: Learning a Vectorial Representation for Tree-Structured Data , 2018, IEEE Transactions on Neural Networks and Learning Systems.

[10]  David G. Lowe,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004, International Journal of Computer Vision.

[11]  Shu Wu,et al.  Multiview Clustering via Unified and View-Specific Embeddings Learning , 2018, IEEE Transactions on Neural Networks and Learning Systems.

[12]  Jiawei Han,et al.  Multi-View Clustering via Joint Nonnegative Matrix Factorization , 2013, SDM.

[13]  Geoffrey E. Hinton,et al.  Visualizing Data using t-SNE , 2008 .

[14]  Feiping Nie,et al.  Large-Scale Multi-View Spectral Clustering via Bipartite Graph , 2015, AAAI.

[15]  Qinghua Hu,et al.  Generalized Latent Multi-View Subspace Clustering , 2020, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Ying Liang,et al.  Multi-view projected clustering with graph learning , 2020, Neural Networks.

[17]  Hal Daumé,et al.  A Co-training Approach for Multi-view Spectral Clustering , 2011, ICML.

[18]  Ivica Kopriva,et al.  Multi-view low-rank sparse subspace clustering , 2017, Pattern Recognit..

[19]  Pietro Perona,et al.  Self-Tuning Spectral Clustering , 2004, NIPS.

[20]  Xuelong Li,et al.  Multiview Clustering via Adaptively Weighted Procrustes , 2018, KDD.

[21]  Yongdong Zhang,et al.  Multiview Spectral Embedding , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[22]  Zhihui Li,et al.  Spectral Clustering of Customer Transaction Data With a Two-Level Subspace Weighting Method , 2019, IEEE Transactions on Cybernetics.

[23]  Chang Tang,et al.  Diversity and consistency learning guided spectral embedding for multi-view clustering , 2019, Neurocomputing.

[24]  Xiaochun Cao,et al.  Diversity-induced Multi-view Subspace Clustering , 2015, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[25]  ChengXiang Zhai,et al.  Unsupervised Feature Selection for Multi-View Clustering on Text-Image Web News Data , 2014, CIKM.

[26]  Lele Fu,et al.  An overview of recent multi-view clustering , 2020, Neurocomputing.

[27]  Tianrui Li,et al.  Social web video clustering based on multi-view clustering via nonnegative matrix factorization , 2019, Int. J. Mach. Learn. Cybern..

[28]  Cai Xu,et al.  Deep Multi-View Concept Learning , 2018, IJCAI.

[29]  Hal Daumé,et al.  Co-regularized Multi-view Spectral Clustering , 2011, NIPS.

[30]  Wenzhong Yang,et al.  Study on multiple targets tracking algorithm based on multiple sensors , 2018, Cluster Computing.

[31]  Chris H. Q. Ding,et al.  On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering , 2005, SDM.

[32]  Jiwen Lu,et al.  Structured general and specific multi-view subspace clustering , 2019, Pattern Recognit..

[33]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

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

[35]  Jeff A. Bilmes,et al.  On Deep Multi-View Representation Learning , 2015, ICML.

[36]  Hong Yu,et al.  Multi-view clustering via multi-manifold regularized non-negative matrix factorization , 2017, Neural Networks.