Overlapping Community Detection in Bipartite Networks

Details Overlapping Community Detection in Bipartite Networks Overlapping Community Detection in Bipartite Networks

2008-04-23

arxiv.org/abs/0804.3636v1

Physics

Physics and Society

16 pages, 9 figures

Scientific paper

Recent researches have discovered that rich interactions among entities in nature and society bring about complex networks with community structures. Although the investigation of the community structures has promoted the development of many successful algorithms, most of them only find separated communities, while for the vast majority of real-world networks, communities actually overlap to some extent. Moreover, the vertices of networks can often belong to different domains as well. Therefore, in this paper, we propose a novel algorithm BiTector Bi-community De-tector) to efficiently mine overlapping communities in large-scale sparse bipartite networks. It only depends on the network topology, and does not require any priori knowledge about the number or the original partition of the network. We apply the algorithm to real-world data from different domains, showing that BiTector can successfully identifies the overlapping community structures of the bipartite networks.

Affiliated with

Also associated with

No associations

Rating

Overlapping Community Detection in Bipartite Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Overlapping Community Detection in Bipartite Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Overlapping Community Detection in Bipartite Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-104541