GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING

DOI10.1142/S0218195905001683zbMath1104.68097OpenAlexW2100928221MaRDI QIDQ5696538

Bin Xu, Danny Z. Chen, Michiel H. M. Smid

Publication date: 18 October 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195905001683

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (4)

On Clustering Induced Voronoi Diagrams ⋮ Region-restricted clustering for geographic data mining ⋮ Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces ⋮ Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces

Cites Work

• Unnamed Item
• Approximate range searching
• A dynamic fixed windowing problem
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Multidimensional binary search trees used for associative searching

This page was built for publication: GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING