[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] overlapping community detection
From: |
Tamás Nepusz |
Subject: |
Re: [igraph] overlapping community detection |
Date: |
Tue, 13 Mar 2012 22:57:31 +0100 |
Hi Sirinda,
This paper might be interesting for you:
http://www.sciencedirect.com/science/article/pii/S0378437109006797
--
T.
On Tuesday, 13 March 2012 at 22:53, Sirinda Palahan wrote:
> Hi all,
>
> I was wondering if there is any community detection algorithms that return
> overlapping communities where communities are just subgraphs and not cliques.
> Most of overlapping community detection papers I have read so far define a
> community as a clique. But my networks don't contain any cliques.
> I like the results I got from fast_greedy and would like to know if there is
> any extension of it that return overlapping clusters.
> Any paper suggestion would be appreciated or a suggestion how I should modify
> the fast_greedy so each vertex can belong to more than one cluster.
> thank you very much.
>
> Sirinda
> _______________________________________________
> igraph-help mailing list
> address@hidden (mailto:address@hidden)
> https://lists.nongnu.org/mailman/listinfo/igraph-help