Optimized network clustering by jumping sub-optimal dendrograms

Details Optimized network clustering by jumping sub-optimal dendrograms Optimized network clustering by jumping sub-optimal dendrograms

2007-11-10

arxiv.org/abs/0711.1603v2

Physics

Physics and Society

Scientific paper

We propose a method to improve community division techniques in networks that are based on agglomeration by introducing dendrogram jumping. The method is based on iterations of sub-optimal dendrograms instead of optimization of each agglomeration step. We find the algorithm to exhibit excellent scaling behavior of its computational complexity. In its present form the algorithm scales as $\mathcal{O} (N^{2})$, but by using more efficient data structures it is possible to achieve a scaling of $\mathcal{O} (N \log^{2} N)$. We compare our results with other methods such as the greedy algorithm and the extremal optimization method. We find modularity values larger than the greedy algorithm and values comparable to the extremal optimization method.

Affiliated with

Also associated with

No associations

Rating

Optimized network clustering by jumping sub-optimal dendrograms 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 Optimized network clustering by jumping sub-optimal dendrograms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimized network clustering by jumping sub-optimal dendrograms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-27717