基于抽样学习的关联规则挖掘算法

Xiao-Lan Xie, Ying Zhang, Yingtao Xu
{"title":"基于抽样学习的关联规则挖掘算法","authors":"Xiao-Lan Xie, Ying Zhang, Yingtao Xu","doi":"10.1109/ICACI.2012.6463168","DOIUrl":null,"url":null,"abstract":"The view that sampling technology could improve the efficiency of data mining significantly has been widely accepted by the research community. The key to sample in data mining is how to design a sampling strategy to get a favorable sample to execute the mining algorithm at minor cost of accuracy. In this article we propose a progressive sampling algorithm based on confusion matrix to determine the optimal sample size. The novelty of this algorithm is that it can find the appropriate sample very quickly and very accurately without executing the data mining.","PeriodicalId":404759,"journal":{"name":"2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Sampling learning based association rules mining algorithm\",\"authors\":\"Xiao-Lan Xie, Ying Zhang, Yingtao Xu\",\"doi\":\"10.1109/ICACI.2012.6463168\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The view that sampling technology could improve the efficiency of data mining significantly has been widely accepted by the research community. The key to sample in data mining is how to design a sampling strategy to get a favorable sample to execute the mining algorithm at minor cost of accuracy. In this article we propose a progressive sampling algorithm based on confusion matrix to determine the optimal sample size. The novelty of this algorithm is that it can find the appropriate sample very quickly and very accurately without executing the data mining.\",\"PeriodicalId\":404759,\"journal\":{\"name\":\"2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACI.2012.6463168\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACI.2012.6463168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

采样技术可以显著提高数据挖掘的效率,这一观点已被研究界广泛接受。在数据挖掘中,采样的关键是如何设计一种采样策略,以较小的精度代价获得合适的样本来执行挖掘算法。本文提出了一种基于混淆矩阵的渐进式抽样算法来确定最优样本量。该算法的新颖之处在于无需进行数据挖掘就能快速准确地找到合适的样本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sampling learning based association rules mining algorithm
The view that sampling technology could improve the efficiency of data mining significantly has been widely accepted by the research community. The key to sample in data mining is how to design a sampling strategy to get a favorable sample to execute the mining algorithm at minor cost of accuracy. In this article we propose a progressive sampling algorithm based on confusion matrix to determine the optimal sample size. The novelty of this algorithm is that it can find the appropriate sample very quickly and very accurately without executing the data mining.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信