Cluster-based convolution process on big data in privacy preserving data mining

R. Lalitha and K. Rameshkumar

International Journal of Business Information Systems, 2021, vol. 38, issue 1, 17-33

Abstract: The main intension of this paper is to privacy preserving-aware over big data in clouds using KNN and MapReduce framework. This paper consists of three phases such as, MapReduce phase, clustering the map reduced data and evaluation phase. In MapReduce phase, we are splitting the input data after the splitting process we are including a k-means clustering algorithm to cluster the map reduced data. Then, we are performing a convolution process to the dataset and create a new matrix. Once it is over, the privacy-persevering framework over big data in cloud systems is performed based on the evaluation base. In evaluation module, deduplication is performed with the aid of the KNN algorithm. In this phase using the KNN technique to check the duplication of data based on the threshold. Thus the non-duplicated data's are stored in cloud database, which is improving the utility of the privacy data.

Keywords: k-means clustering; MapReduce; privacy preserving; K-nearest neighbour; KNN. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=118633 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijbisy:v:38:y:2021:i:1:p:17-33

Access Statistics for this article

More articles in International Journal of Business Information Systems from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().