4.6 Article

Evaluating local community methods in networks

Publisher

IOP Publishing Ltd
DOI: 10.1088/1742-5468/2008/05/P05001

Keywords

analysis of algorithms; heuristics; network dynamics; random graphs; networks

Ask authors/readers for more resources

We present a new benchmarking procedure that is unambiguous and specific to local community finding methods, allowing one to compare the accuracy of various methods. We apply this to new and existing algorithms. A simple class of synthetic benchmark networks is also developed, capable of testing properties specific to these local methods.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available