Privacy Preserving Association Rule Mining using ROBFRUGHAL Algorithm


Authors : K.Aishwarya chakravarthy, M.Meena , M.Spoorthy , Saravanan

Volume/Issue : Volume 2 - 2017, Issue 4 - April

Google Scholar : https://goo.gl/wisQI9

Scribd : https://goo.gl/q7Bp6w

Thomson Reuters ResearcherID : https://goo.gl/3bkzwv

Concept of data preservation has become a challenging task. Security of the data is one of the prime concerns in today’s technology. Privacy Preserving Data Mining (PPDM) deals with the protection of private data. Association rule mining and frequent item-set rule mining are highly used for application purposes. These lead to approximations which have high accuracy, low data leak-age and improvement in efficiency. Transparency of the data processing should be limited to the users involved in order to minimize the leakage of sensitive business infor-mation. Accuracy and efficiency is being obtained from the rules. Homomorphic encryption scheme is been developed to ensure data privacy. The data is transformed by the owner in order to provide privacy which is then sent to the server. The server receives the mining queries which are then sent to the cloud to get the desired solution. SIN order to protect the sensitive information in the corporate field, the owner would perform ROBFRUGHAL encryption scheme which is transformed to the server.

Keywords : Index Terms: Privacy preserving data mining, Association rule mining, frequent item-set rule mining, Rob frugal encryp-tion scheme algorithm.

CALL FOR PAPERS


Paper Submission Last Date
31 - December - 2020

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.
Subscribe
OR

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.
Subscribe