Abstract
Density-based spatial clustering algorithms can be used to filter out noise and outliers, and discover clusters of arbitrary shape, which are all relatively good algorithms. But when the problem of variable density distribution of spatial objects was taken in to consideration, the accuracy of clustering result can be largely affected by the distribution of spatial objects. Therefore, the strategy of choosing the neighborhood radius threshold between objects become the key of the algorithm. An algorithm with a neighborhood radius threshold choosing strategy that based on factors that influence the distribution of spatial objects is proposed in this paper. At the same time, it adopts quadtree indexing technology to improve the efficiency of this algorithm. Experiment shows that this algorithm can efficiently deal with the problem of clustering in spatial objects’ variable density distribution.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.