Title of article :
A Novel Approach for Hiding Sensitive Association Rules using Data Perturbation and Query Restriction Strategy in Recommendation Systems
Author/Authors :
kamal, reham ain shams university, Cairo, Egypt , hussein, wedad ain shams university, Cairo, Egypt , ismail, rasha ain shams university, Cairo, Egypt
From page :
44
To page :
58
Abstract :
Mining association rules is considered to be core topic of data mining. Discovering these associations is beneficial and is highly needed to the correct and appropriate decision made by decision makers in the different fields. Association rule Mining imposes threats to data sharing, since it may disclose patterns and various kinds of sensitive knowledge that are difficult to find. Such information must be protected against unauthorized access. In this paper, we used DPQR strategy (data perturbation and query restriction) to hide the sensitive patterns. Experimental results showed that our proposed system can hide sensitive rules with multiple items in consequent (right hand side (R.H.S) ) and antecedent ( left hand side (L.H.S)) with efficient and faster performance compared to MDSRRC (Modified Decrease Support of R.H.S. items of Rule Cluster) with average improvement 96.22 % as well as generating accurate recommendations without revealing sensitive information.
Keywords :
Data mining , recommender system , privacy
Journal title :
International Journal of Intelligent Computing and Information Sciences
Journal title :
International Journal of Intelligent Computing and Information Sciences
Record number :
2748008
Link To Document :
بازگشت