Preserving privacy in association rule mining using multi-threshold particle swarm optimization

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
Shahad Aljehani , Youseef Alotaibi
{"title":"Preserving privacy in association rule mining using multi-threshold particle swarm optimization","authors":"Shahad Aljehani ,&nbsp;Youseef Alotaibi","doi":"10.1016/j.ins.2024.121673","DOIUrl":null,"url":null,"abstract":"<div><div>Healthcare data has become a powerful resource for generating insights that drive medical research. Association Rule Mining (ARM) techniques are widely used to identify relationships among diseases, treatments, and symptoms. However, sensitive information is often exposed, creating significant privacy challenges, particularly when data is integrated from multiple sources. Although Privacy-Preserving Association Rule Mining (PPARM) methods have been developed to address these issues, most rely on a single, predefined Minimum Support Threshold (MST) that is inflexible in adapting to diverse rule patterns. In this study, a Multi-Threshold Particle Swarm Optimization for Association Rule Mining (MPSO4ARM) model is introduced, integrating the Apriori and Particle Swarm Optimization (PSO) algorithms to perform data mining while protecting sensitive rules. A novel approach is employed by the proposed model to dynamically adjust the MST, allowing for more adaptive and effective privacy preservation. The MPSO4ARM model adjusts the MST on-the-fly based on rule length, improving its ability to safeguard sensitive data across various datasets. The proposed model was evaluated on the Chess, Mushroom, Retail, and Heart Disease datasets. The experimental results showed that the MPSO4ARM model outperforms traditional Apriori and conventional PSO algorithms, achieving higher fitness values and reducing side effects such as Hiding Failure (HF) and Missing Cost (MC), particularly in the Heart Disease and Mushroom datasets. Although the dynamic MST function introduces a moderate increase in computational runtime compared to Apriori and conventional PSO, this trade-off between execution time and enhanced privacy protection is considered acceptable, given the model's substantial improvements in data utility and rule sanitization.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"692 ","pages":"Article 121673"},"PeriodicalIF":8.1000,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025524015871","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Healthcare data has become a powerful resource for generating insights that drive medical research. Association Rule Mining (ARM) techniques are widely used to identify relationships among diseases, treatments, and symptoms. However, sensitive information is often exposed, creating significant privacy challenges, particularly when data is integrated from multiple sources. Although Privacy-Preserving Association Rule Mining (PPARM) methods have been developed to address these issues, most rely on a single, predefined Minimum Support Threshold (MST) that is inflexible in adapting to diverse rule patterns. In this study, a Multi-Threshold Particle Swarm Optimization for Association Rule Mining (MPSO4ARM) model is introduced, integrating the Apriori and Particle Swarm Optimization (PSO) algorithms to perform data mining while protecting sensitive rules. A novel approach is employed by the proposed model to dynamically adjust the MST, allowing for more adaptive and effective privacy preservation. The MPSO4ARM model adjusts the MST on-the-fly based on rule length, improving its ability to safeguard sensitive data across various datasets. The proposed model was evaluated on the Chess, Mushroom, Retail, and Heart Disease datasets. The experimental results showed that the MPSO4ARM model outperforms traditional Apriori and conventional PSO algorithms, achieving higher fitness values and reducing side effects such as Hiding Failure (HF) and Missing Cost (MC), particularly in the Heart Disease and Mushroom datasets. Although the dynamic MST function introduces a moderate increase in computational runtime compared to Apriori and conventional PSO, this trade-off between execution time and enhanced privacy protection is considered acceptable, given the model's substantial improvements in data utility and rule sanitization.
利用多阈值粒子群优化在关联规则挖掘中保护隐私
医疗保健数据已成为推动医学研究的强大洞察力资源。关联规则挖掘 (ARM) 技术被广泛用于识别疾病、治疗和症状之间的关系。然而,敏感信息往往会暴露出来,给隐私带来巨大挑战,尤其是当数据从多个来源整合时。虽然保护隐私的关联规则挖掘(PPARM)方法已被开发出来以解决这些问题,但大多数方法都依赖于单一的、预定义的最小支持阈值(MST),这种方法在适应各种规则模式方面缺乏灵活性。本研究引入了关联规则挖掘的多阈值粒子群优化(MPSO4ARM)模型,该模型整合了 Apriori 算法和粒子群优化(PSO)算法,在进行数据挖掘的同时保护敏感规则。该模型采用了一种新颖的方法来动态调整 MST,从而更自适应、更有效地保护隐私。MPSO4ARM 模型可根据规则长度实时调整 MST,从而提高了在各种数据集上保护敏感数据的能力。我们在国际象棋、蘑菇、零售和心脏病数据集上对所提出的模型进行了评估。实验结果表明,MPSO4ARM 模型优于传统的 Apriori 算法和传统的 PSO 算法,尤其是在心脏病和蘑菇数据集上,MPSO4ARM 模型获得了更高的适应度值,减少了隐藏失败(HF)和缺失成本(MC)等副作用。虽然与 Apriori 和传统 PSO 相比,动态 MST 函数会适度增加计算运行时间,但考虑到该模型在数据实用性和规则净化方面的显著改进,这种在执行时间和增强隐私保护之间的权衡是可以接受的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信