An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering

DOI10.1016/j.dam.2023.08.003MaRDI QIDQ6184310

Patrice Bertrand, Jean Diatta

Publication date: 24 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

interval convexityweak hierarchyApresjan hierarchypath-based dissimilaritiessingle-link hierarchy

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Crown-free lattices and their related graphs
• On ultrametricity, data coding, and computation
• Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis
• Weak hierarchies associated with similarity measures - An additive clustering technique
• Quasi-ultrametrics and their \(2\)-ball hypergraphs
• A structured family of clustering and tree construction methods
• Multilevel clustering models and interval convexities
• Finite ultrametric balls
• Finding ultrametricity in data using topology
• Subdominant Ultrametrics
• Axiomatic characterization of transit functions of weak hierarchies
• On Lower-Maximal Paired-Ultrametrics
• Some Elementary Properties of Interval Convexities

This page was built for publication: An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering