Detecting Communities in Networks by Merging Cliques

Details Detecting Communities in Networks by Merging Cliques Detecting Communities in Networks by Merging Cliques

2012-02-02

arxiv.org/abs/1202.0480v1

2009 IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS 2009), pp. 832--836

Physics

Physics and Society

5 pages, 7 figures

Scientific paper

10.1109/ICICISYS.2009.5358036

Many algorithms have been proposed for detecting disjoint communities (relatively densely connected subgraphs) in networks. One popular technique is to optimize modularity, a measure of the quality of a partition in terms of the number of intracommunity and intercommunity edges. Greedy approximate algorithms for maximizing modularity can be very fast and effective. We propose a new algorithm that starts by detecting disjoint cliques and then merges these to optimize modularity. We show that this performs better than other similar algorithms in terms of both modularity and execution speed.

Affiliated with

Also associated with

No associations

Rating

Detecting Communities in Networks by Merging Cliques 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 Detecting Communities in Networks by Merging Cliques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Detecting Communities in Networks by Merging Cliques will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-188252