Hi Gabor, >>But note that shortest.paths() (and similarly >>edge betweenness calculation) really calculates shortest weighted >>paths, so you might need transform your weights for these functions.
OK, so that if I use similarity of nodes as edge weights, I need to transform the weights (i.e., inverse) for detecting community. is that right? Thanks & Regards chen On Sat, Sep 29, 2012 at 8:23 PM, Gábor Csárdi <[email protected]> wrote: > Hi Chen, > > On Sat, Sep 29, 2012 at 4:23 AM, 凌琛 <[email protected]> wrote: > > Hi Gabor, > > > > Thanks for your reply. > > I know that the edge weights are used to calculate the shortest paths for > > edge betweenness. > > While I don't know that what the edge weights represent in the library. > > there is no semantics forced by igraph. Just like your vertices can > represent anything, your edge weights can represent anything you want, > similarity or capacity or distance, etc. > > > Specifically, is it the higher the weight, the longer the edge, or > inverse? > > Namely, the edge weight denotes the distance between the connected nodes > or > > the similarity between the connected nodes. > > Whichever you prefer. But note that shortest.paths() (and similarly > edge betweenness calculation) really calculates shortest weighted > paths, so you might need transform your weights for these functions. > > Gabor > > > Regards, > > chen > > > > On Wed, Sep 26, 2012 at 9:07 PM, Gábor Csárdi <[email protected]> > wrote: > >> > >> Hi, > >> > >> weighted edge-betweenness community detection simply means that > >> weighted paths are considered for calculating the shortest paths in > >> the edge betweenness calculation. > >> > >> Best, > >> Gabor > >> > >> On Wed, Sep 26, 2012 at 6:54 AM, 凌琛 <[email protected]> wrote: > >> > Hi, > >> > > >> > Have you used the Weighted Girvan-Newman community detected algorithm > in > >> > the > >> > library to detect community? > >> > I am not sure what the edge weight represent in this algorithm in > >> > Igraph, > >> > similarity or distance? > >> > > >> > Thanks, > >> > chen > >> > > >> > On Wed, Sep 26, 2012 at 6:48 PM, Minh Nguyen <[email protected]> > >> > wrote: > >> >> > >> >> Hi, > >> >> > >> >> On Wed, Sep 26, 2012 at 8:21 PM, Roey Angel < > [email protected]> > >> >> wrote: > >> >> > 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. > >> >> > >> >> There is a general class of statistical tests called the significance > >> >> of community. The relevant ideas and techniques can be found in the > >> >> following papers. > >> >> > >> >> http://dx.doi.org/10.1371/journal.pone.0033721 > >> >> http://dx.doi.org/10.1103/PhysRevE.82.066106 > >> >> http://dx.doi.org/10.1103/PhysRevE.81.046110 > >> >> > >> >> -- > >> >> Regards, > >> >> Minh Van Nguyen > >> >> http://bit.ly/mvngu > >> >> > >> >> _______________________________________________ > >> >> igraph-help mailing list > >> >> [email protected] > >> >> https://lists.nongnu.org/mailman/listinfo/igraph-help > >> > > >> > > >> > > >> > _______________________________________________ > >> > igraph-help mailing list > >> > [email protected] > >> > https://lists.nongnu.org/mailman/listinfo/igraph-help > >> > > >> > >> > >> > >> -- > >> Gabor Csardi <[email protected]> MTA KFKI RMKI > >> > >> _______________________________________________ > >> igraph-help mailing list > >> [email protected] > >> https://lists.nongnu.org/mailman/listinfo/igraph-help > > > > > > > > _______________________________________________ > > igraph-help mailing list > > [email protected] > > https://lists.nongnu.org/mailman/listinfo/igraph-help > > > > > > -- > Gabor Csardi <[email protected]> MTA KFKI RMKI > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
