igraph-help
[Top][All Lists]

## Re: [igraph] graph partitioning in K groups

 From: Bernie Hogan Subject: Re: [igraph] graph partitioning in K groups Date: Mon, 19 Dec 2011 16:30:52 +0000

 Hi all, Following through on this, I'm wondering how to make use of the dendogram that is returned in order to find nodes that may overlap between several communities?  Take care,BERNiE Dr Bernie HoganResearch Fellow, Oxford Internet InstituteUniversity of Oxfordhttp://www.oii.ox.ac.uk/people/hogan/ On 19 Dec 2011, at 16:28, Claudio Martella wrote:Hi Gabor,thanks for answering. I'm not sure i understand exactly what you mean.I use python, but finding k-means for python would not be a problem,the problem would be using k-means itself for graph-partitioning? whatwould the feature vector be? the neighborhood?i'm actually looking for something more suited for graphs, as yousuggest to look at community detection. By topology I in reality meanconnectivity-based graph partitioning, something that puts vertices incluster according to the fact they are similarly connected (in thissense it's not SO different from the previous idea of k-means onneighborhoods) but in a "sophisticated" way.I'll look at the two algorithms that you suggest.thanks!On Mon, Dec 19, 2011 at 4:38 PM, Gábor Csárdi wrote:Hi,if you use R, you can use one of the built-in clustering functions,e.g. kmeans().But actually you can partition a graph into a given number of groupswith many of the community finding algorithms, because they return acomplete dendrogram. E.g. the fast greedy and the edge betweennessbased algorithms are like that. This might not be what you wantthough, depending on what exactly you mean by 'topologically'.GaborOn Mon, Dec 19, 2011 at 6:16 AM, Claudio Martella wrote:Hello,I need to partition a weighted undirected graph topologically in a setof K groups, something like k-means. all i can find iscommunity-detection without the possibility to specify K.Can anybody give me a reference for a way of doing this in igraph orin case to an algorithm that does so I can implement myself?thanks!--   Claudio Martella   address@hidden_______________________________________________igraph-help mailing listaddress@hiddenhttps://lists.nongnu.org/mailman/listinfo/igraph-help--Gabor Csardi      MTA KFKI RMKI_______________________________________________igraph-help mailing listaddress@hiddenhttps://lists.nongnu.org/mailman/listinfo/igraph-help--    Claudio Martella   address@hidden_______________________________________________igraph-help mailing listaddress@hiddenhttps://lists.nongnu.org/mailman/listinfo/igraph-help