The data mining is the approach which extracts useful information from the rough information. The clustering is the approach of data mining which cluster the similar and dissimilar type of information. The clustering techniques is of various type which hierarchal clustering, density based clustering and so on. The IDBSCAN algorithm is the density based clustering algorithm. The density based clustering has the various algorithms. In this research work, the I-DBSCAN algorithm is improved using the PSO algorithm to increase accuracy of clustering. The proposed methodology is implemented in MATAB and results are analyzed in terms of accuracy.

Clustering, Hierarchal, I-DBSCAN, PSO (Particle Swarm Optimization)

[1] Anand M. Baswade, Kalpana D. Joshi and Prakash S. Nalwade, “A Comparative Study Of K-Means and Weighted K-Means for Clustering,” International Journal of Engineering Research & Technology, Volume 1, Issue 10, December-2012
[2] Neha Aggarwal, Kirti Aggarwal and Kanika Gupta, “Comparative Analysis of k-means and Enhanced K-means clustering algorithm for data mining,” International Journal of Scientific & Engineering Research, Volume 3, Issue 3, August-2012
[3] Ahamed Shafeeq B M and Hareesha K S, “Dynamic Clustering of Data with Modified Means Algorithm,” International Conference on Information and Computer Networks, Volume 27, 2012
[4] Manpreet Kaur and Usvir Kaur, “Comparison Between K-Mean and Hierarchical Algorithm Using Query Redirection”, International Journal of Advanced Research in Computer Science and Social , Volume 3, Issue 7, July 2013 ISSN: 2277 128X
[5] Tapas Kanungo , David M. Mount , Nathan S. Netanyahu Christine, D. Piatko , Ruth Silverman and Angela Y. Wu, “An Efficient K-Means Clustering Algorithm: Analysis and Implementation ,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume 24, July 2002
[6] Amar Singh and Navot Kaur, “To Improve the Convergence Rate of K-Means Clustering Over K-Means with Weighted Page Rank Algorithm,” International journal of Advanced Research in Computer Science and Software Engineering, Volume 3, Issue 8, August 2012
[7] Amar Singh and Navot Kaur, “To Improve the Convergence Rate of K-Means Clustering Over K-Means with Weighted Page Rank Algorithm,” International journal of Advanced Research in Computer Science and Software Engineering, Volume 3, Issue 8, August 2012.
[8] Harpreet Kaur and Jaspreet Kaur Sahiwal, “Image Compression with Improved K-Means Algorithm for Performance Enhancement,” International Journal of Computer Science and Management Research, Volume 2, Issue 6, June 2013
[9] Osamor VC, Adebiyi EF, Oyelade JO and Doumbia S “Reducing the Time Requirement of K-Means Algorithm” PLoS ONE, Volume 7, Issue 12, 2012
[10] Azhar Rauf, Sheeba, Saeed Mahfooz, Shah Khusro and Huma Javed, “Enhanced K-Mean Clustering Algorithm to Reduce Number of Iterations and Time Complexity,” Middle-East Journal of Scientific Research, pages 959-963, 2012
[11] Kajal C. Agrawal and Meghana Nagori, “Clusters of Ayurvedic Medicines Using Improved K-means Algorithm,” International Conf. on Advances in Computer Science and Electronics Engineering, 2013.
[12] M. N. Vrahatis, B. Boutsinas, P. Alevizos and G. Pavlides, “The New k-Windows Algorithm for Improving the k-Means Clustering Algorithm,” Journal of Complexity 18, pages 375-391, 2002.
[13] Chieh-Yuan Tsai and Chuang-Cheng Chiu, “Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm,” Computational Statistics and Data Analysis, pages 4658-4672, Volume 52, 2008
[14] Guangchun Luo, Xiaoyu Luo, Thomas Fairley Gooch, Ling Tian, Ke Qin,” A Parallel DBSCAN Algorithm Based On Spark”, 2016, IEEE, 978-1-5090-3936-4
[15] Dianwei Han, Ankit Agrawal, Wei−keng Liao, Alok Choudhary,” A novel scalable DBSCAN algorithm with Spark”, 2016, IEEE, 97879-897-99-4
[16] Nagaraju S,Manish Kashyap, Mahua Bhattacharya,” A Variant of DBSCAN Algorithm to Find Embedded and Nested Adjacent Clusters”, 2016, IEEE, 978-1-4673-9197-9
[17] Jianbing Shen, Xiaopeng Hao, Zhiyuan Liang, Yu Liu, Wenguan Wang, and Ling Shao,” Real-time Superpixel Segmentation by DBSCAN Clustering Algorithm”, 2016, IEEE, 1057-7149
[18] Ilias K. Savvas, and Dimitrios Tselios,” Parallelizing DBSCAN Algorithm Using MPI”, 2016, IEEE, 978-1-5090-1663-1
[19] Ahmad M. Bakr , Nagia M. Ghanem, Mohamed A. Ismail,” Efficient incremental density-based algorithm for clustering large datasets”, 2014, Elsevier Pvt. Ltd.
[20] Saefia Beri, Kamaljit Kaur,” Hybrid Framework for DBSCAN Algorithm Using Fuzzy Logic”, 2015, IEEE, 978-1-4799-8433-6
[21] Karlina Khiyarin Nisa, Hari Agung Andrianto, Rahmah Mardhiyyah,” Hotspot Clustering Using DBSCAN Algorithm and Shiny Web Framework”, 2014, IEEE, 978-1-4799-8075-8