An adaptive spatial clustering algorithm based on delaunay triangulation

Computers, Environment and Urban Systems

Volumn 35, Issue 4, 2011, Pages 320-332

  Deng, Min ^a   Liu, Qiliang ^a   Cheng, Tao ^b   Shi, Yan ^a  

^a CENTRAL SOUTH UNIVERSITY   (China)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

Adaptive; Delaunay triangulation; Spatial clustering; Spatial data mining

Indexed keywords

ADAPTIVE; COMPLICATED SHAPE; DATA SETS; DELAUNAY TRIANGULATION; NON-HOMOGENEOUS; PRIOR KNOWLEDGE; SPATIAL CLUSTER; SPATIAL CLUSTERING; SPATIAL DATA MINING; SPATIAL DATABASE; SPATIAL PROXIMITY; SPECIAL APPLICATIONS; STATISTICAL FEATURES;

ADAPTIVE ALGORITHMS; QUERY LANGUAGES; TRIANGULATION;

CLUSTERING ALGORITHMS;

ALGORITHM; CLUSTER ANALYSIS; DATA MINING; DATABASE; DETECTION METHOD; GIS; PARAMETERIZATION; SPATIAL DATA; TRIANGULATION;

EID: 79956040188     PISSN: 01989715     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compenvurbsys.2011.02.003     Document Type: Article

References (35)

1. Agrawal R., Gehrke J., Gunopulos D., Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. Proceedings of 1998 ACM-SIGMOD International Conference on Management of Data 1998, 94-105. ACM Press.
2. Ankerst, M., Breunig, M. M., Kriegel, H.-P., Sander, J. (1999). OPTICS: Ordering points to identify the clustering structure. In Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data (pp. 49-60). Philadelphia, USA.
3. Bailey T.C., Gatrell A.C. Interactive Spatial Analysis 1995, Wiley, New York.
4. Ester, M., Kriegel, H.-P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with Noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (pp. 226-231). Portland, OR.
5. Estivill-Castro V., Lee I. Multi-level clustering and its visualization for exploratory spatial analysis. GeoInformatica 2002, 6:123-152.
6. Estivill-Castro V., Lee I. Argument free clustering for large spatial point-data sets. Computers, Environment and Urban Systems 2002, 26:315-334.
7. Guha, S., Rastogi, R., Shim, K. (1998). CURE: An efficient clustering algorithm for large database. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (pp. 73-84). USA, New York.
8. Haining R. Spatial data analysis: Theory and practice 2003, Cambridge University Press, United Kingdom.
9. Hinneburg, A., Keim, D. A. (1998). An efficient approach to clustering in large multimedia databases with noise. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (pp. 58-65). USA, New York.
10. Jiang H.K., Fu Z.X., Liu J., Lv P.L. Research on earthquake sequences in Mainland of China 2007, Seismological Press, Beijing, in Chinese.
11. Karypis G., Han E.H., Kumar V. Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer 1999, 32:68-75.
12. Kaufman L., Rousseeuw P.J. Finding groups in data: An introduction to cluster analysis 2005, Wiley, New York. 2nd ed.
13. Li Z.L. Algorithm foundation of multi-scale spatial representation 2007, CRC Press, London.
14. Lin C.-R., Chen M.-S. Combining partitional and hierarchical algorithms for robust and efficient data clustering with cohesion self-merging. IEEE Transaction on Knowledge and Data Engineering 2005, 17:145-159.
15. Liu D., Nosovskiy G.V., Sourina O. Effective clustering and boundary detection algorithm based on Delaunay triangulation. Pattern Recognition Letters 2008, 29:1261-1273.
16. Lu Y., Thill J.-C. Cross-scale analysis of cluster correspondence using different operational neighborhoods. Journal of Geographical Systems 2008, 10:241-261.
17. MacQueen J. Some methods for classification and analysis of multivariate observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability 1967, 281-297. University of California Press, California.
18. McLachlan G.J., Krishnan T. The EM algorithm and extensions 1996, Wiley, New York. 1st ed.
19. Miller H., Han J. Geographic data mining and knowledge discovery 2009, CRC Press, New York. 2nd ed.
20. Ng, R. T., Han, J. (1994). Efficient and effective clustering methods for spatial data mining. In Proceedings of the 20th International Conference on Very Large Data Bases (pp. 144-155). Chile, Santiago.
21. Nosovskiy G.V., Liu D., Sourina O. Automatic clustering and boundary detection algorithm based on adaptive influence function. Pattern Recognition 2008, 41:2757-2776.
22. Pei T., Zhu A.X., Zhou C.H., Li B.L., Qin C.Z. Detecting feature from spatial point processes using collective nearest neighbor. Computers, Environment and Urban Systems 2009, 33:435-447.
23. Sander J., Ester M., Kriegel H.-P., Xu X. Density-based clustering in spatial database: The algorithm GDBSCAN and it applications. Data Mining and Knowledge Discovery 1998, 2:169-194.
24. Schoier, G., Borruso, G. (2004). A clustering method for spatial databases. In Proceedings of the ICCSA 2004 International Conference (pp. 1089-1095). Italia, Perugia.
25. Schoier, G., Borruso, G. (2007). A modification of the DBSCAN algorithm in a spatial data mining approach. In Meeting of the Classification and Data Analysis Group of the SIS (pp. 395-398). Italia, Macerata.
26. Sheikholeslami, G., Chatterjee, S., Zhang, A. (1998). Wave Cluster: A multi-resolution clustering approach for very large spatial databases. In Proceedings of 24th International Conference on Very Large Databases (pp. 428-439). USA, New York.
27. Tsai V.J.D. Delaunay Triangulations in TIN creation: An overview and a linear-time algorithm. International Journal of Geographical Information Systems 1993, 7:501-524.
28. Tsai C.-F., Yen C.-F. ANGEL: A new effective and efficient hybrid clustering technique for large databases. Lecture Notes in Computer Science 2007, 4426:817-824.
29. Wang, W., Yang, J., Muntz, R. (1997). STING: A statistical information grid approach to spatial data mining. In Proceedings of the 1997 International Conference on Very Large Databases (pp. 186-195). Greece, Athens.
30. Xu, X., Ester, M., Kriegel, H.-P., & Sander, J. (1998). A distribution-based clustering algorithm for mining in large spatial database. In Proceedings of the 14th International Conference on Data Engineering (pp. 324-331). USA, Washington, DC.
31. Xu R., Wunsh D. Clustering 2009, John Wiley & Sons, New Jersey.
32. Yamada I., Thill J.-C. Local indicators of network-constrained clusters in spatial point patterns. Geographical Analysis 2007, 39:268-292.
33. Zahn C.T. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transaction on Computer 1971, 20:68-86.
34. Zhang, T., Ramakrishnan, R., Livny, M. (1996). BIRCH: An efficient data clustering method for very large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 103-114), Canada, Montreal.
35. Zhong C., Miao D., Wang R. A graph-theoretical clustering method based on two rounds of minimum spanning trees. Pattern Recognition 2010, 43:752-766.