A practical algorithm for spatial agglomerative clustering

DOI10.1137/1.9781611975499.14MaRDI QIDQ5232765zbMATH OpenOpenAlexFDO

Authors Thom Castermans, Bettina Speckman, Kevin Verbeek

Publication date 13 September 2019

Published in 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975499.14

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Agglomerative clustering of growing squares
• Agglomerative clustering of growing squares
• Geometric algorithms for agglomerative hierarchical clustering
• A sweep-line algorithm for spatial clustering
• Efficient algorithms for agglomerative hierarchical clustering methods

Cited in

(6)

• A sweep-line algorithm for spatial clustering
• Two-level methods for spatial problems, based on aggregation
• scientific article; zbMATH DE number 1285875 (Why is no real title available?)
• scientific article; zbMATH DE number 1897897 (Why is no real title available?)
• Agglomerative clustering of growing squares
• Agglomerative clustering of growing squares

This page was built for publication: A practical algorithm for spatial agglomerative clustering

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