A novel method for privacy preserving in association rule mining based on genetic algorithms

被引:23
作者
Dehkordi, Mohammad Naderi [1 ]
Badie, Kambiz [2 ]
Zadeh, Ahmad Khadem [2 ]
机构
[1] Science and Research Branch, Islamic Azad University (IAU), Department of Computer Engineering, Tehran
[2] Iran Telecom Research Center, Tehran
关键词
Data mining; Genetic algorithms; Privacy preserving; Sensitive association rules;
D O I
10.4304/jsw.4.6.555-562
中图分类号
学科分类号
摘要
Extracting of knowledge form large amount of data is an important issue in data mining systems. One of most important activities in data mining is association rule mining and the new head for data mining research area is privacy of mining. Today association rule mining has been a hot research topic in Data Mining and security area. A lot of research has done in this area but most of them focused on perturbation of original database heuristically. Therefore the final accuracy of released database falls down intensely. In addition to accuracy of database the main aspect of security in this area is privacy of database that is not warranted in most heuristic approaches, perfectly. In this paper we introduce new multi-objective method for hiding sensitive association rules based on the concept of genetic algorithms. The main purpose of this method is fully supporting security of database and keeping the utility and certainty of mined rules at highest level. © 2009 ACADEMY PUBLISHER.
引用
收藏
页码:555 / 562
页数:7
相关论文
共 15 条
[1]  
Atallah M., Bertino E., Elmagarmid A., Ibrahim M., Verykios V., Disclosure limitation of sensitive rules, Proc. Of IEEE Knowledge and Data Engineering Exchange Workshop (KDEX), (1999)
[2]  
Saygin Y., Verykios V., Clifton C., Using unknowns to prevent discovery of association rules, ACM SIGMOD Record, 30, (2001)
[3]  
Verykios V., Elmagarmid A., Bertino E., Saygin Y., Dasseni E., Association Rule Hiding, IEEE Trans. On Knowledge and Data Engineering, 16, 4, (2004)
[4]  
Saygin Y., Verykios V., Elmagarmid A., Privacy preserving association rule mining, Proc. of 12th Intl. Workshop on Research Issues in Data Engineering (RIDE), (2002)
[5]  
Chang L., Moskowitz I.S., Parsimonious downgrading and decision trees applied to the inference problem, Workshop on New Security Paradigms, (1998)
[6]  
Johnsten T., Raghavan V., Hill K., The security assessment of association mining algorithms, Proceedings of the 16th Annual IFIP WG 11.3, pp. 163-174, (2002)
[7]  
Dasseni E., Verykios V.S., Elmagarmid A., Bertino E., Hiding association rules by using confidence and support, Proc. of the 4th Int'l Information Hiding Workshop (IHW'01), pp. 369-383, (2001)
[8]  
Pontikakis E.D., Tsitsonis A., Verykios V.S., An experimental study of distortion-based techniques for association rule hiding, Proc. of the 18th Annual IFIP WG 11.3 Working Conf. on Data and Applications Security, (2004)
[9]  
Sun X., Yu P.S., A border-based approach for hiding sensitive frequent itemsets, Proc. of the 5th P IEEE Int'l Conf. on Data Mining (ICDM'05), pp. 426-433, (2005)
[10]  
David L., Handbook of Genetic Algorithms, (1991)