An Improved Sanitization Algorithm in Privacy-Preserving Utility Mining. (25th April 2020)

• Record Type: Journal Article
• Authors: Liu, Xuan; Chen, Genlang; Wen, Shiting; Song, Guanghui
• Other Names: Sun Qiuye Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2020(2020)
• Publication Date: 2020-04-25
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2020/7489045
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : High-utility pattern mining is an effective technique that extracts significant information from varied types of databases. However, the analysis of data with sensitive private information may cause privacy concerns. To achieve better trade-off between utility maximizing and privacy preserving, privacy-preserving utility mining (PPUM) has become an important research topic in recent years. The MSICF algorithm is a sanitization algorithm for PPUM. It selects the item based on the conflict count and identifies the victim transaction based on the concept of utility. Although MSICF is effective, the heuristic selection strategy can be improved to obtain a lower ratio of side effects. In our paper, we propose an improved sanitization approach named the Improved Maximum Sensitive Itemsets Conflict First Algorithm (IMSICF) to address this issue. It dynamically calculates conflict counts of sensitive items in the sanitization process. In addition, IMSICF chooses the transaction with the minimum number of nonsensitive itemsets and the maximum utility in a sensitive itemset for modification. Extensive experiments have been conducted on various datasets to evaluate the effectiveness of our proposed algorithm. The results show that IMSICF outperforms other state-of-the-art algorithms in terms of minimizing side effects on nonsensitive information. Moreover, the influence of correlation among itemsets on various sanitization algorithms' performance is observed.