Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 398269, 13 pages
http://dx.doi.org/10.1155/2014/398269
Research Article

Efficiently Hiding Sensitive Itemsets with Transaction Deletion Based on Genetic Algorithms

1Innovative Information Industry Research Center (IIIRC), School of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen 518055, China
2Shenzhen Key Laboratory of Internet Information Collaboration, School of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen 518055, China
3Medical School, Shenzhen University, Shenzhen 518060, China
4Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung 811, Taiwan
5Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung 804, Taiwan

Received 28 May 2014; Revised 7 August 2014; Accepted 8 August 2014; Published 1 September 2014

Academic Editor: Shifei Ding

Copyright © 2014 Chun-Wei Lin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Agrawal and R. Srikant, “Fast algorithms for mining association rules in large databases,” in Proceedings of the International Conference on Very Large Data Bases, pp. 487–499, 1994.
  2. T. F. Gharib, H. Nassar, M. Taha, and A. Abraham, “An efficient algorithm for incremental mining of temporal association rules,” Data and Knowledge Engineering, vol. 69, no. 8, pp. 800–815, 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. 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, no. 1, pp. 53–87, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. T. Hong, C. Lin, and Y. Wu, “Incrementally fast updated frequent pattern trees,” Expert Systems with Applications, vol. 34, no. 4, pp. 2424–2435, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. C.-W. Lin, T.-P. Hong, and W.-H. Lu, “The Pre-FUFP algorithm for incremental mining,” Expert Systems with Applications, vol. 36, no. 5, pp. 9498–9505, 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. R. Agrawal and R. Srikant, “Mining sequential patterns,” in Proceedings of the IEEE 11th International Conference on Data Engineering, pp. 3–14, San Jose, Calif, USA, March 1995. View at Scopus
  7. C. Kim, J. Lim, R. T. Ng, and K. Shim, “SQUIRE: sequential pattern mining with quantities,” Journal of Systems and Software, vol. 80, no. 10, pp. 1726–1745, 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. J. Pei, J. Han, B. Mortazavi-Asl et al., “Mining sequential patterns by pattern-growth: The prefixspan approach,” IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 11, pp. 1424–1440, 2004. View at Publisher · View at Google Scholar · View at Scopus
  9. R. Srikant and R. Agrawal, “Mining sequential patterns: generalizations and performance improvements,” in Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology, pp. 3–17, 1996.
  10. S. B. Kotsiantis, “Supervised machine learning: a review of classification techniques,” in Proceedings of the Conference on Emerging Artificial Intelligence Applications in Computer Engineering: Real Word AI Systems with Applications in eHealth, HCI, Information Retrieval and Pervasive Technologies, pp. 3–24, 2007.
  11. J. R. Quinlan, “Induction of decision trees,” Machine Learning, vol. 1, no. 1, pp. 81–106, 1986. View at Publisher · View at Google Scholar · View at Scopus
  12. J. R. Quinlan, C4.5: Programs for Machine Learning, Morgan Kaufmann, 1993.
  13. P. Berkhin, “A survey of clustering data mining techniques,” in Grouping Multidimensional Data, pp. 25–71, 2006. View at Google Scholar
  14. R. A. Jarvis and E. A. Patrick, “Clustering using a similarity measure based on shared near neighbors,” IEEE Transactions on Computers, vol. 22, no. 11, pp. 1025–1034, 1973. View at Publisher · View at Google Scholar · View at Scopus
  15. R. Chan, Q. Yang, and Y.-D. Shen, “Mining high utility itemsets,” in Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM '03), pp. 19–26, November 2003. View at Publisher · View at Google Scholar · View at Scopus
  16. C. W. Lin, G. C. Lan, and T. P. Hong, “An incremental mining algorithm for high utility itemsets,” Expert Systems with Applications, vol. 39, no. 8, pp. 7173–7180, 2012. View at Publisher · View at Google Scholar · View at Scopus
  17. Y. Liu, W. K. Liao, and A. Choudhary, “A two-phase algorithm for fast discovery of high utility itemsets,” in Advances in Knowledge Discovery and Data Mining, pp. 689–695, 2005. View at Google Scholar
  18. U. Yuna, H. Ryanga, and K. H. Ryub, “High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates,” Expert Systems with Applications, vol. 41, pp. 3861–3878, 2014. View at Google Scholar
  19. R. Agrawal and R. Srikant, “Privacy-preserving data mining,” SIGMOD Record, vol. 29, no. 2, pp. 439–450, 2000. View at Google Scholar · View at Scopus
  20. Y. Lindell and B. Pinkas, “Privacy preserving data mining,” in Advances in Cryptology—CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20–24, 2000, vol. 1880 of Lecture Notes in Computer Science, pp. 36–54, 2000. View at Publisher · View at Google Scholar
  21. S. M. Oliveira, O. Zaïane, and Y. Saygin, “Secure association rule sharing,” Advances in Knowledge Discovery and Data Mining, vol. 3056, pp. 74–85, 2004. View at Google Scholar
  22. 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, vol. 33, no. 1, pp. 50–57, 2004. View at Publisher · View at Google Scholar · View at Scopus
  23. A. Amiri, “Dare to share: protecting sensitive knowledge with data sanitization,” Decision Support Systems, vol. 43, no. 1, pp. 181–191, 2007. View at Publisher · View at Google Scholar · View at Scopus
  24. M. Atallah, A. Elmagarmid, M. Ibrahim, E. Bertino, and V. Verykios, “Disclosure limitation of sensitive rules,” in Proceedings of the Workshop on Knowledge and Data Engineering Exchange (KDEX '99), pp. 45–52, Chicago, Ill, USA, November 1999. View at Publisher · View at Google Scholar
  25. A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke, “Privacy preserving mining of association rules,” in Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '02), pp. 217–228, July 2002. View at Scopus
  26. Y. Wu, C. Chiang, and A. L. P. Chen, “Hiding sensitive association rules with limited side effects,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 1, pp. 29–42, 2007. View at Publisher · View at Google Scholar · View at Scopus
  27. C. C. Aggarwal, J. Pei, and B. Zhang, “On privacy preservation against adversarial data mining,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 510–516, August 2006. View at Scopus
  28. J. H. Holland, Adaptation in Natural and Artificial Systems, MIT Press, 1992. View at MathSciNet
  29. G. R. Harik, F. G. Lobo, and D. E. Goldberg, “The compact genetic algorithm,” IEEE Transactions on Evolutionary Computation, vol. 3, no. 4, pp. 287–297, 1999. View at Publisher · View at Google Scholar · View at Scopus
  30. T. P. Hong and C. Y. Wang, “Maintenance of association rules using pre-large itemsets,” in Intelligent Databases: Technologies and Applications, pp. 44–60, 2007. View at Google Scholar
  31. T. P. Hong, C. Y. Wang, and Y. H. Tao, “A new incremental data mining algorithm using pre-large itemsets,” Intelligent Data Analysis, vol. 5, pp. 111–129, 2001. View at Google Scholar
  32. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman, 1989.
  33. X. Wang, Q. He, D. Chen, and D. Yeung, “A genetic algorithm for solving the inverse problem of support vector machines,” Neurocomputing, vol. 68, no. 1–4, pp. 225–238, 2005. View at Publisher · View at Google Scholar · View at Scopus
  34. M. Chen, J. Han, and P. S. Yu, “Data mining: an overview from a database perspective,” IEEE Transactions on Knowledge and Data Engineering, vol. 8, no. 6, pp. 866–883, 1996. View at Publisher · View at Google Scholar · View at Scopus
  35. M. Mohamed and M. Darwieesh, “Efficient mining frequent itemsets algorithms,” International Journal of Machine Learning and Cybernetics, 2013. View at Publisher · View at Google Scholar
  36. B. Nath, D. K. Bhattacharyya, and A. Ghosh, “Incremental association rule mining: a survey,” Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, vol. 3, no. 3, pp. 157–169, 2013. View at Publisher · View at Google Scholar · View at Scopus
  37. B. Vo, T. Le, F. Coenen, and T.-P. Hong, “Mining frequent itemsets using the n-list and subsume concepts,” International Journal of Machine Learning and Cybernetics, 2014. View at Publisher · View at Google Scholar
  38. E. Bertino, D. Lin, and W. Jiang, “A survey of quantification of privacy preserving data mining algorithms,” in Privacy-Preserving Data Mining, C. Aggarwal and P. Yu, Eds., vol. 34, pp. 183–205, Springer, New York, NY, USA, 2008. View at Google Scholar
  39. S. R. M. Oliveira and O. R. Zaïane, “Privacy preserving frequent itemset mining,” in Proceedings of the IEEE International Conference on Privacy, Security and Data Mining, pp. 43–54, 2002.
  40. E. Dasseni, V. S. Verykios, A. K. Elmagarmid, and E. Bertino, “Hiding association rules by using confidence and support,” in Proceedings of the International Workshop on Information Hiding, pp. 369–383, 2001.
  41. T. P. Hong, C. W. Lin, K. T. Yang, and S. L. Wang, “Using TF-IDF to hide sensitive itemsets,” Applied Intelligence, vol. 38, no. 4, pp. 502–510, 2013. View at Publisher · View at Google Scholar
  42. S. Han and W. Ng, “Privacy-preserving genetic algorithms for rule discovery,” in Data Warehousing and Knowledge Discovery, I. Song, J. Eder, and T. Nguyen, Eds., vol. 4654, pp. 407–417, Springer, Berlin, Germany, 2007. View at Google Scholar
  43. M. N. Dehkordi, K. Badie, and A. K. Zadeh, “A novel method for privacy preserving in association rule mining based on genetic algorithms,” Journal of Software, vol. 4, no. 6, pp. 555–562, 2009. View at Google Scholar · View at Scopus
  44. D. W. Cheung, J. Han, V. T. Ng, and C. Y. Wong, “Maintenance of discovered association rules in large databases: an incremental updating technique,” in Proceedings of the IEEE 12th International Conference on Data Engineering, pp. 106–114, March 1996. View at Scopus
  45. D. W. L. Cheung, S. D. Lee, and B. Kao, “A general incremental technique for maintaining discovered association rules,” in Proceedings of the International Conference on Database Systems for Advanced Applications, pp. 185–194, 1997.
  46. T. Hong, I. Yang, C. Lin, and S. Wang, “Evolutionary privacy-preserving data mining,” in Proceedings of the World Automation Congress (WAC "10), pp. 1–7, September 2010. View at Scopus
  47. Frequent itemset mining dataset repository, 2012, http://fimi.ua.ac.be/data/.
  48. Z. Zheng, R. Kohavi, and L. Mason, “Real world performance of association rule algorithms,” in Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '01), pp. 401–406, San Francisco, Calif, USA, August 2001. View at Scopus