IDEAS home Printed from https://ideas.repec.org/a/ids/ijbisy/v38y2021i1p17-33.html
   My bibliography  Save this article

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

Author

Listed:
  • R. Lalitha
  • K. Rameshkumar

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.

Suggested Citation

  • R. Lalitha & K. Rameshkumar, 2021. "Cluster-based convolution process on big data in privacy preserving data mining," International Journal of Business Information Systems, Inderscience Enterprises Ltd, vol. 38(1), pages 17-33.
  • Handle: RePEc:ids:ijbisy:v:38:y:2021:i:1:p:17-33
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=118633
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijbisy:v:38:y:2021:i:1:p:17-33. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=172 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.