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

A GA-Based Approach to Hide Sensitive High Utility Itemsets

1Innovative Information Industry Research Center, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen 518055, China
2Shenzhen Key Laboratory of Internet Information Collaboration, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen 518055, China
3Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung 811, Taiwan
4Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung 804, Taiwan
5Department of Mathematics and Computer Sciences, Fuqing Branch of Fujian Normal University, Fuzhou, Fujian 350300, China

Received 29 August 2013; Accepted 11 December 2013; Published 3 March 2014

Academic Editors: J. Shu and F. Yu

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, T. Imielinski, and A. Swami, “Database mining: a performance perspective,” IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 6, pp. 914–925, 1993. View at Publisher · View at Google Scholar · View at Scopus
  2. 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.
  3. R. Agrawal and R. Srikant, “Mining sequential patterns,” in Proceedings of the 1995 IEEE 11th International Conference on Data Engineering, pp. 3–14, March 1995. View at Scopus
  4. P. Berkhin, “A survey of clustering data mining techniques,” in Grouping Multidimensional Data, pp. 25–71, 2006. View at Google Scholar
  5. T. P. Hong, C. W. Lin, and Y. L. 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
  6. 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.
  7. C. W. Lin and T. P. Hong, “Temporal data mining with up-to-date pattern trees,” Expert Systems with Applications, vol. 38, no. 12, pp. 15143–15150, 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. C. W. Lin and T. P. Hong, “A new mining approach for uncertain databases using CUFP trees,” Expert Systems with Applications, vol. 39, no. 4, pp. 4084–4093, 2012. View at Publisher · View at Google Scholar · View at Scopus
  9. C. W. Lin and T. P. Hong, “A survey of fuzzy web mining,” Wiley Interdisciplinary Reviews, vol. 3, no. 3, pp. 190–199, 2013. View at Publisher · View at Google Scholar
  10. 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
  11. Y. Lindell and B. Pinkas, “Privacy preserving data mining,” in Proceedings of the Annual International Cryptology Conference on Advances in Cryptology, pp. 36–54, 2000.
  12. 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
  13. J. S. Yeh and P. C. Hsu, “HHUIF and MSICF: novel algorithms for privacy preserving utility mining,” Expert Systems with Applications, vol. 37, no. 7, pp. 4779–4786, 2010. View at Publisher · View at Google Scholar · View at Scopus
  14. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, Mass, USA; Longman, New York, NY, USA, 1989.
  15. J. H. Holland, Adaptation in Natural and Artificial Systems, MIT Press, Cambridge, Mass, USA, 1992.
  16. 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
  17. 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
  18. H. Yao and H. J. Hamilton, “Mining itemset utilities from transaction databases,” Data and Knowledge Engineering, vol. 59, no. 3, pp. 603–626, 2006. View at Publisher · View at Google Scholar · View at Scopus
  19. C. W. Lin, T. P. Hong, and W. H. Lu, “An effective tree structure for mining high utility itemsets,” Expert Systems with Applications, vol. 38, no. 6, pp. 7419–7424, 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. C. W. Lin, T. P. Hong, and W. H. Lu, “Using the structure of prelarge trees to incrementally mine frequent itemsets,” New Generation Computing, vol. 28, no. 1, pp. 5–20, 2010. View at Publisher · View at Google Scholar · View at Scopus
  21. C. W. Lin, T. P. Hong, W. H. Lu, and B. C. Chien, “Incremental mining with prelarge trees,” in New Frontiers in Applied Artificial Intelligence, vol. 5027 of Lecture Notes in Computer Science, pp. 169–178, 2008. View at Google Scholar
  22. C. W. Lin, T. P. Hong, and W. H. Lu, “Maintenance of the pre-large trees for record deletion,” in Advances in Numerical Methods, vol. 11 of Lecture Notes in Electrical Engineering, pp. 137–148, 2009. View at Google Scholar
  23. C. W. Lin, T. P. Hong, and W. H. Lu, “Efficient modification of fast updated FP-trees based on pre-large concepts,” International Journal of Innovative Computing, Information and Control, vol. 6, no. 11, pp. 5163–5177, 2010. View at Google Scholar · View at Scopus
  24. D. E. O'Leary, “Knowledge discovery as a threat to database security,” in Proceedings of the International Conference on Knowledge Discovery and Databases, pp. 507–516, 1991.
  25. 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, pp. 45–52, 1999.
  26. 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.
  27. 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
  28. C. W. Lin, T. P. Hong, C. C. Chang, and S. L. Wang, “A greedy-based approach for hiding sensitive itemsets by transaction insertion,” Journal of Information Hiding and Multimedia Signal Processing, vol. 4, pp. 201–227, 2013. View at Google Scholar
  29. R. Agrawal and R. Srikant, “Quest synthetic data generator,” 1994, http://www.Almaden.ibm.com/cs/quest/syndata.html.
  30. Microsoft, “Example database foodmart of microsoft analysis services,” http://msdn.microsoft.com/en-us/library/aa217032(SQL.80).aspx.