A Comprehensive Review of Privacy Preservation Framework using Birch and K-Means Algorithm
DOI:
https://doi.org/10.26438/ijcse/v6i3.461466Keywords:
Data Mining, Clustring, K-Means Clustering, Birch ClusteringAbstract
Clustering is important part in Data mining. Clustering is a technique, in which data is using in the form of clusters. A set of objects divided into groups these groups called clusters. K-MEANS is a basic type of clustering technique. It is an unsupervised learning. K-means clustering is a simple technique, which is use to group items into k clusters. BIRCH is one of the famous methods, which used with the k-means to improve the quality of data, which are present in clusters. BIRCH is an (Balanced Iterative Reducing and Clustering using Hierarchies). Birch is a scalable clustering method, which mainly designed for very large data sets. In this paper we discussed about review of other clustering technique which are used by others researchers for data mining. We also discussed the limitations and applications of clustering techniques, which are most popular for data mining. This paper also represents a current review about the K-MEANS and BIRCH algorithm.
References
Shraddha Shukla and Naganna (2014)S, “A Review ON K-means DATA Clustering APPROACH” International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 4, Number 17 (2014), pp. 1847-1860
Wang, X. Y., & Garibaldi, J. M. (2005, June) “A comparison of fuzzy and non-fuzzy clustering techniques in cancer diagnosis” In Proceedings of the 2nd International Conference in Computational Intelligence in Medicine and Healthcare, BIOPATTERN Conference, Costa da Caparica, Lisbon, Portugal (Vol. 28).
Kanungo, Tapas, et al. "An efficient k-means clustering algorithm: Analysis and implementation.” IEEE transactions on pattern analysis and machine intelligence 24.7 (2002): 881-892.
Rafsanjani, Marjan Kuchaki, Zahra Asghari Varzaneh, and Nasibeh Emami Chukanlo. "The Journal of Mathematics and Computer Science." TJMCS Vol .5 No.3 (2012) 229-240
Christopher, T and Divya, T. (2015). “A Study of Clustering Based Algorithm for Outlier Detection in Data streams”. International Journal of Advanced Networking and Applications, Proceedings of the UGC Sponsored National Conference on Advanced Networking and Applications, 194-197.
Kaur, S., Chaudhary S., Bishnoi N. (2015). “A Survey: Clustering Algorithms in Data Mining.” International Journal of Computer Applications, (0975- 8887), 12-14.
Vijayarani S., Jothi P.,(2014). “Hierarchical and Partitioning Clustering Algorithms for Detecting Outliers in Data Streams”. International Journal of Advanced Research in Computer and Communication Engineering, 3(4), 6204-6207.
Fichtenberger H., Gillé M., Schmidt M., Schwiegelshohn C., Sohler C. (2013) “BICO: BIRCH Meets Coresets for k-Means Clustering. In: Bodlaender H.L., Italiano G.F. (eds) Algorithms”. ESA 2013. Lecture Notes in Computer Science, vol 8125. Springer, Berlin, Heidelberg
Na S., XuminL. ,Yong G.(2010), “Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm”. Third International Symposium on Intelligent Information Technology and Security Informatics, pp.63-67
Kumar J. and Sinha B.K. (2010), “Privacy Preserving Clustering In Data Mining”, A thesis submitted for degree of bachelor in Technology in Computer science and engineering of Department of Computer Science and Engineering ,National Institute of Technology Rourkela
Vaidya J.,Clifton C. (2003). “Privacy-Preserving K -Means Clustering over Vertically Partitioned Data”. KDD-2003 Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. SIGKDD. 206-215
Zhang, T., Ramakrishnan, R. & Livny, M. “BIRCH: A New Data Clustering Algorithm and Its Applications” Data Mining and Knowledge Discovery(1997) , Volume 1, Issue 2, pp 141–182
Raghu Ramakrishnam Zhang, “BIRCH: A New Data Clustering Algorithm and Its Applications” Data Mining and Knowledge Discovery(1997) , Volume 1, pp 141–182
Kedar B. Sawant Shree Rayeshwar “international journals of advances in management and enginerring sciences, volume 4, issue 6(1)RJanuary 2015, PP 22-27 ISSN 2349-4395(Print) & ISSN2349-4409(Online)
Prateeksha Tomar, Amit Kumar Manjhvar, “Clustering Classification for Diabetic Patients using K-Means and M-Tree prediction model”, International Journal of Scientific Research in Multidisciplinary Studies , Vol.3, Issue.6, pp.48-53, 2017.
Rajesh N. “Survey on Privacy Preserving Data Mining Techniques using Recent Algorithms”. International Journal of Computer Applications (0975 – 8887) Volume 133 – No.7, January 2016
Ashaq Hussain Bhat, Puniethaa Prabhu, "OTU Clustering: A window to analyse uncultured microbial world", International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.6, pp.62-68, 2017
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srinathan, and C.V. Jawahar, “Efficient Privacy Preserving K-Means Clustering”. Pacific-Asia workshop on intelligence and security informatics ,PAISI 2010 : Intelligence and security informatics pp 154-166
Animesh Tripathy1, Ipsa DE1, “Privacy Preserving Two-Party Hierarchical Clustering Over Vertically Partitioned Dataset” A Journal of Software Engineering and Applications, 2013, 6, 26-31
Jinfei Liu, Li Xiong, Jun Luo, Joshua Zhexue “Privacy Preserving Distributed DBSCAN Clustering”. Transactions of data privacy vol 6 issue 1, april 2013 page 69-85
R. Sasikala T. Bhuvaneswari ,Assistant Professor Department of Computer Science and Engineering ,Sankara College of Commerce and Science
Dr. T. Christopher, “A Study of Clustering Based Algorithm for Outlier Detection in Data streams” Proceedings of the UGC Sponsored National Conference on Advanced Networking and Applications.pp194-197
Kanungo, Tapas, et al. "An efficient k-means clustering algorithm: Analysis and implementation." IEEE transactions on pattern analysis and machine intelligence 24.7 (2002): 881-892.
B.S.Sangeetha,K.N.Nithya,N.Suganya Devi, A.Shyamala Gowri, “An Innovation approach in searching of research paper using text clustering with feature selection” IJMDRR E-ISSN-2395-1885 ISSN -2395-1877
T.Vijaya Kumar, Dr. H.S.Guruprasad “Clustering of Web Usage Data using Hybrid K-means and PACT Algorithms” BIJIT - BVICAM’s International Journal of Information Technology
P.Prabhu “Improving the performance of K-means clustering for high dimensional data sets.” International Journal on Computer Science and Engineering (IJCSE)
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
