Enhanced Differential Evolution and Particle Swarm Optimization Approaches for Discovering High Utility Itemsets

N. Sukanya, P. R. J. Thangaiah
{"title":"Enhanced Differential Evolution and Particle Swarm Optimization Approaches for Discovering High Utility Itemsets","authors":"N. Sukanya, P. R. J. Thangaiah","doi":"10.1142/s1469026823410055","DOIUrl":null,"url":null,"abstract":"Mining patterns from High-utility itemsets (HUIs) have been exploited recently in place of frequent itemset mining (FIMs) or association-rule mining (ARMs) as they highlight profitability of products where quantity and profits are taken into account. Several techniques for HUIs have been proposed and they encounter exponential search spaces which have more distinct items or voluminous databases. Alternatively, Evolutionary Computations (ECs)-based meta-heuristics algorithms can be effective in solving issues in HUIs since a set of near-optimal solutions can be obtained within restricted periods. Current ECs-based techniques consume more time to identify HUIs in transactional databases, discover unacceptable combinations of HUIs, and finally fail to discover HUIs when neighborhood searches are not executed locally and globally. To overcome these challenges, a HUI mining algorithm based on Differential Evolution (DE) and Particle Swarm Optimization (PSO) using multiple strategies including elitism, population diversifications, exclusive preservations, and neighborhood exploration techniques has been proposed. Thus, this work defines mining patterns based on DE and PSO to identify HUIs in voluminous transactional databases. The HUIM-DE-PSO-DE algorithm proposed in this work discovers more number of HUIs which is revealed in experimental results obtained from a set of benchmark data instances. Results are compared with existing approaches using several performance metrics including convergence speeds, minimum utility threshold values, and execution time consumed.","PeriodicalId":422521,"journal":{"name":"Int. J. Comput. Intell. Appl.","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Comput. Intell. Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s1469026823410055","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Mining patterns from High-utility itemsets (HUIs) have been exploited recently in place of frequent itemset mining (FIMs) or association-rule mining (ARMs) as they highlight profitability of products where quantity and profits are taken into account. Several techniques for HUIs have been proposed and they encounter exponential search spaces which have more distinct items or voluminous databases. Alternatively, Evolutionary Computations (ECs)-based meta-heuristics algorithms can be effective in solving issues in HUIs since a set of near-optimal solutions can be obtained within restricted periods. Current ECs-based techniques consume more time to identify HUIs in transactional databases, discover unacceptable combinations of HUIs, and finally fail to discover HUIs when neighborhood searches are not executed locally and globally. To overcome these challenges, a HUI mining algorithm based on Differential Evolution (DE) and Particle Swarm Optimization (PSO) using multiple strategies including elitism, population diversifications, exclusive preservations, and neighborhood exploration techniques has been proposed. Thus, this work defines mining patterns based on DE and PSO to identify HUIs in voluminous transactional databases. The HUIM-DE-PSO-DE algorithm proposed in this work discovers more number of HUIs which is revealed in experimental results obtained from a set of benchmark data instances. Results are compared with existing approaches using several performance metrics including convergence speeds, minimum utility threshold values, and execution time consumed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于改进差分进化和粒子群优化的高效用项集发现方法
高效用项目集(hui)的挖掘模式最近被用来代替频繁的项目集挖掘(fim)或关联规则挖掘(arm),因为它们突出了考虑数量和利润的产品的盈利能力。已经提出了几种用于hui的技术,它们遇到具有更多不同项目或大量数据库的指数搜索空间。另外,基于进化计算(ECs)的元启发式算法可以有效地解决hui中的问题,因为可以在有限的时间内获得一组接近最优的解决方案。当前基于ec的技术需要花费更多的时间来识别事务数据库中的hui,发现不可接受的hui组合,并且当没有在本地和全局执行邻域搜索时,最终无法发现hui。为了克服这些挑战,提出了一种基于差分进化(DE)和粒子群优化(PSO)的HUI挖掘算法,该算法采用了精英化、种群多样化、排他保留和邻域探索等多种策略。因此,这项工作定义了基于DE和PSO的挖掘模式,以识别大量事务数据库中的hui。本文提出的HUIM-DE-PSO-DE算法发现了更多的hui数量,这在一组基准数据实例的实验结果中得到了揭示。使用几个性能指标(包括收敛速度、最小效用阈值和所消耗的执行时间)将结果与现有方法进行比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
CT Images Segmentation Using a Deep Learning-Based Approach for Preoperative Projection of Human Organ Model Using Augmented Reality Technology Styling Classification of Group Photos Fusing Head and Pose Features Genetic Algorithm-Based Optimal Resource Trust Line Prediction in Cloud Computing Shearlet Transform-Based Novel Method for Multimodality Medical Image Fusion Using Deep Learning An Energy-Efficient Clustering and Fuzzy-Based Path Selection for Flying Ad-Hoc Networks
×
引用
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