提取数值关联规则的元启发式视角:当前工作、应用和建议

IF 9.7 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Salma Yacoubi, Ghaith Manita, Amit Chhabra, Ouajdi Korbaa
{"title":"提取数值关联规则的元启发式视角:当前工作、应用和建议","authors":"Salma Yacoubi,&nbsp;Ghaith Manita,&nbsp;Amit Chhabra,&nbsp;Ouajdi Korbaa","doi":"10.1007/s11831-024-10109-3","DOIUrl":null,"url":null,"abstract":"<div><p>In the vast field of data mining, the increasing significance of Numerical Association Rule Mining (NARM) lies in its capacity to unearth recurrent patterns and correlations across diverse attribute types, resonating across multifarious sectors such as healthcare, commercial databases, and beyond. This article explores in depth the intricacies of optimization algorithms and metaheuristic approaches within the NARM framework, highlighting their essential role in amplifying the effectiveness and computational efficiency of the algorithms developed. In particular, the integration of metaheuristic optimization appears to be a significant advance, improving the accuracy and reliability of derived rules while avoiding the computational rigors of conventional processes. Exploration in this study, covers various areas of association rules, including numerical, fuzzy and high-utility sets, providing a solid synthesis of a meta-study and offering a holistic view that interweaves historical, methodological and future-oriented perspectives, thus seeking to immerse future research efforts in a comprehensive understanding of the incessant optimization approaches inherent in NARM’s vast scope in data mining. In particular, this survey considered the extensive metaheuristic-based NARM research works between 2015 and 2023. Initially commencing with a large corpus of 19,500 papers, a stringent filtration process was employed, resulting in the identification of 180 pertinent papers that contributed significantly to this survey.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"31 7","pages":"4087 - 4128"},"PeriodicalIF":9.7000,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Metaheuristic Perspective on Extracting Numeric Association Rules: Current Works, Applications, and Recommendations\",\"authors\":\"Salma Yacoubi,&nbsp;Ghaith Manita,&nbsp;Amit Chhabra,&nbsp;Ouajdi Korbaa\",\"doi\":\"10.1007/s11831-024-10109-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In the vast field of data mining, the increasing significance of Numerical Association Rule Mining (NARM) lies in its capacity to unearth recurrent patterns and correlations across diverse attribute types, resonating across multifarious sectors such as healthcare, commercial databases, and beyond. This article explores in depth the intricacies of optimization algorithms and metaheuristic approaches within the NARM framework, highlighting their essential role in amplifying the effectiveness and computational efficiency of the algorithms developed. In particular, the integration of metaheuristic optimization appears to be a significant advance, improving the accuracy and reliability of derived rules while avoiding the computational rigors of conventional processes. Exploration in this study, covers various areas of association rules, including numerical, fuzzy and high-utility sets, providing a solid synthesis of a meta-study and offering a holistic view that interweaves historical, methodological and future-oriented perspectives, thus seeking to immerse future research efforts in a comprehensive understanding of the incessant optimization approaches inherent in NARM’s vast scope in data mining. In particular, this survey considered the extensive metaheuristic-based NARM research works between 2015 and 2023. Initially commencing with a large corpus of 19,500 papers, a stringent filtration process was employed, resulting in the identification of 180 pertinent papers that contributed significantly to this survey.</p></div>\",\"PeriodicalId\":55473,\"journal\":{\"name\":\"Archives of Computational Methods in Engineering\",\"volume\":\"31 7\",\"pages\":\"4087 - 4128\"},\"PeriodicalIF\":9.7000,\"publicationDate\":\"2024-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Archives of Computational Methods in Engineering\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s11831-024-10109-3\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archives of Computational Methods in Engineering","FirstCategoryId":"5","ListUrlMain":"https://link.springer.com/article/10.1007/s11831-024-10109-3","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

在广阔的数据挖掘领域,数值关联规则挖掘(NARM)的重要性日益凸显,因为它能够发现不同属性类型之间的重复模式和关联性,在医疗保健、商业数据库等多个领域引起共鸣。本文深入探讨了 NARM 框架中优化算法和元启发式方法的复杂性,强调了它们在提高所开发算法的有效性和计算效率方面的重要作用。尤其是元启发式优化的整合似乎是一个重大进步,它提高了推导规则的准确性和可靠性,同时避免了传统程序的计算复杂性。本研究中的探索涵盖了关联规则的各个领域,包括数值集、模糊集和高效用集,为元研究提供了一个坚实的综合体,并提供了一个将历史、方法论和面向未来的视角交织在一起的整体视角,从而力求让未来的研究工作沉浸在对 NARM 在数据挖掘的巨大范围中固有的不断优化方法的全面理解中。特别是,本调查考虑了 2015 年至 2023 年期间基于元搜索的大量 NARM 研究工作。调查最初从 19500 篇论文的庞大语料库开始,采用了严格的过滤过程,最终确定了 180 篇相关论文,为本调查做出了重要贡献。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A Metaheuristic Perspective on Extracting Numeric Association Rules: Current Works, Applications, and Recommendations

A Metaheuristic Perspective on Extracting Numeric Association Rules: Current Works, Applications, and Recommendations

In the vast field of data mining, the increasing significance of Numerical Association Rule Mining (NARM) lies in its capacity to unearth recurrent patterns and correlations across diverse attribute types, resonating across multifarious sectors such as healthcare, commercial databases, and beyond. This article explores in depth the intricacies of optimization algorithms and metaheuristic approaches within the NARM framework, highlighting their essential role in amplifying the effectiveness and computational efficiency of the algorithms developed. In particular, the integration of metaheuristic optimization appears to be a significant advance, improving the accuracy and reliability of derived rules while avoiding the computational rigors of conventional processes. Exploration in this study, covers various areas of association rules, including numerical, fuzzy and high-utility sets, providing a solid synthesis of a meta-study and offering a holistic view that interweaves historical, methodological and future-oriented perspectives, thus seeking to immerse future research efforts in a comprehensive understanding of the incessant optimization approaches inherent in NARM’s vast scope in data mining. In particular, this survey considered the extensive metaheuristic-based NARM research works between 2015 and 2023. Initially commencing with a large corpus of 19,500 papers, a stringent filtration process was employed, resulting in the identification of 180 pertinent papers that contributed significantly to this survey.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
19.80
自引率
4.10%
发文量
153
审稿时长
>12 weeks
期刊介绍: Archives of Computational Methods in Engineering Aim and Scope: Archives of Computational Methods in Engineering serves as an active forum for disseminating research and advanced practices in computational engineering, particularly focusing on mechanics and related fields. The journal emphasizes extended state-of-the-art reviews in selected areas, a unique feature of its publication. Review Format: Reviews published in the journal offer: A survey of current literature Critical exposition of topics in their full complexity By organizing the information in this manner, readers can quickly grasp the focus, coverage, and unique features of the Archives of Computational Methods in Engineering.
×
引用
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学术官方微信