[Top][All Lists]

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

Re: [igraph] graph partitioning in K groups

From: Gábor Csárdi
Subject: Re: [igraph] graph partitioning in K groups
Date: Mon, 19 Dec 2011 10:38:04 -0500


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 groups
with many of the community finding algorithms, because they return a
complete dendrogram. E.g. the fast greedy and the edge betweenness
based algorithms are like that. This might not be what you want
though, depending on what exactly you mean by 'topologically'.


On Mon, Dec 19, 2011 at 6:16 AM, Claudio Martella
<address@hidden> wrote:
> Hello,
> I need to partition a weighted undirected graph topologically in a set
> of K groups, something like k-means. all i can find is
> community-detection without the possibility to specify K.
> Can anybody give me a reference for a way of doing this in igraph or
> in case to an algorithm that does so I can implement myself?
> thanks!
> --
>    Claudio Martella
>   address@hidden
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

Gabor Csardi <address@hidden>     MTA KFKI RMKI

reply via email to

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