Clustering spatial data when facing physical constraints

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2002, Pages 737-740

  Zaïane, Osmar R ^a   Lee, Chi Hoon ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77958058763     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. 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.
2. 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.
3. 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.
4. C.-H. Lee. Density-based clustering of spatial data in the presence of physical constraints. Master's thesis, University of Alberta, Edmonton, AB, Canada, July 2002.
5. R. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In Proc. of VLDB Conf., pages 144-155, 1994.
6. 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.
7. O. R. Zaïane, A. Foss, C.-H. Lee, and W. Wang. On data clustering analysis: Scalability, constraints and validation. In Sixth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'02), Lecture Notes in Al (LNAl2336), pages 28-39, Taipei, Taiwan, May 2002.