Nonnegative matrix factorization with mixed hypergraph regularization for community detection

2018 ◽  
Vol 435 ◽  
pp. 263-281 ◽  
Author(s):  
Wenhui Wu ◽  
Sam Kwong ◽  
Yu Zhou ◽  
Yuheng Jia ◽  
Wei Gao
Author(s):  
Jin Huang ◽  
Tinghua Zhang ◽  
Weihao Yu ◽  
Jia Zhu ◽  
Ercong Cai

Community detection is a well-established problem and nontrivial task in complex network analysis. The goal of community detection is to discover community structures in complex networks. In recent years, many existing works have been proposed to handle this task, particularly nonnegative matrix factorization-based method, e.g. HNMF, BNMF, which is interpretable and can learn latent features of complex data. These methods usually decompose the original matrix into two matrixes, in one matrix, each column corresponds to a representation of community and each column of another matrix indicates the membership between overall pairs of communities and nodes. Then they discover the community by updating the two matrices iteratively and learn the shallow feature of the community. However, these methods either ignore the topological structure characteristics of the community or ignore the microscopic community structure properties. In this paper, we propose a novel model, named Modularized Deep NonNegative Matrix Factorization (MDNMF) for community detection, which preserves both the topology information and the instinct community structure properties of the community. The experimental results show that our proposed models can significantly outperform state-of-the-art approaches on several well-known dataset.


Sign in / Sign up

Export Citation Format

Share Document