An Extended Frequent Pattern Tree for Hiding Sensitive Frequent Itemsets


The KIPS Transactions:PartD, Vol. 18, No. 3, pp. 169-178, Jun. 2011
10.3745/KIPSTD.2011.18.3.169,   PDF Download:

Abstract

Recently, data sharing between enterprises or organizations is required matter for task cooperation. In this process, when the enterprise opens its database to the affiliates, it can be occurred to problem leaked sensitive information. To resolve this problem it is needed to hide sensitive information from the database. Previous research hiding sensitive information applied different heuristic algorithms to maintain quality of the database. But there have been few studies analyzing the effects on the items modified during the hiding process and trying to minimize the hided items. This paper suggests eFP-Tree(Extended Frequent Pattern Tree) based FP-Tree(Frequent Pattern Tree) to hide sensitive frequent itemsets. Node formation of eFP-Tree uses border to minimize impacts of non sensitive frequent itemsets in hiding process, by organizing all transaction, sensitive and border information differently to before. As a result to apply eFP-Tree to the example transaction database, the lost items were less than 10%, proving it is more effective than the existing algorithm and maintain the quality of database to the optimal.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
D. Y. Lee, H. G. An, J. J. Koh, "An Extended Frequent Pattern Tree for Hiding Sensitive Frequent Itemsets," The KIPS Transactions:PartD, vol. 18, no. 3, pp. 169-178, 2011. DOI: 10.3745/KIPSTD.2011.18.3.169.

[ACM Style]
Dan Young Lee, Hyoung Geun An, and Jae Jin Koh. 2011. An Extended Frequent Pattern Tree for Hiding Sensitive Frequent Itemsets. The KIPS Transactions:PartD, 18, 3, (2011), 169-178. DOI: 10.3745/KIPSTD.2011.18.3.169.