Author:
Lamia Fattouh Ibrahim
Affiliation:
Institute of Statistical Studies and Research, Cairo University, Faculty of Computing and Information Technology and King AbdulAziz University, Egypt
Keyword(s):
DBSCAN clustering algorithm, Network planning, Spatial clustering algorithm.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Clustering and Classification Methods
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Symbolic Systems
Abstract:
Clustering in spatial data mining is to group similar objects based on their distance, connectivity, or their relative density in space. In real word, there exist many physical obstacles such as rivers, lakes, highways and mountains, and their presence may affect the result of clustering substantially. Today existing telephone networks nearing saturation and demand for wire and wireless services continuing to grow, telecommunication engineers are looking at technologies that will deliver sites and can satisfy the required demand and grade of service constraints while achieving minimum possible costs. In this paper, we study the problem of clustering in the presence of obstacles to solve network planning problem. In this paper, COD-DBSCAN algorithm (Clustering with Obstructed Distance - Density-Based Spatial Clustering of Applications with Noise) is developed in the spirit of DBSCAN clustering algorithms. We studied also the problem determine the place of Multi Service Access Node (MS
AN) due to the presence of obstacles in area complained of the existence of many mountains such as in Saudi Arabia. This algorithm is Density-based clustering algorithm using BSP-tree and Visibility Graph to calculate obstructed distance. Experimental results and analysis indicate that the COD-DBSCAN algorithm is both efficient and effective.
(More)