Article: Detecting community structure in bipartite networks based on matrix factorisation Journal: International Journal of Wireless and Mobile Computing (IJWMC) 2013 Vol.6 No.6 pp.599 - 607 Abstract: Community detection in bipartite network is very important in the research on the theory and applications of complex network analysis. In this paper, an algorithm for detecting community structure in bipartite networks based on matrix factorisation is presented. The algorithm first partitions the network into two parts, each of which can reserve the community information as much as possible, and then the two parts are further recursively partitioned until the modularity cannot be further improved. While partitioning the network, we use the approach of matrix decomposition so that the row space of the associated matrix of the networks can be approximated as close as possible and the community information can be reserved as much as possible. Experimental results show that our algorithm can not only accurately identify the number of communities of a network, but also obtain higher quality of community partitioning without previously known parameters. Inderscience Publishers - linking academia, business and industry through research

Title: Detecting community structure in bipartite networks based on matrix factorisation

Authors: Bo-Lun Chen; Ling Chen; Sheng-Rong Zou; Xiu-Lian Xu

Addresses: Department of Computer Science, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China ' Department of Computer Science, Yangzhou University, Yangzhou 225009, China; State Key Lab of Novel Software Technology, Nanjing University, Nanjing 210093,China ' College of Physics Science and Technology, Yangzhou University, Yangzhou 225009, China ' College of Physics Science and Technology, Yangzhou University, Yangzhou 225009, China

Abstract: Community detection in bipartite network is very important in the research on the theory and applications of complex network analysis. In this paper, an algorithm for detecting community structure in bipartite networks based on matrix factorisation is presented. The algorithm first partitions the network into two parts, each of which can reserve the community information as much as possible, and then the two parts are further recursively partitioned until the modularity cannot be further improved. While partitioning the network, we use the approach of matrix decomposition so that the row space of the associated matrix of the networks can be approximated as close as possible and the community information can be reserved as much as possible. Experimental results show that our algorithm can not only accurately identify the number of communities of a network, but also obtain higher quality of community partitioning without previously known parameters.

Keywords: bipartite networks; matrix factorisation; community structures; community detection; complex network analysis; matrix decomposition; community partitioning.

DOI: 10.1504/IJWMC.2013.057576

International Journal of Wireless and Mobile Computing, 2013 Vol.6 No.6, pp.599 - 607

Received: 27 May 2013
Accepted: 01 Jul 2013
Published online: 16 Oct 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Detecting community structure in bipartite networks based on matrix factorisation

Keep up-to-date