Repository logo
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Scholalry Output
  3. Publications
  4. Maintaining privacy and data quality in privacy preserving association rule mining
 
  • Details

Maintaining privacy and data quality in privacy preserving association rule mining

Source
2010 2nd International Conference on Computing Communication and Networking Technologies Icccnt 2010
Date Issued
2010-11-25
Author(s)
Modi, Chirag N.
Rao, Udai Pratap
Patel, Dhiren R.
DOI
10.1109/ICCCNT.2010.5592589
Abstract
Privacy preserving data mining (PPDM) is a novel research direction to preserve privacy for sensitive knowledge from disclosure. Many of the researchers in this area have recently made effort to preserve privacy for sensitive association rules in statistical database. In this paper, we propose a heuristic algorithm named DSRRC (Decrease Support of R.H.S. item of Rule Clusters), which provides privacy for sensitive rules at certain level while ensuring data quality. Proposed algorithm clusters the sensitive association rules based on certain criteria and hides as many as possible rules at a time by modifying fewer transactions. Because of less modification in database it helps maintaining data quality. ©2010 IEEE.
Unpaywall
URI
https://d8.irins.org/handle/IITG2025/21094
Subjects
Association rule hiding | Clustering | Data mining | Frequent itemset hiding | Sensitivity
IITGN Knowledge Repository Developed and Managed by Library

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify