Motivic clustering schemes for directed graphs.
Facundo MémoliGuilherme Vituri F. PintoPublished in: CoRR (2020)
Keyphrases
- directed graph
- random walk
- clustering algorithm
- clustering method
- undirected graph
- k means
- cluster analysis
- hierarchical clustering
- maximum flow
- outlier detection
- directed acyclic graph
- graph structure
- spectral clustering
- graph theoretic
- graph clustering
- social networks
- strongly connected
- information theoretic
- distance metric
- high dimensional data
- anomaly detection
- data points
- objective function