An efficient PSO-based evolutionary model for closed high-utility itemset mining

IF 3.4 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Applied Intelligence Pub Date : 2025-01-10 DOI:10.1007/s10489-024-06151-0
Simen Carstensen, Jerry Chun-Wei Lin
{"title":"An efficient PSO-based evolutionary model for closed high-utility itemset mining","authors":"Simen Carstensen,&nbsp;Jerry Chun-Wei Lin","doi":"10.1007/s10489-024-06151-0","DOIUrl":null,"url":null,"abstract":"<div><p>High-utility itemset mining (HUIM) is a widely adopted data mining technique for discovering valuable patterns in transactional databases. Although HUIM can provide useful knowledge in various types of data, it can be challenging to interpret the results when many patterns are found. To alleviate this, closed high-utility itemset mining (CHUIM) has been suggested, which provides users with a more concise and meaningful set of solutions. However, CHUIM is a computationally demanding task, and current approaches can require prolonged runtimes. This paper aims to solve this problem and proposes a meta-heuristic model based on particle swarm optimization (PSO) to discover CHUIs, called CHUI-PSO. Moreover, the algorithm incorporates several new strategies to reduce the computational cost associated with similar existing techniques. First, we introduce Extended TWU pruning (ETP), which aims to decrease the number of possible candidates to improve the discovery of solutions in large search spaces. Second, we propose two new utility upper bounds, used to estimate itemset utilities and bypass expensive candidate evaluations. Finally, to increase population diversity and prevent redundant computations, we suggest a structure called ExploredSet to maintain and utilize the evaluated candidates. Extensive experimental results show that CHUI-PSO outperforms the current state-of-the-art algorithms regarding execution time, accuracy, and convergence.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 4","pages":""},"PeriodicalIF":3.4000,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10489-024-06151-0","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

High-utility itemset mining (HUIM) is a widely adopted data mining technique for discovering valuable patterns in transactional databases. Although HUIM can provide useful knowledge in various types of data, it can be challenging to interpret the results when many patterns are found. To alleviate this, closed high-utility itemset mining (CHUIM) has been suggested, which provides users with a more concise and meaningful set of solutions. However, CHUIM is a computationally demanding task, and current approaches can require prolonged runtimes. This paper aims to solve this problem and proposes a meta-heuristic model based on particle swarm optimization (PSO) to discover CHUIs, called CHUI-PSO. Moreover, the algorithm incorporates several new strategies to reduce the computational cost associated with similar existing techniques. First, we introduce Extended TWU pruning (ETP), which aims to decrease the number of possible candidates to improve the discovery of solutions in large search spaces. Second, we propose two new utility upper bounds, used to estimate itemset utilities and bypass expensive candidate evaluations. Finally, to increase population diversity and prevent redundant computations, we suggest a structure called ExploredSet to maintain and utilize the evaluated candidates. Extensive experimental results show that CHUI-PSO outperforms the current state-of-the-art algorithms regarding execution time, accuracy, and convergence.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种高效的基于pso的封闭式高效用项集挖掘进化模型
高效用项集挖掘(HUIM)是一种广泛采用的数据挖掘技术,用于在事务性数据库中发现有价值的模式。尽管HUIM可以在各种类型的数据中提供有用的知识,但是当发现许多模式时,解释结果可能具有挑战性。为了缓解这一问题,封闭型高效用项集挖掘(CHUIM)被提出,它为用户提供了一组更简洁、更有意义的解决方案。然而,CHUIM是一项计算要求很高的任务,目前的方法可能需要较长的运行时间。针对这一问题,本文提出了一种基于粒子群优化(PSO)的元启发式chui发现模型,称为CHUI-PSO。此外,该算法结合了几种新的策略,以减少与类似现有技术相关的计算成本。首先,我们引入了扩展TWU剪枝(ETP),其目的是减少可能的候选者数量,以提高在大型搜索空间中解决方案的发现。其次,我们提出了两个新的效用上限,用于估计项目集效用并绕过昂贵的候选评估。最后,为了增加种群多样性和防止冗余计算,我们建议使用一个名为exploreset的结构来维护和利用评估的候选物种。大量的实验结果表明,CHUI-PSO在执行时间、精度和收敛性方面优于当前最先进的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Applied Intelligence
Applied Intelligence 工程技术-计算机:人工智能
CiteScore
6.60
自引率
20.80%
发文量
1361
审稿时长
5.9 months
期刊介绍: With a focus on research in artificial intelligence and neural networks, this journal addresses issues involving solutions of real-life manufacturing, defense, management, government and industrial problems which are too complex to be solved through conventional approaches and require the simulation of intelligent thought processes, heuristics, applications of knowledge, and distributed and parallel processing. The integration of these multiple approaches in solving complex problems is of particular importance. The journal presents new and original research and technological developments, addressing real and complex issues applicable to difficult problems. It provides a medium for exchanging scientific research and technological achievements accomplished by the international community.
期刊最新文献
Multi-view learning based on product and process metrics for software defect prediction MVSRF: Point cloud semantic segmentation and optimization method for granular construction objects WLKA-RVS: a retinal vessel segmentation method using weighted large kernel attention DAAR: Dual attention cooperative adaptive pruning rate by data-driven for filter pruning Chaotic opposition-based plant propagation algorithm for engineering problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1