基于元胞自动机的并行模糊频繁项集挖掘

T. T. Tran, T. T. Nguyen, Giang Nguyen, Chau N. Truong
{"title":"基于元胞自动机的并行模糊频繁项集挖掘","authors":"T. T. Tran, T. T. Nguyen, Giang Nguyen, Chau N. Truong","doi":"10.15625/1813-9663/38/4/17462","DOIUrl":null,"url":null,"abstract":"Finding frequent fuzzy itemsets in operational quantitative databases is a significant challenge for fuzzy association rule mining in the context of data mining. If frequent fuzzy itemsets are detected, the decision-making process and formulating strategies in businesses will be made more precise. Because the characteristic of these data models is a large number of transactions and unlimited and high-speed productions. This leads to limitations in calculating the support for itemsets containing fuzzy attributes. As a result, mining using parallel processing techniques has emerged as a potential solution to the issue of slow availability. This study presents a reinforced technique for mining frequent fuzzy sets based on cellular learning automata (CLA). The results demonstrate that frequent set mining can be accomplished with less running time when the proposed method is compared to iMFFP and NPSFF methods.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"59 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PARALLEL FUZZY FREQUENT ITEMSET MINING USING CELLULAR AUTOMATA\",\"authors\":\"T. T. Tran, T. T. Nguyen, Giang Nguyen, Chau N. Truong\",\"doi\":\"10.15625/1813-9663/38/4/17462\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Finding frequent fuzzy itemsets in operational quantitative databases is a significant challenge for fuzzy association rule mining in the context of data mining. If frequent fuzzy itemsets are detected, the decision-making process and formulating strategies in businesses will be made more precise. Because the characteristic of these data models is a large number of transactions and unlimited and high-speed productions. This leads to limitations in calculating the support for itemsets containing fuzzy attributes. As a result, mining using parallel processing techniques has emerged as a potential solution to the issue of slow availability. This study presents a reinforced technique for mining frequent fuzzy sets based on cellular learning automata (CLA). The results demonstrate that frequent set mining can be accomplished with less running time when the proposed method is compared to iMFFP and NPSFF methods.\",\"PeriodicalId\":15444,\"journal\":{\"name\":\"Journal of Computer Science and Cybernetics\",\"volume\":\"59 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer Science and Cybernetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15625/1813-9663/38/4/17462\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer Science and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15625/1813-9663/38/4/17462","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在数据挖掘的背景下,在可操作的定量数据库中发现频繁的模糊项集是模糊关联规则挖掘的一个重大挑战。如果频繁的模糊项集被检测出来,企业的决策过程和制定战略将更加精确。因为这些数据模型的特点是大量的事务和无限高速的生产。这导致在计算对包含模糊属性的项集的支持时受到限制。因此,使用并行处理技术进行挖掘已成为解决可用性缓慢问题的潜在解决方案。提出了一种基于元胞学习自动机(CLA)的频繁模糊集挖掘技术。结果表明,与iMFFP和NPSFF方法相比,该方法可以在更短的运行时间内完成频繁集挖掘。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
PARALLEL FUZZY FREQUENT ITEMSET MINING USING CELLULAR AUTOMATA
Finding frequent fuzzy itemsets in operational quantitative databases is a significant challenge for fuzzy association rule mining in the context of data mining. If frequent fuzzy itemsets are detected, the decision-making process and formulating strategies in businesses will be made more precise. Because the characteristic of these data models is a large number of transactions and unlimited and high-speed productions. This leads to limitations in calculating the support for itemsets containing fuzzy attributes. As a result, mining using parallel processing techniques has emerged as a potential solution to the issue of slow availability. This study presents a reinforced technique for mining frequent fuzzy sets based on cellular learning automata (CLA). The results demonstrate that frequent set mining can be accomplished with less running time when the proposed method is compared to iMFFP and NPSFF methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
PROVING THE SECURITY OF AES BLOCK CIPHER BASED ON MODIFIED MIXCOLUMN AN IMPROVED INDEXING METHOD FOR QUERYING BIG XML FILES OHYEAH AT VLSP2022-EVJVQA CHALLENGE: A JOINTLY LANGUAGE-IMAGE MODEL FOR MULTILINGUAL VISUAL QUESTION ANSWERING THE VNPT-IT EMOTION TRANSPLANTATION APPROACH FOR VLSP 2022 TAEKWONDO POSE ESTIMATION WITH DEEP LEARNING ARCHITECTURES ON ONE-DIMENSIONAL AND TWO-DIMENSIONAL DATA
×
引用
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