Uncertainty Oriented-Incremental Erasable Pattern Mining Over Data Streams

IF 8.6 1区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Hanju Kim;Myungha Cho;Hyeonmo Kim;Yoonji Baek;Chanhee Lee;Taewoong Ryu;Heonho Kim;Seungwan Park;Doyoon Kim;Doyoung Kim;Sinyoung Kim;Bay Vo;Jerry Chun-Wei Lin;Witold Pedrycz;Unil Yun
{"title":"Uncertainty Oriented-Incremental Erasable Pattern Mining Over Data Streams","authors":"Hanju Kim;Myungha Cho;Hyeonmo Kim;Yoonji Baek;Chanhee Lee;Taewoong Ryu;Heonho Kim;Seungwan Park;Doyoon Kim;Doyoung Kim;Sinyoung Kim;Bay Vo;Jerry Chun-Wei Lin;Witold Pedrycz;Unil Yun","doi":"10.1109/TSMC.2024.3505904","DOIUrl":null,"url":null,"abstract":"In a manufacturing factory, product lines are organized by several constituents and exhibit a profit value, i.e., income from products. Erasable patterns are less profitable patterns whose gain, i.e., the sum of product profits, does not exceed a user-defined threshold. Mining erasable patterns provides the necessary information to users who want to increase profits by erasing less profitable patterns. There are requirements for a method which efficiently manages uncertain databases in incremental environments to identify erasable patterns that consider uncertainty. Because our novel technique uses a list structure, it is more efficient at finding erasable patterns from incremental databases. Moreover, accumulated stream data should be handled efficiently to identify new useful patterns in both additional data and the existing data. In this article, an algorithm using a list-based structure is proposed to extract erasable patterns containing valuable knowledge from uncertain databases in real time with effective and productive performance. In order to derive erasable patterns from continuously accumulated stream databases, the structure efficiently manages the information gathered from the previous database. Extensive performance and pattern quality evaluations were conducted using real and synthetic datasets. The results show that the algorithm performs up to seven times faster than state-of-the-art erasable pattern mining algorithms on real datasets and scales adeptly on synthetic datasets while delivering reliable and significant result patterns.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 2","pages":"1451-1465"},"PeriodicalIF":8.6000,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Systems Man Cybernetics-Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10783059/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In a manufacturing factory, product lines are organized by several constituents and exhibit a profit value, i.e., income from products. Erasable patterns are less profitable patterns whose gain, i.e., the sum of product profits, does not exceed a user-defined threshold. Mining erasable patterns provides the necessary information to users who want to increase profits by erasing less profitable patterns. There are requirements for a method which efficiently manages uncertain databases in incremental environments to identify erasable patterns that consider uncertainty. Because our novel technique uses a list structure, it is more efficient at finding erasable patterns from incremental databases. Moreover, accumulated stream data should be handled efficiently to identify new useful patterns in both additional data and the existing data. In this article, an algorithm using a list-based structure is proposed to extract erasable patterns containing valuable knowledge from uncertain databases in real time with effective and productive performance. In order to derive erasable patterns from continuously accumulated stream databases, the structure efficiently manages the information gathered from the previous database. Extensive performance and pattern quality evaluations were conducted using real and synthetic datasets. The results show that the algorithm performs up to seven times faster than state-of-the-art erasable pattern mining algorithms on real datasets and scales adeptly on synthetic datasets while delivering reliable and significant result patterns.
面向不确定性的数据流增量可擦除模式挖掘
在制造工厂中,生产线由几个组成部分组成,并显示利润值,即产品收入。可擦除模式是利润较低的模式,其收益,即产品利润的总和,不超过用户定义的阈值。挖掘可擦除模式为希望通过擦除不太有利可图的模式来增加利润的用户提供必要的信息。在增量环境中,需要一种有效管理不确定性数据库的方法来识别考虑不确定性的可擦除模式。由于我们的新技术使用了列表结构,因此在从增量数据库中查找可擦除模式时效率更高。此外,应有效地处理积累的流数据,以在附加数据和现有数据中识别新的有用模式。本文提出了一种基于列表结构的算法,用于从不确定数据库中实时提取包含有价值知识的可擦除模式,并且具有高效的性能。为了从不断积累的流数据库中获得可擦除的模式,该结构有效地管理了从先前数据库中收集到的信息。使用真实和合成数据集进行了广泛的性能和模式质量评估。结果表明,该算法在真实数据集上的执行速度比最先进的可擦除模式挖掘算法快7倍,并在合成数据集上熟练地扩展,同时提供可靠和重要的结果模式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Systems Man Cybernetics-Systems
IEEE Transactions on Systems Man Cybernetics-Systems AUTOMATION & CONTROL SYSTEMS-COMPUTER SCIENCE, CYBERNETICS
CiteScore
18.50
自引率
11.50%
发文量
812
审稿时长
6 months
期刊介绍: The IEEE Transactions on Systems, Man, and Cybernetics: Systems encompasses the fields of systems engineering, covering issue formulation, analysis, and modeling throughout the systems engineering lifecycle phases. It addresses decision-making, issue interpretation, systems management, processes, and various methods such as optimization, modeling, and simulation in the development and deployment of large systems.
×
引用
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学术官方微信