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
