Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2011.18D.3.169

An Extended Frequent Pattern Tree for Hiding Sensitive Frequent Itemsets  

Lee, Dan-Young (울산대학교 전기공학부)
An, Hyoung-Geun (울산대학교 전기공학부)
Koh, Jae-Jin (울산대학교 전기공학부)
Publication Information
The KIPS Transactions:PartD / v.18D, no.3, 2011 , pp. 169-178 More about this Journal
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.
Keywords
Data Mining; FP-Tree; FP-Growth; Sensitive Frequent ItemSets;
Citations & Related Records
연도 인용수 순위
  • Reference
1 V. S. Verykios, A. K. Elmagarmid, E. Bertino, Y. Saygin, and E. Dasseni, "Association rule hiding," IEEE Trans. Knowledge and Data Eng., Vol.16, No.4, pp.434-447, 2004.   DOI   ScienceOn
2 Shyue-Liang Wang, "Hiding sensitive predictive association rules," Systems, Man and Cybernetics, 2005 IEEE International Conference on Information Reuse and Integration, Vol.1, pp.164-169, 2005.   DOI
3 Yi-Hung Wu, Chai-Ming Chiang and Arbee L. P. Chen, "Hiding Sensitive Association Rules with Limited Side Effects," IEEE Transactions on Knowledge and Data Engineering, Vol.19, Issue 1, pp.29-42, 2007.   DOI   ScienceOn
4 http://www.almaden.ibm.com/cs/projects/iis/hdb/Projects/data_mining/mining.shtml
5 E. Dasseni, V. S. Verykios, A. K. Elmagarmid and E. Bertino, "Hiding association rules by using confidence and support," Proc. of the 4th Information Hiding Workshop, pp.369-383, 2001.   DOI   ScienceOn
6 Y. Saygin, V. S. Verykios, and A. K. Elmagarmid, "Privacy preserving association rule mining," Proc. of the IEEE workshop Research Issues in Data Eng., 2002.   DOI
7 S. Oliveira, O. Zaiane and Y. Saygin, "Secure association rule sharing," Proc. of the 8th Pacific-Asia Conference Knowledge Discovery and Data Mining, pp.74-85, 2004.
8 H. Mannila and H. Toivonen, "Levelwise search and borders of theories in knowledge discovery," Data Mining and Knowledge Discovery, Vol.1, No.3, pp.241-258, 1997.   DOI
9 R. Agrawal and R. Srikant, "Mining Sequential Patterns," Proc. of the 11th International Conference on Data Engineering (ICDE'95), pp.3-14, 1995.   DOI
10 R. Agrawal and R. Srikant, "Fast algorithms for mining association rules in large databases," Proc. of the 20th International Conference on Very Large Data Bases, pp.487-499, 1994.
11 M. Atallah, E. Bertino, A. Elmagarmid, M. Ibrahim and V. Verykos, "Disclosure limitation of sensitive rules," Proc. of the IEEE workshop Knowledge and Data Eng. Exchange, pp.45-52, 1999.   DOI
12 C. Clifton and D. Marks, "Security and privacy implications of data mining," Data Mining and Knowledge Discovery, Proc. of the ACM workshop Research Issues in Data Mining and Knowledge Discovery, pp.15-19, 1996.
13 J. Han, J. Pei, Y. Yin, R. Mao, "Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach," Data Mining and Knowledge Discovery, Vol.8, pp.53-87, 2004.   DOI   ScienceOn