Novel Technique for Density Based Clustering Using Neural Networks

Authors

  • Asha Devi  Research Scholar, Department of Computer Science and Engineering, Sri Sai University, Palampur, India
  • Saurabh Sharma  Assistant Professor,Department of Computer Science and Engineering, Sri Sai University, Palampur, India

Keywords:

Clustering, DBSCAN, Back-Propagation, Accuracy, Execution Time

Abstract

In order to separate similar and dissimilar type of data into different clusters, the clustering mechanism is used. This helps in analyzing the data that is given as input in more efficient manner. The EPS is computed in case when DBSCAN algorithm is applied on the data that is to be processed. The Euclidean distance is computed from the central point which is mainly the EPS point calculated. This helps in further defining the similar and dissimilar type of data present. The accuracy of clustering is minimized in cases where there is a dynamic calculation of EPS and static computation of Euclidean distance. The back propagation algorithm is used in this paper that computes the Euclidean distance in a dynamic manner. The DBSCAN algorithm has less complexity as compared to the other algorithms. It can also identify any type of shaped cluster which is difficult with in other algorithms. The identification of specific types of clusters is difficult in cases where objects are circulated in heterogeneous manner. As per the various experiments conducted here, it is seen that the accuracy of the algorithm is enhanced and the execution time is minimized.

References

  1. Guangchun Luo, Xiaoyu Luo, Thomas Fairley Gooch, Ling Tian, Ke Qin," A Parallel DBSCAN Algorithm Based On Spark", 2016, IEEE.
  2. Dianwei Han, Ankit Agrawal, Wei?keng Liao, Alok Choudhary," A novel scalable DBSCAN algorithm with Spark", 2016, IEEE.
  3. Nagaraju S,Manish Kashyap, Mahua Bhattacharya," A Variant of DBSCAN Algorithm to Find Embedded and Nested Adjacent Clusters", 2016, IEEE.
  4. Jianbing Shen, Xiaopeng Hao, Zhiyuan Liang, Yu Liu, Wenguan Wang, and Ling Shao," Real-time Superpixel Segmentation by DBSCAN Clustering Algorithm", 2016, IEEE.
  5. Ilias K. Savvas, and Dimitrios Tselios," Parallelizing DBSCAN Algorithm Using MPI", 2016.
  6. Ahmad M. Bakr , Nagia M. Ghanem, Mohamed A. Ismail," Efficient incremental density-based algorithm for clustering large datasets", 2014, Elsevier Pvt. Ltd.
  7. 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.
  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. 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.
  10. 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.
  11. 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.
  12. 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.
  13. 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.
  14. Osamor VC, Adebiyi EF, Oyelade JO and Doumbia S "Reducing the Time Requirement of K-Means Algorithm" PLoS ONE, Volume 7, Issue 12, 2012.
  15. 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.
  16. 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.
  17. 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.     
  18. 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.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2017-12-31

Issue

Volume 3, Issue 8, November-December-2017

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Asha Devi, Saurabh Sharma, " Novel Technique for Density Based Clustering Using Neural Networks, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 3, Issue 8, pp.347-352, November-December-2017.