Self-Paced Multi-Task Multi-View Capped-norm Clustering

Recently, multi-task multi-view clustering (MTMVC) which is able to utilize the relation of different tasks and the information from multiple views under each task to improve the clustering performance has attracted more and more attentions. However, MTMVC typically solves a non-convex optimization problem and thus is easy to stuck into bad local optima. In addition, noises and outliers generally have negative effects on the clustering performance. To alleviate these problems, we propose a novel self-paced multi-task multi-view capped-norm clustering (SPMTMVCaC) method, which progressively selects data samples to train the MTMVC model from simplicity to complexity. A novel capped-norm term is embedded into the objective of SPMTMVCaC model to reduce the negative influence of noises and outliers, and to further enhance the clustering performance. An efficient alternating optimization method is developed to solve the proposed model. Experimental results on real data sets demonstrate the effectiveness and robustness of the proposed method.

[1]  Hans-Peter Kriegel,et al.  OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.

[2]  Zenglin Xu,et al.  Self-Paced Multi-Task Clustering , 2018, Neurocomputing.

[3]  Pengtao Xie,et al.  Integrating Image Clustering and Codebook Learning , 2015, AAAI.

[4]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[5]  Joydeep Ghosh,et al.  Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..

[6]  Massimiliano Pontil,et al.  Regularized multi--task learning , 2004, KDD.

[7]  Carlotta Domeniconi,et al.  A Weighted Adaptive Mean Shift Clustering Algorithm , 2014, SDM.

[8]  Zenglin Xu,et al.  Robust Softmax Regression for Multi-class Classification with Self-Paced Learning , 2017, IJCAI.

[9]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

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

[11]  Carlotta Domeniconi,et al.  Weighted-Object Ensemble Clustering , 2013, 2013 IEEE 13th International Conference on Data Mining.

[12]  Zenglin Xu,et al.  Adaptive local structure learning for document co-clustering , 2018, Knowl. Based Syst..

[13]  Sungzoon Cho,et al.  Bag-of-concepts: Comprehending document representation through clustering words in distributed representation , 2017, Neurocomputing.

[14]  Carlotta Domeniconi,et al.  Weighted-object ensemble clustering: methods and analysis , 2016, Knowledge and Information Systems.

[15]  Hongqing Zhu,et al.  Merging Student's-t and Rayleigh distributions regression mixture model for clustering time-series , 2017, Neurocomputing.

[16]  Inderjit S. Dhillon,et al.  Co-clustering documents and words using bipartite spectral graph partitioning , 2001, KDD '01.

[17]  Fei-Fei Li,et al.  Shifting Weights: Adapting Object Detectors from Image to Video , 2012, NIPS.

[18]  Yazhou Ren.  Big data clustering and its applications in regional science , 2017 .

[19]  Quanquan Gu,et al.  Learning the Shared Subspace for Multi-task Clustering and Transductive Transfer Classification , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[20]  Xianchao Zhang,et al.  Multi-Task Multi-View Clustering , 2016, IEEE Transactions on Knowledge and Data Engineering.

[21]  Xianchao Zhang,et al.  Multi-Task Multi-View Clustering for Non-Negative Data , 2015, IJCAI.

[22]  Zenglin Xu,et al.  Self-weighted Multiple Kernel Learning for Graph-based Clustering and Semi-supervised Classification , 2018, IJCAI.

[23]  Deyu Meng,et al.  Easy Samples First: Self-paced Reranking for Zero-Example Multimedia Search , 2014, ACM Multimedia.

[24]  Zenglin Xu,et al.  Robust multi-view data clustering with multi-view capped-norm K-means , 2018, Neurocomputing.

[25]  Zenglin Xu,et al.  Unified Spectral Clustering with Optimal Graph , 2017, AAAI.

[26]  Zenglin Xu,et al.  Semi-supervised DenPeak Clustering with Pairwise Constraints , 2018, PRICAI.

[27]  Yueting Zhuang,et al.  Self-Paced Boost Learning for Classification , 2016, IJCAI.

[28]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[29]  Zenglin Xu,et al.  Balanced self-paced learning with feature corruption , 2017, 2017 International Joint Conference on Neural Networks (IJCNN).

[30]  Zenglin Xu,et al.  Learning from semantically dependent multi-tasks , 2017, 2017 International Joint Conference on Neural Networks (IJCNN).

[31]  Uday Kamath,et al.  Boosted Mean Shift Clustering , 2014, ECML/PKDD.

[32]  Zenglin Xu,et al.  Self-weighted multi-view clustering with soft capped norm , 2018, Knowl. Based Syst..

[33]  Fillia Makedon,et al.  Fast Nonnegative Matrix Tri-Factorization for Large-Scale Data Co-Clustering , 2011, IJCAI.

[34]  Shiguang Shan,et al.  Self-Paced Curriculum Learning , 2015, AAAI.

[35]  Zenglin Xu,et al.  Robust graph regularized nonnegative matrix factorization for clustering , 2017, Data Mining and Knowledge Discovery.

[36]  Daphne Koller,et al.  Self-Paced Learning for Latent Variable Models , 2010, NIPS.

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

[38]  Zenglin Xu,et al.  Regularized Multi-source Matrix Factorization for Diagnosis of Alzheimer's Disease , 2017, ICONIP.

[39]  Feiping Nie,et al.  Robust Capped Norm Nonnegative Matrix Factorization: Capped Norm NMF , 2015, CIKM.

[40]  Peter J. Rousseeuw,et al.  Clustering by means of medoids , 1987 .