Abstract
Problem statement: As a large amount of data stored in spatial databases, people may like to find groups of data which share similar features. Thus cluster analysis becomes an important area of research in data mining. Applications of clustering analysis have been utilized in many fields, such as when we search to construct a cluster served by base station in mobile network. Deciding upon the optimum placement for the base stations to achieve best services while reducing the cost is a complex task requiring vast computational resource. Approach: This study addresses antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for mobile networks by modified the original density-based Spatial Clustering of Applications with Noise algorithm. The Cluster Partitioning around Medoids original algorithm has been modified and a new algorithm has been proposed by the authors in a recent work. In this study, the density-based Spatial Clustering of Applications with Noise original algorithm has been modified and combined with old algorithm to produce the hybrid algorithm Clustering Density Base and Clustering with Weighted Node-Partitioning around Medoids algorithm to solve the problems in Mobile Network Planning. Results: Implementation of this algorithm to a real case study is presented. Results demonstrate that the proposed algorithm has minimum run time minimum cost and high grade of service. Conclusion: The proposed hyper algorithm has the advantage of quick divide the area into clusters where the density base algorithm has a limit iteration and the advantage of accuracy (no sampling method is used) and highly grade of service due to the moving of the location of the base stations (medoid) toward the heavy loaded (weighted) nodes.
Highlights
Clustering is one of the most important research areas in the field of data mining (Velmurugan and Santhanam, 2011; Suguna and Thanushkodi, 2011); it specializes in techniques for grouping similar objects into a cluster in which objects inside a cluster exhibit certain degree of similarities
Cell planning is challenging due to inherent complexity, which stems from requirements concerning radio modeling and Corresponding Author: Lamiaa Fattouh Ibrahim, Department of Computer Sciences and Information, Institute of Statistical Studies and Research, Cairo University Ahmed El Zomor, Zone 10, Nasr City, Cairo, Egypt 1004
This study introduces the density base clustering in
Summary
Clustering is one of the most important research areas in the field of data mining (Velmurugan and Santhanam, 2011; Suguna and Thanushkodi, 2011); it specializes in techniques for grouping similar objects into a cluster in which objects inside a cluster exhibit certain degree of similarities. It separates dissimilar objects into different clusters. In turn, is controlled by a switching office, called a Mobile Switching Center (MSC).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
