Finding Community Structure Based on Subgraph Similarity

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

ComplexNet2009, http://complenet09.diit.unict.it/index.html Will appear in "Studies in Computational Intelligence"

Scientific paper

10.1007/978-3-642-01206-8

Community identification is a long-standing challenge in the modern network science, especially for very large scale networks containing millions of nodes. In this paper, we propose a new metric to quantify the structural similarity between subgraphs, based on which an algorithm for community identification is designed. Extensive empirical results on several real networks from disparate fields has demonstrated that the present algorithm can provide the same level of reliability, measure by modularity, while takes much shorter time than the well-known fast algorithm proposed by Clauset, Newman and Moore (CNM). We further propose a hybrid algorithm that can simultaneously enhance modularity and save computational time compared with the CNM algorithm.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Finding Community Structure Based on Subgraph Similarity 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 Finding Community Structure Based on Subgraph Similarity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding Community Structure Based on Subgraph Similarity will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-55070

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.