Hiding the Sensitive Itemsets through the Ordered Sensitive Transactions Deletion via Multi-Objective Genetic Algorithms

Authors

1 Faculty of Engineering, Isfahan (Khorasgan) Branch, Islamic Azad University, Isfahan, Iran

2 Faculty of Computer Engineering, Shahrekord Branch, Islamic Azad University, Shahrekord, Iran

Abstract

Association rules are used to find hidden relationships and dependencies among different itemsets in the database that is extracted in the form of the rule, but the problem with this approach is the discovery of sensitive information and the treatment of information privacy. The sanitization process data is considered as a NPHard problem. In this article, we try to reduce support the sensitive itemsets in the transactional database using multi-objective genetic algorithms and the support-based approach. The proposed approach with the transaction deletion that includes sensitive itemsets leads to less support sensitive itemsets than the minimum support threshold and leads to the database sanitization. In each iteration of our method leads to increase the speed and reduce the performance criteria by one time of the scanning of the sensitive transaction instead of scanning the entire database of transactions. In addition, to reduce the effects of hiding the sensitive itemsets, the transactions sort based on the shortest length, the most sensitive itemsets and the least non-sensitive itemsets.

Keywords

References

[1] C. C. Aggarwal and S. Y. Philip, "A general survey of privacy-preserving data mining models and algorithms," Privacy-preserving data mining, pp. 11-52, 2008.
[2] R. Agrawal and R. Srikant, "Privacy-preserving data mining," in ACM Sigmod Record, vol. 29, no. 2, pp. 439-450, 2000.
[3] Y. Lindell and B. Pinkas, "Privacy preserving data mining," in Annual International Cryptology Conference, pp. 36-54, 2000.
[4] محمدعلی زارع چاهوکی، سید حمیدرضا محمدی, «بهینه‌سازی هسته‌های چندگانه در ماشین‌بردارپشتیبان جفتی برای کاهش شکاف معنایی تشخیص صفحات فریب‌آمیز», مجله مهندسی برق دانشگاه تبریز، دوره 46، شماره 4، ص. 135-145، 1395.
[5] مجید محمدپور، حمید پروین, «الگوریتم ژنتیک آشوب گونه مبتنی بر حافظه و خوشه بندی برای حل مسائل بهینه سازی پویا», مجله مهندسی برق دانشگاه تبریز، دوره 46، شماره 3، ص. 299-318، 1395.
[6]  مرتضی به‌نام، حسین پورقاسم, «شناسایی صرع بر اساس بهینه‌سازی ویژگی‌های ادغامی تبدیل هارتلی با مدل ترکیبی MLP و GA  همراه با استراتژی یادگیری ممتیک», مجله مهندسی برق دانشگاه تبریز، دوره 45، شماره 4، ص. 51-67، 1394.
[7] M. Atallah, E. Bertino, A. Elmagarmid, M. Ibrahim, and V. Verykios, "Disclosure limitation of sensitive rules," In: Proceedings of the 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX'99), pp. 45-52, 1999.
[8] E. Dasseni, V. S. Verykios, A. K. Elmagarmid, and E. Bertino, "Hiding association rules by using confidence and support," in International Workshop on Information Hiding, pp. 369-383, 2001.
[9] Y. Saygin, V. S. Verykios, and C. Clifton, "Using unknowns to prevent discovery of association rules," Acm Sigmod Record, vol. 30, no. 4, pp. 45-54, 2001.
[10] Y. Saygin, V. S. Verykios, and A. K. Elmagarmid, "Privacy preserving association rule mining," In: Proceedings of 12th International Workshop on Research Issues in Data Engineering: Engineering E-Commerce/E-Business Systems, pp. 151-158, 2002.
[11] V. S. Verykios, A. K. Elmagarmid, E. Bertino, Y. Saygin, and E. Dasseni, "Association rule hiding," IEEE Transactions on knowledge and data engineering, vol. 16, no. 4, pp. 434-447, 2004.
[12] A. Amiri, "Dare to share: Protecting sensitive knowledge with data sanitization," Decision Support Systems, vol. 43, no. 1, pp. 181-191, 2007.
[13] C. N. Modi, U. P. Rao, and D. R. Patel, "Maintaining privacy and data quality in privacy preserving association rule mining," In: Proceedings of International Conference on Computing Communication and Networking Technologies (ICCCNT), pp. 1-6, 2010.
[14] K. Shah, A. Thakkar, and A. Ganatra, "Association rule hiding by heuristic approach to reduce side effects & hide multiple RHS items," International Journal of Computer Applications, vol. 45, no. 1, pp. 1-7, 2012.
[15] N. H. Domadiya and U. P. Rao, "Hiding sensitive association rules to maintain privacy and data quality in database," In: Proceedings of 3rd International Advance Computing Conference (IACC), pp. 1306-1310, 2013.
[16] زهرا کیانی ابری، محمد نادری دهکردی, «الگوریتمی اکتشافی برای پنهان سازی مجموعه عناصر حساس», دومین همایش ملی علوم و مهندسی کامپیوتر، کامپیوتر، دانشکده مهندسی کامپیوتر، دانشگاه آزاد اسلامی نجف آباد, 1393.
[17] [17] حامد ارشادی‌پور، سید مجید مزینانی, «ارائه‌ی یک روش بهبود یافته جهت مخفی سازی قوانین انجمنی حساس در داده کاوی», اولین کنفرانس سراسری توسعه محوری مهندسی عمران، معماری، برق و مکانیک ایران، گرگان، دانشگاه گلستان،, 1393.
[18] P. Cheng, J. F. Roddick, S.-C. Chu, and C.-W. Lin, "Privacy preservation through a greedy, distortion-based rule-hiding method," Applied Intelligence, vol. 44, no. 2, pp. 295-306, 2016.
[19] N. H. Domadiya and U. P. Rao, "A Hybrid Technique for Hiding Sensitive Association Rules and Maintaining Database Quality," In: Proceedings of First International Conference on Information and Communication Technology for Intelligent Systems: Vol. 2, pp. 359-367, 2016.
[20] X. Sun and P. S. Yu, "A border-based approach for hiding sensitive frequent itemsets," In: Proceedings of Fifth IEEE International Conference on Data Mining (ICDM), p. 8, 2005.
[21] G. V. Moustakides and V. S. Verykios, "A MaxMin approach for hiding frequent itemsets," Data & Knowledge Engineering, vol. 65, no. 1, pp. 75-89, 2008.
[22] S. Menon, S. Sarkar, and S. Mukherjee, "Maximizing accuracy of shared databases when concealing sensitive patterns," Information Systems Research, vol. 16, no. 3, pp. 256-270, 2005.
[23] 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.
[24] 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.
[25] C.-W. Lin, T.-P. Hong, K.-T. Yang, and S.-L. Wang, "The GA-based algorithms for optimizing hiding sensitive itemsets through transaction deletion," Applied Intelligence, vol. 42, no. 2, pp. 210-230, 2015.
[26] C.-W. Lin, B. Zhang, K.-T. Yang, and T.-P. Hong, "Efficiently hiding sensitive itemsets with transaction deletion based on genetic algorithms," The Scientific World Journal, vol. 2014, 2014.
[27] P. Cheng, J.-S. Pan, and C.-W. L. Harbin, "Use EMO to protect sensitive knowledge in association rule mining by removing items," In: Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp. 1108-1115, 2014.
[28] فرشاد شهسواری،  محمد نادری دهکردی, ارائه روشی بهینه برای مخفی کردن مجموعه عناصر حساس مبتنی بر الگوریتم ژنتیک, پایان‌نامه کارشناسی ارشد، دانشگاه آزاد اسلامی نجف‌آباد، 1394.
[29] M. H. Afshari, M. N. Dehkordi, and M. Akbari, "Association rule hiding using cuckoo optimization algorithm," Expert Systems with Applications, vol. 64, pp. 340-351, 2016.
[30] J. C.-W. Lin, Q. Liu, P. Fournier-Viger, T.-P. Hong, M. Voznak, and J. Zhan, "A sanitization approach for hiding sensitive itemsets based on particle swarm optimization," Engineering Applications of Artificial Intelligence, vol. 53, pp. 1-18, 2016.
[31] P. Cheng, I. Lee, C.-W. Lin, and J.-S. Pan, "Association rule hiding based on evolutionary multi-objective optimization," Intelligent Data Analysis, vol. 20, no. 3, pp. 495-514, 2016.
[32] 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.
[33] T.-P. Hong and C.-Y. Wang, "Maintenance of association rules using pre-large itemsets," Intelligent databases: technologies and applications, pp. 44-60, 2007.
[34] 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, no. 2, pp. 111-129, 2001.
[35] J. E. Beasley and P. C. Chu, "A genetic algorithm for the set covering problem," European journal of operational research, vol. 94, no. 2, pp. 392-404, 1996.
[36] E. Cantú-Paz, "A survey of parallel genetic algorithms," in Calculateurs paralleles, 1998.
[37] N. N. Lakhan, "on multi-objective linear and non-linear programming," University of the South Pacific, 2015.
[38] K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II," IEEE transactions on evolutionary computation, vol. 6, no. 2, pp. 182-197, 2002.

Files

Share

How to cite

Statistics