Multi-view data clustering attracts more attention than their single view counterparts due to the fact that leveraging multiple independent and complementary information from multi-view feature spaces outperforms the single one. Multi-view Spectral Clustering aims at yielding the data partition agreement over their local manifold structures by seeking eigenvalue-eigenvector decompositions. However, as we observed, such classical paradigm still suffers from (1) overlooking the flexible local manifold structure, caused by (2) enforcing the low-rank data correlation agreement among all views; worse still, (3) LRR is not intuitively flexible to capture the latent data clustering structures. In this paper, we present the structured LRR by factorizing into the latent low-dimensional data-cluster representations, which characterize the data clustering structure for each view. Upon such representation, (b) the laplacian regularizer is imposed to be capable of preserving the flexible local manifold structure for each view. (c) We present an iterative multi-view agreement strategy by minimizing the divergence objective among all factorized latent data-cluster representations during each iteration of optimization process, where such latent representation from each view serves to regulate those from other views, such intuitive process iteratively coordinates all views to be agreeable. (d) We remark that such data-cluster representation can flexibly encode the data clustering structure from any view with adaptive input cluster number. To this end, (e) a novel non-convex objective function is proposed via the efficient alternating minimization strategy. The complexity analysis are also presented. The extensive experiments conducted against the real-world multi-view datasets demonstrate the superiority over state-of-the-arts.
Robust Unsupervised Flexible Auto-weighted Local-Coordinate Concept Factorization for Image Clustering
Soochow University(苏州大学);Hefei University of Technology(合肥工业大学);Adobe Research(奥多比研究院);Nanjing University of Information Science and Technology(南京信息工程大学);National University of Singapore(新加坡国立大学)
Graph Regularized Non-negative Matrix Factorization By Maximizing Correntropy
University of Waterloo(滑铁卢大学);University of North Georgia(北佐治亚大学);Beijing University of Posts and Telecommunications(北京邮电大学);Huazhong University of Science and Technology(华中科技大学)
LoomSC: Scalable Deep Subspace Clustering with Projector Factorization and Exact Spectral Reduction
École de technologie supérieure (ÉTS)(高等技术学院);University of Bahrain (UOB)(巴林大学);Université du Québec à Montréal (UQAM)(魁北克大学蒙特利尔分校);COMSATS University Islamabad(伊斯兰堡COMSATS大学)
Hierarchical Data Generator based on Tree-Structured Stick Breaking Process for Benchmarking Clustering Methods
Wrocław University of Science and Technology(弗罗茨瓦夫理工大学);Complexica Pty Ltd.(Complexica私人有限公司);Institute of Computer Science, Polish Academy of Sciences(波兰科学院计算机科学研究所);Polish-Japanese Academy of Information Technology(波日信息技术学院)
Structured Graph Learning for Scalable Subspace Clustering: From Single-view to Multi-view
School of Computer Science and Engineering, University of Electronic Science and Technology of China(电子科技大学计算机科学与工程学院);School of Resources and Environment, University of Electronic Science and Technology of China(电子科技大学资源与环境学院)
Structured Graph Learning for Clustering and Semi-supervised Classification
University of Electronic Science and Technology of China(电子科技大学);Qingdao University(青岛大学);University of Kentucky(肯塔基大学);National University of Defense Technology(国防科技大学);Harbin Institute of Technology(哈尔滨工业大学)