Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach

DOI10.1137/20M1359201MaRDI QIDQ5860384zbMATH OpenOpenAlexFDO

Authors Gunnar Carlsson, Facundo Mémoli, Santiago Segarra

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

consistencyexcisivenesshierarchical clusteringnetworksrobustnessstability

Mathematics Subject Classification ID

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

Recommendations

• Clustering and community detection in directed networks: a survey
• A divide-and-link algorithm for hierarchical clustering in networks
• Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
• scientific article; zbMATH DE number 5811565
• scientific article; zbMATH DE number 6433485
• Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
• On the statistical detection of clusters in undirected networks
• Diclique clustering in a directed random graph

Cites work

• A course in metric geometry
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• A review of robust clustering methods
• A Sober Look at Clustering Stability
• An improved algorithm for hierarchical clustering using strong components
• Axioms for graph clustering quality functions
• Blind Identification of Graph Filters
• Characterization, stability and convergence of hierarchical clustering methods
• Classifying clustering schemes
• Community structure in social and biological networks
• Cure: An efficient clustering algorithm for large databases
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Hierarchical clustering of asymmetric networks
• scientific article; zbMATH DE number 3969923 (Why is no real title available?)
• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 2165487 (Why is no real title available?)
• Min and max hierarchical clustering using asymmetric similarity measures
• Persistent path homology of directed networks
• Robust hierarchical k-center clustering

Cited in

(2)

• Distances and isomorphism between networks: stability and convergence of network invariants
• Hypergraph co-optimal transport: metric and categorical properties

Describes a project that uses

Uses Software

• ROCK
• Algorithm 447

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5860384)