Open Access   Article Go Back

A Comprehensive Review of Privacy Preserving Framework Using Wavecluster and K-Means Algorithm

Manjot Kiran Kaur Bedi1 , Rekha Bhatia2

  1. Department of computer science, PURCITM Mohali, Punjab, INDIA.
  2. Department of computer science, PURCITM Mohali, Punjab, INDIA.

Section:Review Paper, Product Type: Journal Paper
Volume-6 , Issue-3 , Page no. 442-446, Mar-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i3.442446

Online published on Mar 30, 2018

Copyright © Manjot Kiran Kaur Bedi, 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: Manjot Kiran Kaur Bedi, Rekha Bhatia, “A Comprehensive Review of Privacy Preserving Framework Using Wavecluster and K-Means Algorithm,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.3, pp.442-446, 2018.

MLA Style Citation: Manjot Kiran Kaur Bedi, Rekha Bhatia "A Comprehensive Review of Privacy Preserving Framework Using Wavecluster and K-Means Algorithm." International Journal of Computer Sciences and Engineering 6.3 (2018): 442-446.

APA Style Citation: Manjot Kiran Kaur Bedi, Rekha Bhatia, (2018). A Comprehensive Review of Privacy Preserving Framework Using Wavecluster and K-Means Algorithm. International Journal of Computer Sciences and Engineering, 6(3), 442-446.

BibTex Style Citation:
@article{Bedi_2018,
author = {Manjot Kiran Kaur Bedi, Rekha Bhatia},
title = {A Comprehensive Review of Privacy Preserving Framework Using Wavecluster 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 = {442-446},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1825},
doi = {https://doi.org/10.26438/ijcse/v6i3.442446}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i3.442446}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1825
TI - A Comprehensive Review of Privacy Preserving Framework Using Wavecluster and K-Means Algorithm
T2 - International Journal of Computer Sciences and Engineering
AU - Manjot Kiran Kaur Bedi, Rekha Bhatia
PY - 2018
DA - 2018/03/30
PB - IJCSE, Indore, INDIA
SP - 442-446
IS - 3
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
1149 328 downloads 259 downloads
  
  
           

Abstract

A process of partitioning a set of data (or objects) into a set of significant sub-classes, called clusters. Also can be said as unsupervised classification which has no predefined classes. K- Mean is a type of unsupervised learning, which is used when we have any data without defined class or groups. The goal of this algorithm is to find the number of groups in the data, and represented by the variables K1, K2, up till KN. A wavelet based clustering approach for spatial statistics on very huge data. This is a grid based approach which applies wavelet transform in the quantized trait space and then senses the dense section in the transformed space. This paper discusses about the review of the clustering techniques which are observed and used by other numerous researchers for data mining. Further, this paper discusses about the advantages and limitations of the clustering techniques. As based on previous researchers’ contribution that k-mean alone can’t be efficient enough for the increased data set. So with time improved versions were introduced and combining two or more techniques for data mining clustering was practiced. This paper overcame the limitations and found more efficient way for clustering.

Key-Words / Index Term

Data Mining, Clustring, K-Means Clustering, Wave Clustering

References

[1]. Jitendra Kumar and Binit Kumar Sinha ID CODE-1789, Department of Computer Science (NIT ROURKELA, ODISHA) Privacy Preserving Clustering in Data Mining
[2]. Michail Vlachos, Jessica Lin, Eamonn Keogh and Dimitrios Gunopulos Computer Science & Engineering Department University of California - Riverside A Wavelet-Based Anytime Algorithm for K-Means Clustering of Time Series.
[3]. Shruti Dalmiya, Avijit Dasgupta and Soumya Kanti Datta International Journal of Computer Applications (0975-8887) Application of Wavelet based K-means Algorithm in Mammogram Segmentation.
[4]. Rafal Ladysz FINAL PROJECT PAPER for INFS 795 CLUSTERING OF EVOLVING TIME SERIES DATA
[5]. Kondra, Janardhan Reddy Privacy Preserving Optics Clustering ID CODE-8539, Department of Computer Science (NIT ROURKELA, ODISHA)
[6]. Bikash Sharma and Aman Jain Privacy preserving data mining ID CODE -4218, Department of Computer Science (NIT ROURKELA, ODISHA)
[7]. Kaur, S., Chaudhary S., Bishnoi N. (2015) a survey: Clustering Algorithm in Data Mining. International Journal of Computer Applications, (0975-8887), 12-14.
[8]. Vaidya J., Clifton C. (2003) Privacy Preserving K-Means Clustering Over Vertically Partitioned Data. SIGKDD. 206-215.
[9]. Sachin Shinde et al (2003) Improved K-means Algorithm for Searching Research Papers, International Journal of Computer Science & Communication Networks,Vol (6),197-202
[10]. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman and Angela Y. Wu (2002) An Efficient k-Means Clustering Algorithm:Analysis and Implementation IEEE transactions on pattern analysis and machine intelligence, vol. 24, no. 7, july 2002.
[11]. Christopher and Divya (2005) 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.
[12]. Na S., XuminL., Yong G.(2010), Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm, IITSI `10 Proceedings of the 2010 Third International Symposium on Intelligent Information Technology and Security Informatics, 63-67.
[13]. Kedar B. Sawant Shree Rayeshwar (2015) Institute of Engineering and Information Technology IT Department, Shiroda-Goa Volume 3, Issue 1, 2015, ISSN 2349-4395 (PRINT) & ISSN 2349-4409 (ONLINE).
[14]. Priti Maheshwary et al. (2011) International Journal on Computer Science and Engineering (IJCSE) ISSN : 0975-3397 Vol. 3 No. 2
[15]. Kalaivani. R and Dr. R. Manicka Chezhian (2013) A Competent Data Set Grouping in Clustering Algorithms Volume 3, Issue 8, August 2013 ISSN: 2277 128X
[16]. Dr. S. Vijayarani, Ms.P.Jothi (2014) Partitioning Clustering Algorithms for Data Stream Outlier Detection. International Journal of Innovative Research in Computer and Communication Engineering. ISSN (Online): 2320-9801
[17]. Gholamhosein Sheikholeslami, Surojit Chatterjee, Aidong Zhang WaveCluster: a wavelet-based clustering approach for spatial data in very large databases. The VLDB Journal (2000) 8: 289–304
[18]. Ling Chen, Ting Yu and Rada Chirkova (2015) WaveCluster with Differential Privacy Department of Computer Science, North Carolina State University, Raleigh, USA.
[19]. Ahmet Artu Yıldırım and Cem Özdoğan Parallel WaveCluster: A linear scaling parallel clustering algorithm implementation with application to very large datasets J. Parallel Distrib. Comput. 71 (2011) 955–962
[19]. K. Chitra and Dr. D.Maheswari (2017) International Journal of Computer Science and Mobile Computing ISSN 2320–088X