{"title":"Efficient fuzzy-based high utility pattern computing and analyzing approach with temporal properties","authors":"Unil Yun, Hyeonmo Kim , Hanju Kim , Seungwan Park","doi":"10.1016/j.asoc.2025.112902","DOIUrl":null,"url":null,"abstract":"<div><div>Fuzzy logic in soft computing deals with intuitive and comprehensive intelligence to find solutions to problems in the uncertain real world. Considering the fuzzy set concept and knowledge discovery of utility-driven patterns simultaneously, quantities of sets of items hidden within vast data can be represented in an easy-to-understand linguistic representation. This can lead to more reasonable decision-making. Together with these fascinating results, temporal fuzzy utility pattern analysis has emerged as a significant area in the last few years to consider the duration of transactions in temporal quantitative data. The latest temporal approaches have improved resource efficiency by storing information on patterns with efficient data structures. However, although a list-based approach is known to be robust and follows a mechanism that does not generate candidates, it requires explosive comparison operations that are unsuitable for processing long-length patterns, especially in big data analysis. To solve this issue, we present a novel indexed list-based structure along with a data analysis method designed to allow rapid pattern growth as well as prevent the generation of candidates for discovering high temporal fuzzy utility patterns. Performance tests on real and synthetic datasets demonstrate that the proposed approach exhibits superior time efficiency and scalability relative to state-of-the-art methods with minimal compromise in memory, all while extracting accurate results. Moreover, comprehensive experiments demonstrate the capability of the proposed method for practical use cases and its effectiveness in search space pruning.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"172 ","pages":"Article 112902"},"PeriodicalIF":7.2000,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625002133","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Fuzzy logic in soft computing deals with intuitive and comprehensive intelligence to find solutions to problems in the uncertain real world. Considering the fuzzy set concept and knowledge discovery of utility-driven patterns simultaneously, quantities of sets of items hidden within vast data can be represented in an easy-to-understand linguistic representation. This can lead to more reasonable decision-making. Together with these fascinating results, temporal fuzzy utility pattern analysis has emerged as a significant area in the last few years to consider the duration of transactions in temporal quantitative data. The latest temporal approaches have improved resource efficiency by storing information on patterns with efficient data structures. However, although a list-based approach is known to be robust and follows a mechanism that does not generate candidates, it requires explosive comparison operations that are unsuitable for processing long-length patterns, especially in big data analysis. To solve this issue, we present a novel indexed list-based structure along with a data analysis method designed to allow rapid pattern growth as well as prevent the generation of candidates for discovering high temporal fuzzy utility patterns. Performance tests on real and synthetic datasets demonstrate that the proposed approach exhibits superior time efficiency and scalability relative to state-of-the-art methods with minimal compromise in memory, all while extracting accurate results. Moreover, comprehensive experiments demonstrate the capability of the proposed method for practical use cases and its effectiveness in search space pruning.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.