Lookman SANNI, Subgraphs like k-core or k-truss essentially classify the edges. You might want to look at k-truss which is not in igraph. It's on my github. Basically, it clusters edges according to how many triangles each edge is in. Depending on what you're looking for out of clustering of edges, it's an option.
Alex Perrone ________________________________________ From: igraph-help <[email protected]> on behalf of [email protected] <[email protected]> Sent: Sunday, May 28, 2017 12:00 PM To: [email protected] Subject: igraph-help Digest, Vol 129, Issue 17 Send igraph-help mailing list submissions to [email protected] To subscribe or unsubscribe via the World Wide Web, visit https://lists.nongnu.org/mailman/listinfo/igraph-help or, via email, send a message with subject or body 'help' to [email protected] You can reach the person managing the list at [email protected] When replying, please edit your Subject line so it is more specific than "Re: Contents of igraph-help digest..." Today's Topics: 1. Re: Graph Clustering (Tamas Nepusz) ---------------------------------------------------------------------- Message: 1 Date: Sat, 27 May 2017 21:16:43 +0200 From: Tamas Nepusz <[email protected]> To: Help for igraph users <[email protected]> Subject: Re: [igraph] Graph Clustering Message-ID: <CABsfaESuCC=PTPcc=mnr8ph+vnj0fhp1pf7oxq+rdw43qgs...@mail.gmail.com> Content-Type: text/plain; charset="utf-8" Hi, A common trick is to construct the line graph of the original graph, do the clustering on the line graph (where each node corresponds to a single edge from the original graph), and then map the obtained clustering back to the edges of the original graph. T. On Fri, May 26, 2017 at 10:53 PM, lookman sanni <[email protected]> wrote: > Hi all, > > I am currently investigating graph clustering techniques/algorithms for > the purpose of anomaly detection in static, edge attributed and > disconnected graphs. > > From what I have seen so far, most of the graph clustering algorithms for > anomaly detection output either a binary *node *classification or a *node > *anomaly score. > > To the best of your knowledge, is there any algorithm rather providing > either a binary *edge* classification or an *edge* anomaly score ? > > Thank you. > > > -- > > Lookman SANNI > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > > -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.nongnu.org/archive/html/igraph-help/attachments/20170527/826587d3/attachment.html> ------------------------------ Subject: Digest Footer _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help ------------------------------ End of igraph-help Digest, Vol 129, Issue 17 ******************************************** _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
