Motivic clustering schemes for directed graphs

01/01/2020

∙

Motivated by the concept of network motifs we construct certain clustering methods (functors) which are parametrized by a given collection of motifs (or representers).

READ FULL TEXT

Motivic clustering schemes for directed graphs

On a correlational clustering of integers

Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach

Convergence of Hierarchical Clustering and Persistent Homology Methods on Directed Networks

Classifying Clustering Schemes

Clustering Schemes on the Torus with Application to RNA Clashes

Hierarchical Clustering of Asymmetric Networks

Techniques for clustering interaction data as a collection of graphs

Motivic clustering schemes for directed graphs

Related Research

On a correlational clustering of integers

Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach

Convergence of Hierarchical Clustering and Persistent Homology Methods on Directed Networks

Classifying Clustering Schemes

Clustering Schemes on the Torus with Application to RNA Clashes

Hierarchical Clustering of Asymmetric Networks

Techniques for clustering interaction data as a collection of graphs