Clustering spatial data in the presence of obstacles: A density-based approach

Proceedings of the International Database Engineering and Applications Symposium, IDEAS

Volumn 2002-January, Issue , 2002, Pages 214-223

  Zaiane O R ^a   Lee, Chi Hoon ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Application software; Biomedical imaging; Clustering algorithms; Computer vision; Geographic Information Systems; Image analysis; Noise shaping; Satellites; Shape; Testing

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMS; BIOINFORMATICS; COMPUTER VISION; DATABASE SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS; IMAGE ANALYSIS; INFORMATION SYSTEMS; MEDICAL IMAGING; MEDICAL INFORMATION SYSTEMS; SATELLITE IMAGERY; SATELLITES; SOFTWARE TESTING; TESTING;

BIOMEDICAL IMAGING; CLUSTERING PROCESS; CLUSTERING SPATIAL DATA; DENSITY-BASED APPROACHES; DENSITY-BASED CLUSTERING ALGORITHMS; NOISE-SHAPING; PHYSICAL CONSTRAINTS; SHAPE;

CLUSTERING ALGORITHMS;

EID: 84948737005     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2002.1029674     Document Type: Conference Paper

References (32)

1. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98), pages 94-105, 1998.
2. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: ordering points to identify the clustering structure. In ACM-SIGMOD Int. Conf. Management of Data (SIGMOD' 99), pages 49-60, 1999.
3. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R∗ tree: An efficient and robust access method for points and rectangles. In Proc. of the 1990 ACM SIGMOD Intl. Conf., pages 332-331, 1990.
4. J. Bezdek and R. Hathaway. Numerical convergence and interpretation of the fuzzy c-shells clustering algorithm. IEEE Transactions on Neural Networks, 3(5):787-793, 1992.
5. P. S. Bradley, U. M. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. In Knowledge Discovery and Data Mining, pages 9-15, 1998.
6. V. Brailovsky. A probabilistic approach to clustering. Pattern Recognition Letters, 12(4):193-198, 1991.
7. N. Colossi and M. Nascimento. Benchmarking access structures for high-dimensional multimedia data. In Proc. IEEE Intl. Conf. on Multimedia and Expo (ICME'2000), pages 1215-1218, 2000.
8. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Knowledge Discovery and Data Mining, pages 226-231, 1996.
9. V. Estivill-Castro and I. Lee. Autoclust+: Automatic clustering of point-data sets in the presence of obstacles. In International Workshop on Temporal and Spatial and Spatio-Temporal Data Mining (TSDM2000), pages 133-146, 2000.
10. S. Guha, R. Rastogi, and K. Shim. CURE: an efficient clustering algorithm for large databases. In ACM-SIGMOD International Conference Management of Data, pages 73-84, 1998.
11. J. Han and M. KamberK. Data Mining: Concepts and Techniques. Morgan Kaufman, 2000.
12. P. S. Heckbert. Graphics Gems(4). Academic Press, 1994.
13. A. Hinneburg and D. A. Keim. An efficient approach to clustering in large multimedia databases with noise. In Knowledge Discovery and Data Mining, pages 58-65, 1998.
14. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Computing Surveys, 31(3):264-323, 1999.
15. G. Karypis, E. Han, and V. Kumar. Chameleon: A hierarchical clustering algorithm using dynamic modeling. In IEEE Computer, pages 68-75, 1999.
16. N. Katayama and S. Satoh. The SR-tree: an index structure for high-dimensional nearest neighbor queries. In Proc. of the 1997 ACM SIGMOD Intl. Conf., pages 369-380, 1997.
17. L. Kaufman. Finding groups in data: an introduction to cluster analysis. In Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York, 1990.
18. T. Kohonen. Self-organized formation of topologically correct feature maps. Biological Cybernetics, 43:59-69, 1982.
19. K. Koperski, J. Adhikary, and J. Han. Spatial data mining: Progress and challenges survey paper, 1996.
20. C.-H. Lee and O. R. Zaïane. Polygon reduction: An algorithm for minimum line representation for polygons. In Submitted to 14th Canadian Conf. on Computational Geometry, 2002.
21. R. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In Proc. of VLDB Conf., pages 144-155, 1994.
22. H. Ralambondrainy. A conceptual version of the k-means algorithm. Pattern Recognition Letters, 16(11):1147-1157, 1995.
23. E. H. Ruspini. A new approach to clustering. Information and Control, 15(1):22-32, 1969.
24. J. W. Shavlik and T. G. Dietterich. Readings in Machine Learning. Morgan Kaufmann, 1990.
25. G. Sheikholeslami, S. Chatterjee, and A. Zhang. Wavecluster: A multi-resolution clustering approach for very large spatial databases, 1998.
26. P. Sneath and R. Sokal. Numerical taxonomy, 1973.
27. M. Stone. A mnemonic for areas of polygons. AMER. MATH. MONTHLY, 93:479-480, 1986.
28. A. K. H. Tung, J. Hou, and J. Han. Spatial clustering in the presence of obstacles. In Proc. 2001 Int. Conf. On Data Engineering(ICDE'01), 2001.
29. A. K. H. Tung, R. T. Ng, L. V. S. Lakshmanan, and J. Han. Constraint-based clustering in large databases. In ICDT, pages 405-419, 2001.
30. W. Wang, J. Yang, and R. R. Muntz. STING: A statistical information grid approach to spatial data mining. In The VLDB Journal, pages 186-195, 1997.
31. C. Zahn. Graph-theoretical methods for detecting and describing gestalt clusters. In IEEE Transactions on Computers, pages 20:68-86, 1971.
32. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In ACM-SIGMOD International Conference Management of Data, pages 103-114, June 1996.