Abhishek ., Ambuj Shekhar Singh, Akash ., Shashikala N


We are going to discuss the Privacy-preserving Possibilistic c-Means Algorithm. This algorithm is used for clustering in a way that every data point is mapped to multiple clusters in the system. This mapping arrangement can have variable degree of membership. The data available is large in number and heterogenous in nature. The PCM algorithm uses the map reduce property to act on the data for clustering. BGV encryption scheme is applied to PCM algorithm to protect and preserve the data privacy particularly on cloud systems. Clustering is mainly used to differentiate and classify data items among various groups based on their attributes. By this process being undertaken the data items of similar attributes are places in a single group of data items. Many techniques of clustering are applied for data extraction and discovery of various aspects of data.


Big Data Clustering, Privacy Preserving, Possibilistic c-means, HDFS, Map Reduce

Full Text:



. X. Wu, X. Zhu, G.-Q. Wu, and W. Ding, “Data Mining with Big Data,” IEEE Transactions on Knowledge and Data Engineering, vol.26, no.1, pp.97-107.2014. [2]. B. Ermis, Acar, and A.T. Cemgil,” Link Prediction in Heterogenous Data via Generalized Coupled Tensor Factorization, “Data Mining and Knowledge Discovery, vol.29, no.1, pp.203-236,2015.

. Q. Zhang, L.T. Yang, and Z. Chen,” Deep Computation Model for Unsupervised Feature Learning on Big Data,” IEEE Transaction on services Computing, vol.9, no.1, pp.161-171, jan.2016. [4]. N. Soni and A. Ganatra,” MOiD (multiple Objects Incremental DBSCAN)-A Paradigm Shift in Incremental DBSCAN,” International Journal of Computer Science and Information Security, vol.14, no.4, pp.316-346,2016. [5]. Z. Xie, S. Wang, and F.L. Chung,” An Enhanced Possibilistic c-Means Clustering Algorithm EPCM,” Soft Computing, vol.12, no.6 pp.59-611,2008. [6]. Q. Zhang, C. Zhu, L.T. Yang, Z. Chen, L. Zhao and P.Li,” An Incremental CFS Algorithm for Clustering Large Data in Industrial Internet of Things,” IEEE Transactions on Industrial Informatics, 2015.DOI:10.1109/TII.2017.2684807. [7]. X. Zhang,” Convex Discriminative Multitasking Clustering,” IEEE Transactions on Pattern Analysis and machine Intelligence, vol.37, no.1, pp.28-40, Jan.2015. [8]. B. Gao, T. Liu, T. Qin, X. Zheng, Q. Cheng, and W. Ma,” Web Image Clustering by Consistent Utilization of Visual Features and Surrounding Texts,” in Proceedings of the 13th Annual ACM international conference on Multimedia,2005,112-121. [9]. Y. Chen, L. Wang, and M. Dong,” Non-Negative Matrix Factorization for semi supervised Heterogeneous Data Coclustering,” IEEE Transactions on Knowledge and Data Engineering, vol.22, no.10, pp.1459-1474, Oct.2010. [10]. L. Meng, A. Tan, and D. Xu,” Semi-Supervised heterogeneous Fusion for Multimedia Data Co-Clustering”, IEEE Transactions on Knowledge and Data Engineering, vol.26, no.9, pp.2293-2306, Aug.2014.



  • There are currently no refbacks.

Copyright (c) 2018 International Journal of Advanced Research in Computer Science