an algorithm to hide sensitive association rules through perturb technique

due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. association rules mining is one of the data mining techniques to extract useful patterns in the form of association rules. one of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. hiding the association rules is one of the methods to preserve privacy and it is a main subject in the field of data mining and database security, for which several algorithms with different approaches are presented so far. an algorithm to hide sensitive association rules with a heuristic approach is presented in this article, where the perturb technique based on reducing confidence or support rules is applied with the attempt to remove the considered item from a transaction with the highest weight by allocating weight to the items and transactions. efficiency is measured by the failure criteria of hiding, number of lost rules and ghost rules, and execution time. the obtained results of this study are assessed and compared with two known fhsar and rrlr algorithms, based on two real databases (dense and sparse). the results indicate that the number of lost rules in all experiments are reduced by 47% in comparison with rrlr and reduced by 23% in comparison with fhsar. moreover, the other undesirable side effects, in this proposed algorithm in the worst case are equal to that of the base algorithms.