AN NMF-Based Community Detection Method Regularized with Local and Global Information

Community identification is an important task in complex network analysis. Recently, Nonnegative Matrix Factorization (NMF) has been successfully used as an effective tool to discover community structures due to its powerful interpretability property. The main issues of this model are requiring a prior knowledge about the community structure and weak stability of the solution. To tackle these issues, in this paper a novel NMF-based method is proposed by incorporating both local and global information to the community identification process. The proposed method first, is mapped the graph into a data space using linear sparse coding. Then a novel metric is proposed to identify community centers that are used to form micro-communities. These micro-communities are further used to identify positive and negative edges that considered in global information regularization term. The local information of the graph is also used in the objective function our NMF-based model. Finally, the objective function is solved to form final communities. The experimental results on three real-world networks denote the superiority of proposed method compared to several well-known and state-of-the-art methods.

[1]  Qing Zhang,et al.  Community detection based on local topological information and its application in power grid , 2015, Neurocomputing.

[2]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[3]  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.

[4]  Fei Wang,et al.  Community discovery using nonnegative matrix factorization , 2011, Data Mining and Knowledge Discovery.

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

[6]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[7]  Arif Mahmood,et al.  Subspace Based Network Community Detection Using Sparse Linear Coding , 2016, IEEE Transactions on Knowledge and Data Engineering.

[8]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[9]  Jie Cao,et al.  Weighted modularity optimization for crisp and fuzzy community detection in large-scale networks , 2016 .

[10]  G. Caldarelli,et al.  Detecting communities in large networks , 2004, cond-mat/0402499.

[11]  Francesco Masulli,et al.  A survey of kernel and spectral methods for clustering , 2008, Pattern Recognit..

[12]  Parham Moradi,et al.  A multi-objective particle swarm optimization algorithm for community detection in complex networks , 2017, Swarm Evol. Comput..

[13]  Xiao Liu,et al.  Community detection enhancement using non-negative matrix factorization with graph regularization , 2016 .

[14]  Parham Moradi,et al.  On the modularity improvement for community detection in overlapping social networks , 2016, 2016 8th International Symposium on Telecommunications (IST).

[15]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Chih-Jen Lin,et al.  On the Convergence of Multiplicative Update Algorithms for Nonnegative Matrix Factorization , 2007, IEEE Transactions on Neural Networks.

[17]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

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

[19]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Tao Xu,et al.  Learning community structures: Global and local perspectives , 2017, Neurocomputing.

[21]  Parham Moradi,et al.  A multi-objective genetic algorithm for community detection in weighted networks , 2016, 2016 Eighth International Conference on Information and Knowledge Technology (IKT).

[22]  Bo Tian,et al.  Community detection method based on mixed-norm sparse subspace clustering , 2018, Neurocomputing.

[23]  Stephen Roberts,et al.  Overlapping community detection using Bayesian non-negative matrix factorization. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Matjaz Perc,et al.  Information cascades in complex networks , 2017, J. Complex Networks.

[25]  Yang Yang,et al.  Maximizing modularity intensity for community partition and evolution , 2013, Inf. Sci..

[26]  Neda Binesh,et al.  Fuzzy clustering in community detection based on nonnegative matrix factorization with two novel evaluation criteria , 2017, Appl. Soft Comput..

[27]  Xiaojun Wu,et al.  Graph Regularized Nonnegative Matrix Factorization for Data Representation , 2017, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[28]  T. Nepusz,et al.  Fuzzy communities and the concept of bridgeness in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Stephen G. Kobourov,et al.  Visualizing Graphs as Maps with Contiguous Regions , 2014, EuroVis.

[31]  C. Tappert,et al.  A Survey of Binary Similarity and Distance Measures , 2010 .

[32]  Abdelouahab Moussaoui,et al.  Community detection in networks based on minimum spanning tree and modularity , 2016 .

[33]  R. Vidal,et al.  Sparse Subspace Clustering: Algorithm, Theory, and Applications. , 2013, IEEE transactions on pattern analysis and machine intelligence.