A Fast Parallel Clustering Algorithm for Large Spatial Databases
Xiaowei Xu, Jochen Jäger, Hans‐Peter Kriegel · Data Mining and Knowledge Discovery · 1999
Cited by 255 works. doi:10.1023/a:1009884809343
Authors
References
- A density-based algorithm for discovering clusters in large spatial Databases with Noise
- The R*-tree: an efficient and robust access method for points and rectangles
- Data mining and knowledge discovery: making sense out of data
- An effective hash-based algorithm for mining association rules
- Remote Sensing Digital Image Analysis: An Introduction
- PVM-Parallel Virtual Machine: AUsers' Guide and Tutorial for Networked Parallel Computing
- Remote Sensing Digital Image Analysis
- The X-tree: An Index Structure for High-Dimensional Data Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.
- A database interface for clustering in large spatial databases
- An introduction to spatial database systems