An Improved Association Rule Mining Algorithm Based on the Prior Information

X. Cai, Shengbing Xu, Lei Chen, Jinzhang Li, Xin Qiu, Boqi Zheng
{"title":"An Improved Association Rule Mining Algorithm Based on the Prior Information","authors":"X. Cai, Shengbing Xu, Lei Chen, Jinzhang Li, Xin Qiu, Boqi Zheng","doi":"10.1109/DOCS55193.2022.9967736","DOIUrl":null,"url":null,"abstract":"Data mining can uncover valuable information from large amounts of redundant data, where association rule mining is one of the most important research element. By mining association rules, we can find connections between seemingly unrelated issues and contribute to society. However, the classic algorithms in association rule mining such as Apriori have gradually failed to complete the mining task in a short time due to the consistent growth of data. In this paper, an improved method for the association rule mining of supermarket sales based on prior information (i.e., historical data mining, and supermarket sales strategy) is proposed to address this problem. The performance of the improved association rule mining algorithm is verified by experimental studies, and the simulation results comparison and analysis have shown that the proposed method can reduce the time and space loss of mining in the mining task.","PeriodicalId":348545,"journal":{"name":"2022 4th International Conference on Data-driven Optimization of Complex Systems (DOCS)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 4th International Conference on Data-driven Optimization of Complex Systems (DOCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DOCS55193.2022.9967736","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Data mining can uncover valuable information from large amounts of redundant data, where association rule mining is one of the most important research element. By mining association rules, we can find connections between seemingly unrelated issues and contribute to society. However, the classic algorithms in association rule mining such as Apriori have gradually failed to complete the mining task in a short time due to the consistent growth of data. In this paper, an improved method for the association rule mining of supermarket sales based on prior information (i.e., historical data mining, and supermarket sales strategy) is proposed to address this problem. The performance of the improved association rule mining algorithm is verified by experimental studies, and the simulation results comparison and analysis have shown that the proposed method can reduce the time and space loss of mining in the mining task.
一种改进的基于先验信息的关联规则挖掘算法
数据挖掘可以从大量冗余数据中发现有价值的信息,其中关联规则挖掘是最重要的研究元素之一。通过挖掘关联规则,我们可以发现看似不相关的问题之间的联系,并为社会做出贡献。然而,由于数据的持续增长,Apriori等经典关联规则挖掘算法逐渐无法在短时间内完成挖掘任务。针对这一问题,本文提出了一种基于先验信息(即历史数据挖掘和超市销售策略)的超市销售关联规则挖掘改进方法。通过实验研究验证了改进的关联规则挖掘算法的性能,仿真结果对比分析表明,所提方法可以减少挖掘任务中挖掘的时间和空间损失。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信