摘要
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.