Towards Linear Time Overlapping Community Detection in Social Networks

Details Towards Linear Time Overlapping Community Detection in Social Networks Towards Linear Time Overlapping Community Detection in Social Networks

2012-02-11

arxiv.org/abs/1202.2465v1

Computer Science

Social and Information Networks

PAKDD 2012

Scientific paper

Membership diversity is a characteristic aspect of social networks in which a person may belong to more than one social group. For this reason, discovering overlapping structures is necessary for realistic social analysis. In this paper, we present a fast algorithm1, called SLPA, for overlapping community detection in large-scale networks. SLPA spreads labels according to dynamic interaction rules. It can be applied to both unipartite and bipartite networks. It is also able to uncover overlapping nested hierarchy. The time complexity of SLPA scales linearly with the number of edges in the network. Experiments in both synthetic and real- world networks show that SLPA has an excellent performance in identifying both node and community level overlapping structures.

Affiliated with

Also associated with

No associations

Rating

Towards Linear Time Overlapping Community Detection in Social 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 Towards Linear Time Overlapping Community Detection in Social Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards Linear Time Overlapping Community Detection in Social Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-371306