A Comprehensive Review of Privacy Preservation Framework using Birch and K-Means Algorithm
Prabhjeet Kaur1 , Rekha Bhatia2
- Department of computer science, PURCITM Mohali, Punjab, INDIA.
- Department of computer science, PURCITM Mohali, Punjab, INDIA.
Section:Review Paper, Product Type: Journal Paper
Volume-6 ,
Issue-3 , Page no. 461-466, Mar-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i3.461466
Online published on Mar 30, 2018
Copyright © Prabhjeet Kaur, Rekha Bhatia . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
View this paper at Google Scholar | DPI Digital Library
How to Cite this Paper
- IEEE Citation
- MLA Citation
- APA Citation
- BibTex Citation
- RIS Citation
IEEE Style Citation: Prabhjeet Kaur, Rekha Bhatia, “A Comprehensive Review of Privacy Preservation Framework using Birch and K-Means Algorithm,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.3, pp.461-466, 2018.
MLA Style Citation: Prabhjeet Kaur, Rekha Bhatia "A Comprehensive Review of Privacy Preservation Framework using Birch and K-Means Algorithm." International Journal of Computer Sciences and Engineering 6.3 (2018): 461-466.
APA Style Citation: Prabhjeet Kaur, Rekha Bhatia, (2018). A Comprehensive Review of Privacy Preservation Framework using Birch and K-Means Algorithm. International Journal of Computer Sciences and Engineering, 6(3), 461-466.
BibTex Style Citation:
@article{Kaur_2018,
author = {Prabhjeet Kaur, Rekha Bhatia},
title = {A Comprehensive Review of Privacy Preservation Framework using Birch and K-Means Algorithm},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2018},
volume = {6},
Issue = {3},
month = {3},
year = {2018},
issn = {2347-2693},
pages = {461-466},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1829},
doi = {https://doi.org/10.26438/ijcse/v6i3.461466}
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i3.461466}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1829
TI - A Comprehensive Review of Privacy Preservation Framework using Birch and K-Means Algorithm
T2 - International Journal of Computer Sciences and Engineering
AU - Prabhjeet Kaur, Rekha Bhatia
PY - 2018
DA - 2018/03/30
PB - IJCSE, Indore, INDIA
SP - 461-466
IS - 3
VL - 6
SN - 2347-2693
ER -
VIEWS | XML | |
703 | 370 downloads | 292 downloads |
Abstract
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.
Key-Words / Index Term
Data Mining, Clustring, K-Means Clustering, Birch Clustering
References
[1] 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
[2] 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).
[3] 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.
[4]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
[5] 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.
[6]Kaur, S., Chaudhary S., Bishnoi N. (2015). “A Survey: Clustering Algorithms in Data Mining.” International Journal of Computer Applications, (0975- 8887), 12-14.
[7]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.
[8] 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
[9]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
[10] 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
[11] 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
[12] 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
[13]Raghu Ramakrishnam Zhang, “BIRCH: A New Data Clustering Algorithm and Its Applications” Data Mining and Knowledge Discovery(1997) , Volume 1, pp 141–182
[14] 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)
[15] 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.
[16]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
[17] 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
[18]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
[19]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
[20] 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
[21] R. Sasikala T. Bhuvaneswari ,Assistant Professor Department of Computer Science and Engineering ,Sankara College of Commerce and Science
[22] 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
[23] 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.
[24]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
[25] 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
[26] P.Prabhu “Improving the performance of K-means clustering for high dimensional data sets.” International Journal on Computer Science and Engineering (IJCSE)