Privacy Preserving Association Rule Mining Using Binary Encoded NSGA-II

详细信息    查看全文

• 作者：Peng Cheng (11)
  Jeng-Shyang Pan (11)
  Chun-Wei Lin (11)
  
• 关键词：Privacy preserving data mining ; Association rule mining ; Evolutionary multi ; objective optimization ; EMO
• 刊名：Lecture Notes in Computer Science
• 出版年：2014
• 出版时间：2014
• 年：2014
• 卷：1
• 期：1
• 页码：87-99
• 全文大小：1,014 KB
• 参考文献：1. Verykios, V.S., Elmagarmid, A.K., et al.: Association rule hiding. IEEE Trans. Knowl. Data Eng. 16(4), 434鈥?47 (2004) CrossRef
  2. Atallah, M.B.E., Elmagarmid, A., Ibrahim, M., Verykios, V.S.: Disclosure limitation of sensitive rules. In: Proceedings of IEEE Workshop on Knowledge and Data Engineering Exchange, Chicago, IL, pp. 45鈥?2 (1999)
  3. Dasseni, E., Verykios, V.S., Elmagarmid, A.K., Bertino, E.: Hiding association rules by using confidence and support. In: Proceedings of the 4th International Workshop on Information Hiding, pp. 369鈥?83 (2001)
  4. Wu, Y.H., Chiang, C.C., Chen, A.L.P.: Hiding sensitive association rules with limited side effects. IEEE Trans. Knowl. Data Eng. 19(1), 29鈥?2 (2007) CrossRef
  5. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182鈥?97 (2002) CrossRef
  6. Amiri, A.: Dare to share: Protecting sensitive knowledge with data sanitization. Decis. Support Syst. 43(1), 181鈥?91 (2007) CrossRef
  7. Verykios, V.S.: Association rule hiding methods. Wiley Interdisc. Rev. Data Min. Knowl. Disc. 3(1), 28鈥?6 (2013) CrossRef
  8. Sun, X., Yu, P.S.: A border-based approach for hiding sensitive frequent itemsets. In: Proceedings of Fifth IEEE International Conference on Data Mining (ICDM 鈥?5), pp. 426鈥?33, (2005)
  9. Divanis, A.G., Verykios, V.S.: Exact knowledge hiding through database extension. IEEE Trans. Knowl. Data Eng. 21(5), 699鈥?13 (2009) CrossRef
  10. Hong, T.P., Lin, C.W., Yang, K.T., Wang, S.L.: Using TF-IDF to hide sensitive itemsets. Appl. Intell. 38(4), 502鈥?10 (2013) CrossRef
  11. Bleuler, S., Laumanns, M., Thiele, L., Zitzler, E.: PISA 鈥?a platform and programming language independent interface for search algorithms. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 494鈥?08. Springer, Heidelberg (2003) CrossRef
  12. Agrawal, R., Imielinski, T., Sawmi, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD Conference on Management of Data (SIGMOD), pp. 207鈥?16 (1993)
  13. Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: Proceedings of the International Conference on Very Large Data Bases (VLDB), pp. 487鈥?99 (1994)
  14. Bodon, F.: Surprising results of trie-based FIM algorithms. In: Proceedings of IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI 鈥?4), Brighton, UK (2004)
  15. Bodon, F.: A fast APRIORI implementation. In: IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI 鈥?3), Melbourne, Florida, USA (2003)
  
• 作者单位：Peng Cheng (11)
  Jeng-Shyang Pan (11)
  Chun-Wei Lin (11)
  
  11. Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen, 518055, People鈥檚 Republic of China
  
• ISSN：1611-3349

文摘

When people utilize data mining techniques to discover useful knowledge behind a large database; they also have the requirement to preserve some information so as not to be mined out, such as sensitive or private association rules, classification tree and the like. A feasible way to address this problem is to sanitize the database to conceal sensitive information. In this paper, we focus on privacy preserving in association rule mining. In light of the tradeoff within the side effects accompanying the hiding process, we tackle this problem from a point view of multi-objective optimization. A novel association rule hiding approach was proposed based on evolutionary multi-objective optimization (EMO) algorithm. The binary encoding scheme was adopted in the EMO algorithm. Three side effects, including sensitive rules not hidden, non-sensitive lost rules and spurious rules were formulated as objectives to be minimized. The NSGA II algorithm, a well established EMO algorithm, was utilized to find a suitable subset of transactions to modify by removing items so that the three side effects are minimized. Experiment results were reported to show the effectiveness of the proposed approach.