• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

在多云环境中使用事务挖掘器分配器和简易哈希算法挖掘隐私保护关联规则。

Mining privacy-preserving association rules using transaction hewer allocator and facile hash algorithm in multi-cloud environments.

作者信息

Dhinakaran D, Gopalakrishnan S, Selvaraj D, Girija M S, Prabaharan G

机构信息

Department of Computer Science and Engineering, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Chennai, India.

Department of Computer Science & Engineering (Data Science), Madanapalle Institute of Technology & Science, Andhra Pradesh, India.

出版信息

MethodsX. 2025 Apr 17;14:103317. doi: 10.1016/j.mex.2025.103317. eCollection 2025 Jun.

DOI:10.1016/j.mex.2025.103317
PMID:40331027
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC12054012/
Abstract

In this era of data-driven decision-making, it is important to securely and efficiently extract knowledge from distributed datasets. However, in outsourced data for tasks like frequent itemset mining, privacy is an important issue. The difficulty is to secure sensitive data while delivering the insights of the data. First, this paper proposes a new multi-cloud approach to preserve privacy, which includes two main components, named the Transaction Hewer and Allocator module and the Facile Hash Algorithm (FHA), in extracting the frequent itemset. All these components work together to protect the privacy of the data, wherever it is, during the transmission phase or the computation phase, even if it is raw data or processed data, on the different distributed cloud platforms. The complexities involved in the mining of frequent itemsets led us to introduce the Apriori with Tid Reduction (ATid) algorithm considering scalability and computational operational improvements to the mining process due to the Tid Reduction concept. We conduct performance evaluation on several datasets and show that our proposed framework achieves higher performance than existing methods, and encryption and decryption processes reduce the computational time by up to 25 % compared to the best alternative. It also exhibits approximately 15 % reduction in communication costs and displays scalability with the growing number of transactions, compared to the state-of-the-art evaluation metrics that indicate improved communication overhead.•Introduces a multi-cloud privacy framework with Facile Hash Algorithm and Transaction Hewer and Allocator.•Enhances scalability using ATid algorithm with Tid Reduction.

摘要

在这个数据驱动决策的时代,从分布式数据集中安全、高效地提取知识非常重要。然而,在诸如频繁项集挖掘等外包数据任务中,隐私是一个重要问题。难点在于在提供数据洞察的同时保护敏感数据。首先,本文提出了一种新的多云方法来保护隐私,该方法在提取频繁项集时包括两个主要组件,即事务挖掘器和分配器模块以及简易哈希算法(FHA)。所有这些组件协同工作,以保护数据在传输阶段或计算阶段的隐私,无论数据位于何处,即使是原始数据或已处理数据,在不同的分布式云平台上也是如此。频繁项集挖掘中涉及的复杂性促使我们引入带事务ID约简的Apriori(ATid)算法,考虑到事务ID约简概念对挖掘过程的可扩展性和计算操作的改进。我们在几个数据集上进行了性能评估,结果表明我们提出的框架比现有方法具有更高的性能,并且加密和解密过程与最佳替代方法相比,计算时间最多可减少25%。与表明通信开销有所改善的最新评估指标相比,它还显示出通信成本降低了约15%,并且随着事务数量的增加展现出可扩展性。

• 引入了带有简易哈希算法以及事务挖掘器和分配器的多云隐私框架。

• 使用带事务ID约简的ATid算法增强可扩展性。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/997f7e9ef842/gr11.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/0d65997774d6/ga1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/c00cf755fc3c/gr1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/660b0e38930a/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/82a8019d2f52/gr3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/f76608358aa5/gr4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/340b0e4ee100/gr5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/6f7c0e677931/gr6.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/f1d1e517cca5/gr7.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/28fd2fcc9b18/gr8.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/1abe2c499771/gr9.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/527f99527c19/gr10.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/997f7e9ef842/gr11.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/0d65997774d6/ga1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/c00cf755fc3c/gr1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/660b0e38930a/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/82a8019d2f52/gr3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/f76608358aa5/gr4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/340b0e4ee100/gr5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/6f7c0e677931/gr6.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/f1d1e517cca5/gr7.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/28fd2fcc9b18/gr8.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/1abe2c499771/gr9.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/527f99527c19/gr10.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4e86/12054012/997f7e9ef842/gr11.jpg

相似文献

1
Mining privacy-preserving association rules using transaction hewer allocator and facile hash algorithm in multi-cloud environments.在多云环境中使用事务挖掘器分配器和简易哈希算法挖掘隐私保护关联规则。
MethodsX. 2025 Apr 17;14:103317. doi: 10.1016/j.mex.2025.103317. eCollection 2025 Jun.
2
Diagnosis of coronary artery disease using an efficient hash table based closed frequent itemsets mining.使用基于高效哈希表的封闭频繁项集挖掘技术诊断冠状动脉疾病。
Med Biol Eng Comput. 2018 May;56(5):749-759. doi: 10.1007/s11517-017-1719-6. Epub 2017 Sep 14.
3
Quick mining in dense data: applying probabilistic support prediction in depth-first order.密集数据中的快速挖掘:深度优先顺序下的概率支持预测应用
PeerJ Comput Sci. 2024 Oct 4;10:e2334. doi: 10.7717/peerj-cs.2334. eCollection 2024.
4
Multi-level high utility-itemset hiding.多级高实用项集隐藏
PLoS One. 2025 Feb 3;20(2):e0317427. doi: 10.1371/journal.pone.0317427. eCollection 2025.
5
Marginal frequent itemset mining for fault prevention of railway overhead contact system.用于铁路架空接触网系统故障预防的边际频繁项集挖掘
ISA Trans. 2022 Jul;126:276-287. doi: 10.1016/j.isatra.2021.07.018. Epub 2021 Jul 13.
6
A novel association rule mining approach using TID intermediate itemset.一种使用事务标识(TID)中间项集的新型关联规则挖掘方法。
PLoS One. 2018 Jan 19;13(1):e0179703. doi: 10.1371/journal.pone.0179703. eCollection 2018.
7
Design of an improved model using federated learning and LSTM autoencoders for secure and transparent blockchain network transactions.使用联邦学习和长短期记忆自动编码器设计一种改进模型,用于安全透明的区块链网络交易。
Sci Rep. 2025 Jan 10;15(1):1615. doi: 10.1038/s41598-024-83564-4.
8
Reducing side effects of hiding sensitive itemsets in privacy preserving data mining.减少隐私保护数据挖掘中隐藏敏感项集的副作用。
ScientificWorldJournal. 2014;2014:235837. doi: 10.1155/2014/235837. Epub 2014 Apr 10.
9
Personalized privacy-preserving frequent itemset mining using randomized response.使用随机应答的个性化隐私保护频繁项集挖掘
ScientificWorldJournal. 2014;2014:686151. doi: 10.1155/2014/686151. Epub 2014 Mar 30.
10
Towards practical and privacy-preserving CNN inference service for cloud-based medical imaging analysis: A homomorphic encryption-based approach.面向基于云的医学影像分析的实用且隐私保护的卷积神经网络推理服务:一种基于同态加密的方法。
Comput Methods Programs Biomed. 2025 Apr;261:108599. doi: 10.1016/j.cmpb.2025.108599. Epub 2025 Jan 21.

本文引用的文献

1
Privacy-Preserving Process Mining in Healthcare.医疗保健中的隐私保护流程挖掘。
Int J Environ Res Public Health. 2020 Mar 2;17(5):1612. doi: 10.3390/ijerph17051612.