An overview of clustering methods in geographic data analysis

Geographic Data Mining and Knowledge Discovery, Second Edition

Volumn , Issue , 2009, Pages 149-188

  Han, Jiawei ^a   Lee, Jae Gil ^b   Kamber, Micheline ^c  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c NONE   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84938353292     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420073980     Document Type: Chapter

References (23)

1. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proc. 1998 ACMSIGMOD Intl. Conf. Management of Data (SIGMOD’98), Seattle, WA, June 1998, pp. 94-105.
2. C. Ambroise, and G. Govaert. Convergence of an EM-type algorithm for spatial clustering. Pattern Recognition Letters, 19: 919-927, 1998.
3. M. Ankerst, M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: Ordering points to identify the clustering structure. In Proc. 1999 ACM-SIGMOD Intl. Conf. Management of Data (SIGMOD’99), Philadelphia, PA, June 1999, pp. 49-60. (http://doi.acm.org/10.1145/304182.304187).
4. J. A. Bilmes. A gentle tutorial of the EM algorithm, and its applications to parameter estimation for Gaussian mixture, and hidden Markov models. In Technical Report, International Computer Science Institute, 1998.
5. S. Camargo, A. Robertson, S. Gaffney, P. Smyth, and M. Ghil. Cluster analysis of western north pacific tropical cyclone tracks. In Technical Report, International Research Institute for Climate, and Society, Columbia University, 2005.
6. A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. Royal Statistical Society, 39: 1-38, 1977.
7. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases. In Proc. 1996 Intl. Conf. Knowledge Discovery, and Data Mining (KDD’96), Portland, OR, August 1996, pp. 226-231.
8. V. Estivill-Castro, and I. Lee. Amoeba: Hierarchical clustering based on spatial proximity using delaunaty diagram. In Proc. 9th Intl. Symp. Spatial Data Handling (SDH’00), Beijing, China, August 2000, pp. 26-41.
9. S. Gaffney, A. Robertson, P. Smyth, S. Camargo, and M. Ghil. Probabilistic clustering of extratropical cyclones using regression mixture models. In Technical Report, Bren School of Information, and Computer Sciences, University of California, Irvine, 2006.
10. S. Gaffney, and P. Smyth. Trajectory clustering with mixtures of regression models. In Proc. 1999 Intl. Conf. Knowledge Discovery, and Data Mining (KDD’99), San Diego, CA, August 1999, pp. 63-72.
11. P. Grünwald, I. J. Myung, and M. Pitt. Advances in Minimum Description Length: Theory, and Applications. MIT Press, 2005.
12. A. Hinneburg, and D. A. Keim. An efficient approach to clustering in large multimedia databases with noise. In Proc. 1998 Intl. Conf. Knowledge Discovery, and Data Mining (KDD’98), New York, August 1998, pp. 58-65.
13. G. Karypis, E.-H. Han, and V. Kumar. CHAMELEON: A hierarchical clustering algorithm using dynamic modeling. Computer, 32: 68-75, 1999.
14. L. Kaufman, and P. J. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, 1990.
15. J.-G. Lee, J. Han, and K.-Y. Whang. Trajectory clustering: A partition-and-group framework. In Proc. 2007 ACM-SIGMOD Intl. Conf. Management of Data (SIGMOD’07), Beijing, China, June 2007, pp. 593-604. (http://doi.acm.org/10.1145/1247480.1247546).
16. S. P. Lloyd. Least Squares Quantization in PCM. IEEE Trans. Information Theory, 28: 128-137, 1982, (original version: Technical Report, Bell Labs, 1957).
17. M. Nanni, and D. Pedreschi. Time-focused clustering of trajectories of moving objects. Journal of Intelligent Information Systems, 27: 267-289, 2006.
18. R. Ng, and J. Han. Efficient, and effective clustering method for spatial data mining. In Proc. 1994 Intl. Conf. Very Large Data Bases (VLDB’94), Santiago, Chile, September 1994, pp. 144-155.
19. J. Sander, M. Ester, H.-P. Kriegel, and X. Xu. Density-based clustering in spatial databases: The algorithm GDBSCAN and its applications. Data Mining, and Knowledge Discovery, 2: 169-194, 1998.
20. G. Sheikholeslami, S. Chatterjee, and A. Zhang. WaveCluster: A multiresolution clustering approach for very large spatial databases. In Proc. 1998 Intl. Conf. Very Large Data Bases (VLDB’98), New York, August 1998, pp. 428-439.
21. L.-H. Wan, Y.-J. Li, W.-Y. Liu, and D.-Y. Zhang. Application, and study of spatial cluster, and customer partitioning. In Proc. 2005 Intl. Conf. Machine Learning, and Cybernetics, Guangzhou, China, August 2005, pp. 1701-1706.
22. W. Wang, J. Yang, and R. Muntz. STING: A statistical information grid approach to spatial data mining. In Proc. 1997 Intl. Conf. Very Large Data Bases (VLDB’97), Athens, Greece, August 1997, pp. 186-195.
23. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In Proc. 1996 ACM-SIGMOD Intl. Conf. Management of Data (SIGMOD’96), Montreal, Canada, June 1996, pp. 103-114.