Modi, Chirag N.Chirag N.ModiRao, Udai PratapUdai PratapRaoPatel, Dhiren R.Dhiren R.Patel2025-08-302025-08-302010-11-25[9781424465910]10.1109/ICCCNT.2010.55925892-s2.0-78549284581http://repository.iitgn.ac.in/handle/IITG2025/21094Privacy 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.falseAssociation rule hiding | Clustering | Data mining | Frequent itemset hiding | SensitivityConference Paper2010365592589cpConference Proceeding31