Abstract
In order to mine association rules accurately and efficiently while preserving the privacy thereof, a novel privacy-preserving association rules mining method is proposed in this paper. Known as the partial randomized response based on probability matrix, or PRRPM, this method chooses different data transition strategies to find frequent 1-itemsets and k-itemsets (k > 1). The PRRPM algorithm is explored and its validity examined through theoretical analysis and experiments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Pattern Recognition and Artificial Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
