[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] calculating Evaluation Metric for community detection algor
From: |
Gábor Csárdi |
Subject: |
Re: [igraph] calculating Evaluation Metric for community detection algorithm |
Date: |
Wed, 5 Nov 2014 10:41:14 -0500 |
These are a lot of questions, and I guess that discourages people.
Yes, I am sure that for some of these measures can be defined on a
weighted and/or directed graph, some of them have been implemented
already it seems: e.g. http://www.cis.upenn.edu/~jshi/software/
So I guess, the answer is yes to both questions.
Gabor
On Wed, Nov 5, 2014 at 1:38 AM, Fatemeh a <address@hidden> wrote:
> Hi,
> I am not sure if my question well-suited here or not but what I am trying to
> do is to implement the evaluation metric such as
> (Conductance,Expansion,Internal density,Cut Ratio,Normalized Cut) using
> igraph in R,I implement them for an unweighted an undirected graph but what
> I am wondering about is to implement these metrics for weighted and directed
> graph , these are my questions:
>
> Dose these metric define for the weighted and directed graph in literature,
> my inquires wasn't so successful?
> As for weighted network, we could easily consider sum of weights instead of
> number of edges, right?
>
> Thanks you in advance,
> Fatemeh
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>