A structured family of clustering and tree construction methods
From MaRDI portal
Publication:1604343
DOI10.1006/aama.2001.0758zbMath1027.91069OpenAlexW2077155372MaRDI QIDQ1604343
Publication date: 4 July 2002
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aama.2001.0758
Related Items
An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering ⋮ Predicting the labels of an unknown graph via adaptive exploration ⋮ Constructing the R* consensus tree of two trees in subcubic time ⋮ Faster algorithms for computing the R* consensus tree ⋮ Learning Unknown Graphs ⋮ An algorithm for computing cutpoints in finite metric spaces
Cites Work
- Sparsest cuts and bottlenecks in graphs
- Weak hierarchies associated with similarity measures - An additive clustering technique
- A canonical decomposition theory for metrics on a finite set
- Retractions of finite distance functions onto tree metrics
- Time bounds for selection
- Inferring evolutionary trees with strong combinatorial evidence
- A polynomial time algorithm for constructing the refined Buneman tree
- A robust model for finding optimal evolutionary tree
- The complexity of finding generalized paths in tournaments
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item