Detecting community structure in bipartite networks based on matrix factorisation

Authors:
Bo-Lun Chen;Ling Chen;Sheng-Rong Zou;Xiu-Lian Xu
Affiliations:
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
Venue:
International Journal of Wireless and Mobile Computing
Year:
2013

Citing 12
Cited 0

Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs

Computational & Mathematical Organization Theory
Overlapping Community Detection in Bipartite Networks

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
How Does Label Propagation Algorithm Work in Bipartite Networks?

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Community Detection in Large-Scale Bipartite Networks

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Extracting Multi-facet Community Structure from Bipartite Networks

CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 04
Detecting Communities from Bipartite Networks Based on Bipartite Modularities

CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 04
Bipartite networks of Wikipedia's articles and authors: a meso-level approach

Proceedings of the 5th International Symposium on Wikis and Open Collaboration
Extracting the mesoscopic structure from heterogeneous systems

Proceedings of the 22nd ACM conference on Hypertext and hypermedia
Optimal coverage configuration with social emotional optimisation algorithm in wireless sensor networks

International Journal of Wireless and Mobile Computing
Clustering in p2p exchanges and consequences on performances

IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Privacy analysis in mobile social networks: the influential factors for disclosure of personal data

International Journal of Wireless and Mobile Computing
On routing protocols using mobile social networks

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

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.