DP-PartFIM: Frequent Itemset Mining Using Differential Privacy and Partition

Itemset mining is a popular data mining technique for extracting interesting and valuable information from large datasets. However, since datasets contain sensitive private data, it is not permitted to directly mine the data or share the mining results. Previous privacy-preserving frequent itemset mining research was not efficient because of the use of privacy budgets or long transaction truncation strategies, which are impractical for large datasets. In this article, we propose a more efficient partition mining technology, DP-PartFIM, based on differential privacy, which protects privacy while mining data. DP-PartFIM uses partition mining to mine frequent itemsets and constructs vertical data storage formats for each partition, which makes the algorithm equally efficient for large datasets. To protect data privacy, DP-PartFIM adds Laplace noise to support candidate itemsets. The experimental results show that, compared with the classical privacy-preserving itemset mining methods, DP-PartFIM better guarantees data utility and privacy.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Emerging Topics in Computing
Published
2024-08-26
DOI
https://doi.org/10.1109/tetc.2024.3443060
Citations
7
Primary Topic
Data Mining Algorithms and Applications
Type
article
Field-Weighted Citation Impact
5.45

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DP-PartFIM: Frequent Itemset Mining Using Differential Privacy and Partition

Wensheng Gan, Lele Yu, Xinyu Liu, Yining Liu
7 citations
IEEE Transactions on Emerging Topics in Computing
Data Mining Algorithms and Applications
5.45
article

DP-PartFIM: Frequent Itemset Mining Using Differential Privacy and Partition

Wensheng Gan, Lele Yu, Xinyu Liu, Yining Liu
article en
7 citations

Abstract

Itemset mining is a popular data mining technique for extracting interesting and valuable information from large datasets. However, since datasets contain sensitive private data, it is not permitted to directly mine the data or share the mining results. Previous privacy-preserving frequent itemset mining research was not efficient because of the use of privacy budgets or long transaction truncation strategies, which are impractical for large datasets. In this article, we propose a more efficient partition mining technology, DP-PartFIM, based on differential privacy, which protects privacy while mining data. DP-PartFIM uses partition mining to mine frequent itemsets and constructs vertical data storage formats for each partition, which makes the algorithm equally efficient for large datasets. To protect data privacy, DP-PartFIM adds Laplace noise to support candidate itemsets. The experimental results show that, compared with the classical privacy-preserving itemset mining methods, DP-PartFIM better guarantees data utility and privacy.

IEEE Transactions on Emerging Topics in ComputingVol. 13(3)
Wenzhou University (CN), Jinan University (CN), Wenzhou University of Technology
National Natural Science Foundation of China
Openalex Percentile: Top 4%
Data Mining Algorithms and Applications
5.45
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

DP-PartFIM: Frequent Itemset Mining Using Differential Privacy and Partition — Wensheng Gan, Lele Yu, et al. · IEEE Transactions on Emerging Topics in Computing (2024) | TGRS Research Map | TGRS