Geometric algorithms for density-based data clustering

International Journal of Computational Geometry and Applications

Volumn 15, Issue 3, 2005, Pages 239-260

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

^a University of Notre Dame   (United States)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Approximation algorithms; BBD trees; Density based clustering; Geometric algorithms; Graph traversal; Nearest neighbor search; Range search

Indexed keywords

EID: 22144439431     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195905001683     Document Type: Article

References (26)

1. P. K. Agarwal, D. Eppstein and J. Matoušek, Dynamic half-space reporting, geometric optimization, and minimum spanning trees, Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci. (1992), pp. 80-89.
2. P. K. Agarwal and J. Erickson, Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry, eds. B. Chazelle, J. E. Goodman and R. Pollack (American Mathematical Society, Providence, RI, 1999), pp. 1-56.
3. P. K. Agarwal and C. M. Procopiuc, Exact and approximation algorithms for clustering, Proc. 9th ACM-SIAM Symp. Discrete Algorithms (1998), pp. 658-667.
4. S. Arya and D. M. Mount, Approximate range searching, Comput. Geom. Th. Appl. 17 (2000) 135-152.
5. S. Arya and D. M. Mount, ANN: A library for approximate nearest neighbor searching, 2nd CGC Workshop on Computational Geometry (1997). Also, see http://www.cs.umd.edu/~mount/.
6. 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) 891-923.
7. Y. Bartal, M. Charikar and D. Raz, Approximating min-sum k-clustering in metric spaces, Proc. 33rd Ann. ACM Symp. Theory of Computing (2001), pp. 11-22.
8. N. Beckmann, H. P. Kriegel, R. Schneider and B. Seeger, The R*tree: An efficient and robust access method for points and rectangles, Proc. ACM SIGMOD Int. Conf. Management of Data (1990), pp. 322-331.
9. J. L. Bentley, Multidimensional binary search trees used for associative searching, Commun. ACM 18(9) (1975) 509-517.
10. J. L. Bentley, K-d trees for semidynamic point sets, Proc. 6th Annual ACM Symp. Comput. Geom. (1990), pp. 187-197.
11. A. Borodin, R. Ostrovsky and Y. Rabani, Subquadratic approximation algorithms for clustering problems in high dimensional spaces, Proc. 31st Ann. ACM Symp. Theory of Computing (1999), pp. 435-444.
12. M. Charikar and S. Guha, Improved combinatorial algorithms for facility location and k-median problems, Proc. 40th IEEE Ann. IEEE Symp. Found. Comput. Sci. (1999), pp. 378-388.
13. M. Charikar, S. Guha, É. Tardos and D. Shmoys, A constant-factor approximation algorithm for the k-median problem, Proc. 31st Ann. ACM Symp. Theory of Computing (1999), pp. 1-10.
14. P. Drineas, A. Frieze, R. Kannan, S. Vempala and V. Vinay, Clustering in large graphs and matrices, Proc. 10th ACM-SIAM Symp. Discrete Algorithms (1999).
15. 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. Very Large Databases (1998), pp. 323-333.
16. 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. Knowledge Discovery and Data Mining (1996), pp. 226-231.
17. M. Ester, H.-P. Kriegel and X. Xu, A database interface for clustering in large spatial databases, Proc. 1st Int. Conf. Knowledge Discovery and Data Mining (1995), pp. 94-99.
18. M. Ester, H.-P. Kriegel and X. Xu, Knowledge discovery in large spatial databases: Focusing techniques for efficient class identification, Proc. 4th Int. Symp. Large Spatial Databases, Lecture Notes in Computer Science, Vol. 951 (Springer, 1995), pp. 67-82.
19. P. Indyk, A sublinear time approximation scheme for clustering in metric spaces, Proc. 40th Ann. IEEE Symp. Found. Comput. Sci. (1999), pp. 154-159.
20. A. K. Jain and R. C. Dubes, Algorithms for Clustering Data (Prentice Hall, 1988).
21. R. Kannan, S. Vempala and A. Vetta, On clusterings - good, bad and spectral, Proc. 41st IEEE Annual IEEE Symp. Found. Comput. Sci. (2000).
22. R. Klein, O. Nurmi, T. Ottmann and D. Wood, A dynamic fixed windowing problem, Algorithmic 4 (1989) 535-550.
23. N. Mishra, D. Oblinger and L. Pitt, Sublinear time approximate clustering, Proc. 12th ACM-SIAM Symp. Discrete Algorithms (2001).
24. R. Ostrovsky and Y. Rabani, Polynomial time approximation schemes for geometric k-clustering, Proc. 41st IEEE Ann. IEEE Symp. Found. Comput. Sci. (2000).
25. J. Sander, M. Ester, H.-P. Kriegel and X. Xu, Density-based clustering in spatial databases: The algorithm GDBSCAN and its application, Data Min. Knowl. Discov. 2(2) (1998) 169-194.
26. B. Zhou, D. W. Cheung and B. Kao, A fast algorithm for density-based clustering in large database, Proc. 3rd Pacific-Asia Conf. Methodologies for Knowledge Discovery and Data Mining (1999), pp. 338-349.