3DCCOM Polygon Reduction Algorithm in Presence of Obstacles, Facilators and Constrains

Abstract

Clustering of spatial data in the presence of obstacles, facilitator and constraints has the very strong practical value, and becomes to an important research issue. Most of the existing spatial clustering algorithm in presence of obstacles and constraints can’t cluster with irregular obstacles. In this paper a 3DCCOM Polygon Reduction Algorithm is proposed. The advantage of this clustering algorithm is to reduce polygon edges, memory would be very less than the matrix approach contains reduction line .We are here going to use Set of reduction lines than matrix approach. Further with help of Polygon Reduction Algorithm, A novel 3DCCOM (3 Dimensional Clustering with Constraints and Obstacle Modeling) algorithm is proposed. 3DCCOM takes into account the problem of clustering in the presence of physical obstacles while modeling the obstacles by Reentrant Polygon Reduction Algorithm. The 3DCCOM algorithm processes arbitrary shape obstacle and finds arbitrary shape clusters efficiently. Meanwhile, the 3DCCOM algorithm used to reduce the complexity of clustering in presence of obstacles, facilators and constraints and the operation efficiency of algorithm is improved. The results of experiment show that 3DCCOM algorithm can process spatial clustering in presence of obstacles, facilitator and constraints and has higher clustering quality and better performance.

Reference

• Han Jiawei, Kamber M, 2001 “Data Mining: Concepts and Techniques,” Academic Press.
• Tung A K H, Hou Jean, Han Jiawei, 2001, “Spatial Clustering in the Presence of Obstacles,” Int. Conf. on Data Engineering, pp. 359-367.
• V. Estivill Castro, I. J. Lee, 2000 “AutoClust+: Automatic Clustering of Point-Data Sets in the Presence of Obstacles,” Int. Workshop on Temporal, Spatial and Spatio-Temporal Data Mining, pp. 133-146.
• V. Estivill Castro, I. J. Lee, 2000, “AutoClust: Automatic Clustering via Boundary Extraction for Massive Point- Data Sets,” Int. Conf. on Geo-computation’00, pp. 23-25
• O. R. Zaiane, C. H. Lee, 2002, “Clustering Spatial Data when Facing Physical Constraints,” The IEEE International Conf. on Data Mining, pp. 737-740
• X. Wang, H. J. Hamilton, 2004, “Density-Based Spatial Clustering in the Presence of Obstacles and Facilitators,” Int. the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases, pp. 446-458
• X. Wang, H. J. Hamilton, 2003, “DBRS: A Density- Based Spatial Clustering Method with RandomSampling,” The 7th International Conference on PAKDD, pp. 563-575
• Chen Shupeng, Lu Xuejun, Zhou Chenhu, 1999, “Geographic information introduction,” Beijing: Machinery Industry Press.
• Zhou Lihua,Wang Lizhen, Chen Keping, 2004, “Spatial Hierarchical Clustering in the presence of obstacle,” Computer Science, Vol.33, No.5,2006, pp. 182-185.
• Sun Yuqing, Zhao Rui, Yao Qing, 2006, “A mesh-based clustering algorithm in the presence of obstacles,” Journal of Shan Dong University (engineering science), Vol.36, No.3, pp.86-90
• Melli G, Dataset generator (DatGen), http://www.datasetgenerator.com
• C.-H. Lee and O. R. Za¨ıane. 2002,” Polygon reduction: algorithm for minimum line representation for polygons. In Submitted to 14th Canadian Conf. on Computational Geometry.
• Ester M., Kriegel H.-P., Sander J., Xu X., 1996: “A Density Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise”, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, OR, AAAI Press, pp. 226-231.
• Xin Wang, Camilo Rostoker & Howard J. Hamilton, 2004-9, Technical Report “Density-Based Spatial Clustering in thePresence of Obstacles and Facilitators”, CS-2004-9.
• Yue Yang, Jian-pei Zhang, Jing Yang, 2008, Grid-based Hierarchical Spatial Clustering Algorithm in Presence of Obstacle and Constraints” at International Conference on Internet Computing in Science and Engineering.

Index Terms

Key words