Geometric algorithms for density-based data clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 284-296

  Chen, Danny Z ^a   Smid, Michiel ^b   Xu, Bin ^a  

^a University of Notre Dame   (United States)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CLUSTER ANALYSIS;

ARBITRARY INPUTS; D-DIMENSIONAL SPACES; DATA CLUSTERING; DATA DISTRIBUTION; EXACT ALGORITHMS; GEOMETRIC ALGORITHM; GEOMETRIC APPROXIMATIONS; PRACTICAL IMPORTANCE;

CLUSTERING ALGORITHMS;

EID: 84938071676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_28     Document Type: Conference Paper

References (11)

1. P.K. Agarwal, D. Eppstein, and J. Matousek, Dynamic half-space reporting, geometric optimization, and minimum spanning trees, Proc. 33rd Annual IEEE Symp. Found. Comput. Sci., 1992, pp. 80-89. 289
2. P. K. Agarwal and J. Erickson, Geometric range searching and its relatives. In: B. Chazelle, J. E. Goodman and R. Pollack (Eds.), Advances in Discrete and Computational Geometry, American Mathematical Society, Providence, RI, 1999, pp. 1-56. 288
3. S. Arya and D. M. Mount, Approximate range searching, Comput. Geom. Theory Appl., 17 (2000), pp. 135-152. 285, 289, 290, 291, 292, 293
4. S. Arya and D.M. Mount, ANN: A library for approximate nearest neighbor searching, 2nd CGC Workshop on Computational Geometry, 1997. lso, see http://www.cs.umd.edu/mount/290, 292, 293
5. S. Arya, D.M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu, An optimal algorithm for approximate nearest neighbor searching in fixed dimensions, J. ACM, 45 (1998), pp. 891-923. 290
6. M. Ester, H.-P. Kriegel, J. Sander, M. Wimmer, and X. Xu, Incremental clustering for mining in a data warehousing environment, Proc. 24th Int. Conf. on Very Large Databases, 1998, pp. 323-333. 285, 293
7. M. Ester, H. P. Kriegel, J. Sander, and X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, 1996, pp. 226-231. 284, 285, 293
8. A. K. Jain and R. C. Dubes, Algorithms for Clustering Data, Prentice Hall, 1988. 285
9. R. Klein, O. Nurmi, T. Ottmann, and D. Wood, A dynamic fixed windowing problem, Algorithmica, 4 (1989), pp. 535-550. 289
10. J. Sander, M. Ester, H.-P. Kriegel, and X. Xu, Density-based clustering in spatial databases: The algorithm GDBSCAN and its application, Data Mining and Knowledge Discovery, 2 (2) (1998), pp. 169-194. 285, 293
11. B. Zhou, D. W. Cheung, and B. Kao, A fast algorithm for density-based clustering in large database, Proc. 3rd Pacific-Asia Conf. on Methodologies for Knowledge Discovery and Data Mining, 1999, pp. 338-349. 285, 293