Mining algorithm with fast privacy protecting association rules

With the growing size of the database,association rules mining needs to be improved in efficiency,availability,privacy and accuracy.Hence it is needed for the traditional association rule mining algorithm to be updated and improved.In this paper,there is a new association rule mining algorithm based on traditional Apriori algorithm in the relational database.The algorithm only needs to scan the database once you can get frequent itemsets,and through non-frequent itemsets to reduce the generation of candidate items to improve the computing efficiency of the algorithm;At the same time,the algorithm will contain sensitive data to do related services processing in order to achieve hiding association rules that contain sensitive data.Theoretical analysis and experimental results show that the new algorithm not only improves the efficiency of mining association rules,but also hides the association rules that contains sensitive rule.