Re: [igraph] igraph-help Digest, Vol 129, Issue 17

[Perrone, Alexander G.]

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 <address@hidden> on behalf of address@hidden <address@hidden>
Sent: Sunday, May 28, 2017 12:00 PM
To: address@hidden
Subject: igraph-help Digest, Vol 129, Issue 17

Send igraph-help mailing list submissions to
        address@hidden

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
        address@hidden

You can reach the person managing the list at
        address@hidden

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 <address@hidden>
To: Help for igraph users <address@hidden>
Subject: Re: [igraph] Graph Clustering
Message-ID:
        <address@hidden>
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 <address@hidden>
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
> address@hidden
> 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
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help


------------------------------

End of igraph-help Digest, Vol 129, Issue 17
********************************************