Browse > Article
http://dx.doi.org/10.9717/kmms.2011.14.10.1323

Border-based HSFI Algorithm for Hiding Sensitive Frequent Itemsets  

Lee, Dan-Young (울산대학교 전기공학부)
An, Hyoung-Keun (울산대학교 전기공학부)
Koh, Jae-Jin (울산대학교 전기공학부)
Publication Information
Journal of Korea Multimedia Society / v.14, no.10, 2011 , pp. 1323-1334 More about this Journal
Abstract
This paper suggests the border based HSFI algorithm to hide sensitive frequent itemsets. Node formation of FP-Tree which is different from the previous one uses the border to minimize the impacts of nonsensitive frequent itemsets in hiding process, including the organization of sensitive and border information, and all transaction as well. As a result of applying HSFI algorithms, it is possible to be the example transaction database, by significantly reducing the lost items, it turns out that HSFI algorithm is more effective than the existing algorithm for maintaining the quality of more improved database.
Keywords
Data Mining; FP-Tree; FP-Growth; Sensitive Frequent ItemSets;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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.
2 R. Agrawal and R. Srikant, "Mining Sequential Patterns," Proc. of the 11th International Conference on Data Engineering(ICDE'95) , pp. 3-14, 1995.
3 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.
4 http://www.almaden.ibm.com/cs/projects/iis/hdb/ Projects/data_mining/mining.shtml
5 V. S. Verykios, E. Bertino, I. N. Fovino, L. P. Provenza, Y. Saygin, and Y. Theodoridis, "State-of-the-Art in Privacy Preserving Data Mining," SIGMOD Record, 33(1), pp. 50-57, 2004.   DOI   ScienceOn
6 J. Han, J. Pei, Y. Yin, and 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
7 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.
8 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.
9 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   ScienceOn
10 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.
11 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.
12 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.
13 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
14 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