期刊名称：International Journal on Computer Science and Engineering
印刷版ISSN：2229-5631
电子版ISSN：0975-3397
出版年度：2017
卷号：9
期号：05
页码：192-199
出版社：Engg Journals Publications
摘要：Density based clustering basically operates by associating related items contained in the sample space. The association is performed by maintaining maximum inter class similarity and minimum intra class similarity. However, the major downside of such approach is that it is time consuming in case of huge datasets. This paper proposes a metaheuristic based density clustering technique that utilizes a modified Particle Swarm Optimization (PSO) for fast and efficient neighbor selection. In this work, the PSO is integrated with simulated annealing to perform faster node selection and the distribution of catfish particles in the search space helps to avoid local optima to the maximum extent. Experiments were conducted with real-time spatial datasets and it was identified that the proposed clustering technique performs effectively in terms of both time and efficiency.
