[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[igraph] Choosing between different methods of detecting communities

From: Roey Angel
Subject: [igraph] Choosing between different methods of detecting communities
Date: Wed, 26 Sep 2012 12:21:29 +0200
User-agent: Mozilla/5.0 (X11; Linux x86_64; rv:15.0) Gecko/20120827 Thunderbird/15.0

I've constructed an undirected network of some 1500 nodes, and then applied to it different methods of community detection (Walktrap, Fastgreedy, label propagation and leading eigenvector). Not surprisingly the different methods give somewhat different results (different numbers of communities, different membership patterns etc.). I was wondering if there's a way to choose between the methods, either by experience (e.g. 'method x typically gives best results) or with some statistical test. I've looked into compare function but couldn't really make sense of it's output. Also, are there any recommendations on how to set the function variables. e.g. steps.

Thanks in advance,

Attachment: angel.vcf
Description: Vcard

reply via email to

[Prev in Thread] Current Thread [Next in Thread]