Community Detection and Link Prediction via Cluster-driven Low-rank Matrix Completion

Community detection and link prediction are highly dependent since knowing cluster structure as a priori will help identify missing links, and in return, clustering on networks with supplemented missing links will improve community detection performance. In this paper, we propose a Clusterdriven Low-rank Matrix Completion (CLMC), for performing community detection and link prediction simultaneously in a unified framework. To this end, CLMC decomposes the adjacent matrix of a target network as three additive matrices: clustering matrix, noise matrix and supplement matrix. The community-structure and low-rank constraints are imposed on the clustering matrix, such that the noisy edges between communities are removed and the resulting matrix is an ideal block-diagonal matrix. Missing edges are further learned via low-rank matrix completion. Extensive experiments show that CLMC achieves state-of-the-art performance.

[1]  Nagarajan Natarajan,et al.  Inductive matrix completion for predicting gene–disease associations , 2014, Bioinform..

[2]  E. Silerova,et al.  Knowledge and information systems , 2018 .

[3]  Emmanuel J. Candès,et al.  A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..

[4]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Michael William Newman,et al.  The Laplacian spectrum of graphs , 2001 .

[6]  Chengqi Zhang,et al.  Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2015, KDD.

[7]  Michael I. Jordan,et al.  Advances in Neural Information Processing Systems 30 , 1995 .

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

[9]  Christian Böhm,et al.  Synchronization-based scalable subspace clustering of high-dimensional data , 2016, Knowledge and Information Systems.

[10]  Nicholas I. M. Gould,et al.  SIAM Journal on Optimization , 2012 .

[11]  Stefan Kramer,et al.  Graph Clustering with Local Density-Cut , 2018, DASFAA.

[12]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[13]  William M. Rand,et al.  Objective Criteria for the Evaluation of Clustering Methods , 1971 .

[14]  R. Fildes.  Journal of the American Statistical Association : William S. Cleveland, Marylyn E. McGill and Robert McGill, The shape parameter for a two variable graph 83 (1988) 289-300 , 1989 .

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

[16]  Jicong Fan,et al.  Matrix completion by least-square, low-rank, and sparse self-representations , 2017, Pattern Recognit..

[17]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[18]  Junming Shao,et al.  Community Detection based on Distance Dynamics , 2015, KDD.

[19]  Jinbo Bi,et al.  A Sparse Interactive Model for Matrix Completion with Side Information , 2016, NIPS.

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

[21]  K. Fan.  On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations I. , 1949, Proceedings of the National Academy of Sciences of the United States of America.

[22]  Christian Böhm,et al.  FUSE: Full Spectral Clustering , 2016, KDD.

[23]  Arieh Iserles,et al.  On the Foundations of Computational Mathematics , 2001 .

[24]  Trevor J. Hastie,et al.  Matrix completion and low-rank SVD via fast alternating least squares , 2014, J. Mach. Learn. Res..

[25]  Fernando Berzal Galiano,et al.  A Survey of Link Prediction in Complex Networks , 2016, ACM Comput. Surv..

[26]  O. Bagasra,et al.  Proceedings of the National Academy of Sciences , 1914, Science.

[27]  J. Hanley,et al.  The meaning and use of the area under a receiver operating characteristic (ROC) curve. , 1982, Radiology.

[28]  Andrea Montanari,et al.  Matrix Completion from Noisy Entries , 2009, J. Mach. Learn. Res..

[29]  H. Damasio,et al.  IEEE Transactions on Pattern Analysis and Machine Intelligence: Special Issue on Perceptual Organization in Computer Vision , 1998 .

[30]  Jun Fang,et al.  Fast Low-Rank Bayesian Matrix Completion With Hierarchical Gaussian Prior Models , 2017, IEEE Transactions on Signal Processing.