A fast perturbation algorithm using tree structure for privacy preserving utility mining

作者：

Highlights：

• We propose a novel fast perturbation algorithm for protecting database privacy.

• We introduce a new tree structure for effectively performing perturbation processes.

• Traversal techniques using two tables are employed to reduce the search space of PPUM.

• We demonstrate the efficiency by performing theoretical and empirical comparisons.

• Experimental results show that FPUTT is 5–10 times faster than previous algorithms.

摘要

•We propose a novel fast perturbation algorithm for protecting database privacy.•We introduce a new tree structure for effectively performing perturbation processes.•Traversal techniques using two tables are employed to reduce the search space of PPUM.•We demonstrate the efficiency by performing theoretical and empirical comparisons.•Experimental results show that FPUTT is 5–10 times faster than previous algorithms.

论文关键词：Privacy preserving,Utility pattern mining,Perturbation,Frequent pattern mining,Data mining

论文评审过程：Available online 9 September 2014.

论文官网地址：https://doi.org/10.1016/j.eswa.2014.08.037