On the approximation of Euclidean SL via geometric method

DOI10.1016/j.ins.2023.119516MaRDI QIDQ6052633

Tie-Feng Ma, Xiaogang Huang

Publication date: 22 September 2023

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

clusteringgeometric methodgrid-basedsingle-linkage

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel algorithms for hierarchical clustering
• An efficient \(K\)-means clustering algorithm for tall data
• A distance based clustering method for arbitrary shaped clusters in large datasets
• Printer graphics for clustering
• Fast hierarchical clustering and its validation
• On the Hardness and Approximation of Euclidean DBSCAN
• Persistence-Based Clustering in Riemannian Manifolds

This page was built for publication: On the approximation of Euclidean SL via geometric method