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

Reducing Side Effects of Hiding Sensitive Itemsets in Privacy Preserving Data Mining

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
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

Received 16 January 2014; Accepted 26 February 2014; Published 10 April 2014

Academic Editors: T. Cao and M. Ivanovic

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. Sawmi, “Mining association rules between sets of items in large databases,” ACM SIGMOD Record, vol. 22, no. 2, pp. 207–216, 1993, Proceedings of the ACM SIGMOD International Conference on Management of Data. View at Google Scholar
  2. 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
  3. 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, June1994.
  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, March 1995. View at Scopus
  7. H. Cheng, X. Yan, and J. Han, “IncSpan: incremental mining of sequential patterns in large database,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 527–532, August 2004. View at Scopus
  8. 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.
  9. 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.
  10. J. R. Quinlan, C4. 5: Programs for Machine Learning, Morgan Kaufmann Publishers, 1993.
  11. P. Berkhin, “A survey of clustering data mining techniques,” in Grouping Multidimensional Data, pp. 25–71, Springer, 2006. View at Google Scholar
  12. 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 Google Scholar · View at Scopus
  13. 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, vol. 3518 of Lecture Notes in Computer Science, pp. 689–695, Springer, 2005. View at Google Scholar
  14. C. Lin, T. Hong, and W. 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
  15. G. Lan, T. Hong, and V. S. Tseng, “Discovery of high utility itemsets from on-shelf time periods of products,” Expert Systems with Applications, vol. 38, no. 5, pp. 5851–5857, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. C. Lin, G. Lan, and T. 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. R. Agrawal and R. Srikant, “Privacy-preserving data mining,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 439–450, 2000.
  18. 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 Scopus
  19. M. Atallah, E. Bertino, A. Elmagarmid, M. Ibrahim, and V. Verykios, “Disclosure limitation of sensitive rules,” in Proceedings of the Workshop on Knowledge and Data Engineering Exchange, pp. 45–52, July 1999.
  20. 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, no. 4, pp. 201–227, 2013. View at Google Scholar
  21. 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
  22. D. E. O. Leary, “Knowledge discovery as a threat to database security,” in Knowledge Discovery in Databases, pp. 507–516, AAAI/MIT Press, 1991. View at Google Scholar
  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. S. R. M. Oliveira and O. R. Zaïane, “Protecting sensitive knowledge by data sanitization,” in Proceedings of the 3rd IEEE International Conference on Data Mining, pp. 613–616, November 2003. View at Scopus
  25. T. Hong, C. Lin, K. Yang, and S. Wang, “A lattice-based data sanitization approach,” in Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (SMC '11), pp. 2325–2329, October 2011. View at Publisher · View at Google Scholar · View at Scopus
  26. E. Dasseni, V. S. Verykios, A. K. Elmagarmid, and E. Bertino, “Hiding association rules by using confidence and support,” in Proceedings of the 2001 International Workshop on Information Hiding, pp. 369–383, 2001.
  27. K. Duraiswamy, D. Manjula, and N. Maheswari, “Advanced approach in sensitive rule hiding,” CCSE Modern Applied Science, vol. 3, no. 2, pp. 98–107, 2009. View at Google Scholar
  28. A. Gkoulalas-Divanis and V. S. Verykios, “Exact knowledge hiding through database extension,” IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 5, pp. 699–713, 2009. View at Publisher · View at Google Scholar · View at Scopus
  29. S. P. Patil and T. M. Patewar, “A novel approach for efficient mining and hiding of sensitive association rule,” in Proceedings of the 2012 Nirma University International Conference on Engineering, pp. 1–6, 2012.
  30. C. Wu, Y. Huang, and J. Chen, “Privacy preserving association rules by using greedy approach,” in Proceedings of the WRI World Congress on Computer Science and Information Engineering, vol. 4, pp. 61–65, April 2009. View at Publisher · View at Google Scholar · View at Scopus
  31. T. Hong, C. Lin, C. Chang, and S. Wang, “Hiding sensitive itemsets by inserting dummy transactions,” in Proceedings of the IEEE International Conference on Granular Computing (GrC '11), pp. 246–249, November 2011. View at Publisher · View at Google Scholar · View at Scopus
  32. 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 Google Scholar
  33. B. Dai and L. Chiang, “Hiding frequent patterns in the updated database,” in Proceedings of the International Conference in Information Science and Applications (ICISA '10), pp. 1–8, April 2010.
  34. Z. Zheng, R. Kohavi, and L. Mason, “Real world performance of association rule algorithms,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pp. 401–406, August 2001. View at Scopus
  35. IBM Quest Data Mining Project, “Quest synthetic data generation code,” http://www.almaden.ibm.com/cs/quest/syndata.html.