To address the problems of low-quality candidate sets, severe noise accumulation and insufficient frequency estimation accuracy of existing frequent itemset mining methods under local differential privacy for high-dimensional sparse data, a two-stage adaptive perturbation algorithm was proposed. With the domain-adaptive perturbation method, the high-precision mining mechanism of frequent itemsets in high-dimensional sparse scenarios was investigated. The experimental results show that dynamically selecting perturbation mechanisms in the candidate generation stage can effectively reduce the noise of initial candidates and improve the quality of prefix filtering; adaptively selecting mechanisms according to subdomain size in the frequency estimation stage can significantly suppress local variance and optimize global frequency reconstruction. Experiments on four real-world datasets demonstrate that the proposed algorithm outperforms existing methods in frequency estimation accuracy, frequent item discovery capability and operational efficiency. On highly sparse datasets, the Precision and Recall are each improved by up to 15%. It can be concluded that the proposed two-stage adaptive perturbation algorithm can significantly boost the frequent itemset mining performance on high-dimensional sparse datasets while guaranteeing local differential privacy.
BehradF, AbadehM S. An overview of deep learning methods for multimodal medical data mining[J]. Expert Systems with Applications, 2022, 200: 117006.
[2]
GuoZ W, WangH. A deep graph neural network-based mechanism for social recommendations[J]. IEEE Transactions on Industrial Informatics, 2021, 17: 2776-2783.
[3]
DavashiR. ITUFP: a fast method for interactive mining of top-k frequent patterns from uncertain data[J]. Expert Systems with Applications, 2023, 214: 119156.
[4]
HeJ X, HanX X, WangJ B, et al. Efficient high-utility occupancy itemset mining algorithm on massive data[J]. Expert Systems with Applications, 2022, 210: 118329.
[5]
KaracaM, AlvaradoM M, GahrooeiM R, et al. Frequent pattern mining from multivariate time series data[J]. Expert Systems with Applications, 2022, 194: 116435.
[6]
AbdelaalA A, AbedS, Al-shayejiM, et al. Customized frequent patterns mining algorithms for enhanced top-rank-k frequent pattern mining[J]. Expert Systems with Applications, 2021, 169: 114530.
[7]
DenhamB, PearsR, NaeemM A. Enhancing random projection with independent and cumulative additive noise for privacy-preserving data stream mining[J]. Expert Systems with Applications, 2020, 152: 113380.
[8]
DrissK, BoulilaW, LeborgneA, et al. Mining frequent approximate patterns in large networks[J]. International Journal of Imaging Systems and Technology, 2021, 31: 1265-1279.
ZhaoChanchan, MaKunming, ShiBao, et al. Adaptive privacy protection scheme for federated learning based on differential privacy[J]. Science Technology and Engineering, 2025, 25(7): 2849-2855.
[11]
DworkC. Differential privacy[C]//Proceedings of the 33rd International Colloquium on Automata, Languages and Programming. Venice: Springer, 2006: 1-12.
[12]
LiuJ J, HuY, GuoX J, et al. Differential privacy performance evaluation under the condition of non-uniform noise distribution[J]. Journal of Information Security and Applications, 2022, 71: 103366.
[13]
CACMStaff. Differential privacy: the pursuit of protections by default[J]. Communications of the ACM, 2021, 64: 36-43.
[14]
VelliangiriS, PremalathaJ. Intrusion detection of distributed denial of service attack in cloud[J]. Cluster Computing, 2019, 22: 10615-10623.
[15]
KairouzP, OhS, ViswanathP. Extremal mechanisms for local differential privacy[J]. Journal of Machine Learning Research, 2016, 17: 1-51.
[16]
XiongX X, LiuS B, LiD, et al. Real-time and private spatio-temporal data aggregation with local differential privacy[J]. Journal of Information Security and Applications, 2020, 55: 102633.
[17]
ZhaoD, ZhaoS Y, ChenH, et al. Efficient protocols for heavy hitter identification with local differential privacy[J]. Frontiers of Computer Science, 2022, 16: 165825.
[18]
QinZ, YangY, YuT, et al. Heavy hitter estimation over set-valued data with local differential privacy[C]//Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. Vienna: ACM, 2016: 192-203.
[19]
WangT H, LiN H, JhaS. Locally differentially private frequent itemset mining[C]//Proceedings of the 2018 IEEE Symposium on Security and Privacy. San Francisco: IEEE, 2018: 127-143.
[20]
LiJ H, GanW S, GuiY J, et al. Frequent itemset mining with local differential privacy[C]//Proceedings of the 31st ACM International Conference on Information & Knowledge Management. Atlanta: ACM, 2022: 1146-1155.
[21]
HuangY X, XueK P, ZhuB, et al. Joint distribution analysis for set-valued data with local differential privacy[J]. IEEE Transactions on Information Forensics and Security, 2024, 19: 10584565.
[22]
DongK, ZhangZ, JiaC, et al. Relation mining under local differential privacy[C]//Proceedings of the 33rd USENIX Security Symposium. Philadelphia: USENIX Association, 2024: 955-972.
WangQingguo, LiuLulu, JiaXiaofan, et al. Location privacy protection method for Internet of vehicles based on relationship strength[J]. Science Technology and Engineering, 2024, 24(2): 684-689.
WangShengjie, ZhangQinghong. Density weight based privacy clustering and improved similarity recommendation algorithms[J]. Science Technology and Engineering, 2024, 24(29): 12623-12630.
[27]
ChenW J, ChenH Y, HanT X, et al. Secure two-party frequent itemset mining with guaranteeing differential privacy[J]. IEEE Transactions on Mobile Computing, 2025, 24(1): 276-292.
YeQingqing, MengXiaofeng, ZhuMinjie, et al. Survey on local differential privacy[J]. Journal of Software, 2018, 29(7): 1981-2005.
[30]
ZhouY H, WangW L, YanJ, et al. Optimization of binary randomized response based on Lanke privacy and utility analysis[J]. Chinese Journal of Electronics, 2025, 34(1): 242-256.
[31]
WangT, ZhangX F, FengJ Y, et al. A comprehensive survey on local differential privacy toward data statistics and analysis[J]. Sensors, 2020, 20(24): 7030-7078.
[32]
WangT H, BlockiJ, LiN H, et al. Optimizing locally differentially private protocols[C]//Proceedings of the 26th USENIX Security Symposium (USENIX Security 17). Vancouver: USENIX Association, 2017: 729-745.
[33]
ZhuY W, CaoY R, XueQ, et al. Heavy hitter identification over large-domain set-valued data with local differential privacy[J]. IEEE Transactions on Information Forensics and Security, 2024, 19: 414-426.