Swapping-based Data Sanitization Method for Hiding Sensitive Frequent Itemset in Transaction Database

被引:0
|
作者
Gunawan, Dedi [1 ]
Nugroho, Yusuf Sulistyo [1 ]
Maryam [1 ]
机构
[1] Univ Muhammadiyah Surakarta, Informat Engn Dept, Surakarta, Indonesia
关键词
Transaction database; data sanitization; data mining; sensitive frequent itemset; swapping-based method; FAST ALGORITHMS; PRIVACY;
D O I
10.14569/IJACSA.2021.0121179
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Sharing a transaction database with other parties for exploring valuable information becomes more recognized by business institutions, i.e., retails and supermarkets. It offers various benefits for the institutions, such as finding customer shopping behavior and frequently bought items, known as frequent itemsets. Due to the importance of such information, some institutions may consider certain frequent itemsets as sensitive information that should be kept private. Therefore, prior to handling a database, the institutions should consider privacy preserving data mining (PPDM) techniques for preventing sensitive information breaches. Presently, several PPDM methods, such as item suppression-based methods and item insertion-based methods have been developed. Unfortunately, the methods result in significant changes to the database and induce some side effects such as hiding failure, significant data dissimilarity, misses cost, and artificial frequent itemset occurrence. In this paper, we propose a swapping-based data sanitization method that can hide the sensitive frequent itemset while at the same time it can minimize the side effects of the data sanitization process. Experimental results indicate that the proposed method outperforms existing methods in terms of minimizing the side effects.
引用
收藏
页码:693 / 701
页数:9
相关论文
共 50 条
  • [21] Review of Apriori based Frequent Itemset Mining Solutions on Big Data
    Fard, Mohammad Javad Shayegan
    Namin, Parsa Asgari
    2020 6TH INTERNATIONAL CONFERENCE ON WEB RESEARCH (ICWR), 2020, : 157 - 164
  • [22] GMiner: A fast GPU-based frequent itemset mining method for large-scale data
    Chon, Kang-Wook
    Hwang, Sang-Hyun
    Kim, Min-Soo
    INFORMATION SCIENCES, 2018, 439 : 19 - 38
  • [23] Privacy Protection Using Sensitive Data Protection Algorithm In Frequent Itemset Mining Of Medical Datasets
    Dheepa, R.
    Nandini, D. Usha
    RESEARCH JOURNAL OF PHARMACEUTICAL BIOLOGICAL AND CHEMICAL SCIENCES, 2016, 7 (04): : 308 - 316
  • [24] FlashGhost: Data Sanitization with Privacy Protection Based on Frequent Colliding Hash Table
    Zhu, Yan
    Yang, Shuai
    Chu, William Cheng-Chung
    Feng, Rongquan
    2019 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING (IEEE SCC 2019), 2019, : 90 - 99
  • [25] Hiding Sensitive Association Rules to Maintain Privacy and Data Quality in Database
    Domadiya, Nikunj H.
    Rao, Udai Pratap
    PROCEEDINGS OF THE 2013 3RD IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE (IACC), 2013, : 1306 - 1310
  • [26] An Efficient Frequent Itemset Mining Method over High-speed Data Streams
    Memar, Mina
    Deypir, Mahmood
    Sadreddini, Mohammad Hadi
    Fakhrahmad, Seyyed Mostafa
    COMPUTER JOURNAL, 2012, 55 (11): : 1357 - 1366
  • [27] A border-based integer programming approach for hiding sensitive frequent itemsets
    Wang, Mingzheng
    He, Yue
    Han, Haishan
    ICIC Express Letters, 2013, 7 (3 B): : 1073 - 1080
  • [28] Hiding Sensitive High Utility and Frequent Itemsets Based on Constrained Intersection Lattice
    Huynh Trieu Vy
    Le Quoc Hai
    Nguyen Thanh Long
    Truong Ngoc Chau
    Le Quoc Hieu
    CYBERNETICS AND INFORMATION TECHNOLOGIES, 2022, 22 (01) : 3 - 23
  • [29] Hiding Association Rules based on Relative-non-sensitive Frequent Itemsets
    Li, Xueming
    Liu, Zhijun
    Zuo, Chuan
    PROCEEDINGS OF THE 8TH IEEE INTERNATIONAL CONFERENCE ON COGNITIVE INFORMATICS, 2009, : 384 - +
  • [30] The GA-based algorithms for optimizing hiding sensitive itemsets through transaction deletion
    Lin, Chun-Wei
    Hong, Tzung-Pei
    Yang, Kuo-Tung
    Wang, Leon Shyue-Liang
    APPLIED INTELLIGENCE, 2015, 42 (02) : 210 - 230