Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach

DOI10.1137/20M1359201OpenAlexW3207853712MaRDI QIDQ5860384

Facundo Mémoli, Santiago Segarra, Gunnar Carlsson

Publication date: 19 November 2021

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.07247

zbMATH Keywords

stabilityrobustnessconsistencyhierarchical clusteringnetworksexcisiveness

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20) Graph theory (including graph drawing) in computer science (68R10) Metric embeddings as related to computational problems and algorithms (68R12)

Related Items (1)

Distances and isomorphism between networks: stability and convergence of network invariants

Uses Software

• Algorithm 447
• ROCK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• An improved algorithm for hierarchical clustering using strong components
• Cure: An efficient clustering algorithm for large databases
• Classifying clustering schemes
• Hierarchical clustering of asymmetric networks
• A review of robust clustering methods
• Min and max hierarchical clustering using asymmetric similarity measures
• Robust Hierarchical k-Center Clustering
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• Community structure in social and biological networks
• Persistent Path Homology of Directed Networks
• Blind Identification of Graph Filters
• A Sober Look at Clustering Stability

This page was built for publication: Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach