Hierarchical clustering with OWA-based linkages, the Lance-Williams formula, and dendrogram inversions
Not on the map. Why?
Abstract (arXiv)
Agglomerative hierarchical clustering based on Ordered Weighted Averaging (OWA) operators not only generalises the single, complete, and average linkages, but also includes intercluster distances based on a few nearest or farthest neighbours, trimmed and winsorised means of pairwise point similarities, amongst many others. We explore the relationships between the famous Lance-Williams update formula and the extended OWA-based linkages with weights generated via infinite coefficient sequences. Furthermore, we provide some conditions for the weight generators to guarantee the resulting dendrograms to be free from unaesthetic inversions.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 20 references that are in the map. First posted on arXiv 10 Mar 2023.
Builds on
3 of 20 references.
References · 3
- 2022A framework for benchmarking clustering algorithmscited by 15
- 2022Genie: A new, fast, and outlier-resistant hierarchical clustering algorithmcited by 10
- 2022Data Fusion: Theory, Methods, and Applicationscited by 2
Built on by
Not cited yet.