The Analysis on Apriori Algorithm Based on Interest Measure

Jingyao Hu
{"title":"The Analysis on Apriori Algorithm Based on Interest Measure","authors":"Jingyao Hu","doi":"10.1109/ICCECT.2012.185","DOIUrl":null,"url":null,"abstract":"This paper proposes an improved algorithm to overtime the abuses that the Apriori algorithm has. The algorithm improves the readability of the strong association rules by increasing interest items and constructing the model of the interest. The experimental results show that the algorithm can effectively increase the operation speed, reduce the set of candidates, enhance the efficiency of the algorithm.","PeriodicalId":153613,"journal":{"name":"2012 International Conference on Control Engineering and Communication Technology","volume":" 20","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Control Engineering and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCECT.2012.185","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This paper proposes an improved algorithm to overtime the abuses that the Apriori algorithm has. The algorithm improves the readability of the strong association rules by increasing interest items and constructing the model of the interest. The experimental results show that the algorithm can effectively increase the operation speed, reduce the set of candidates, enhance the efficiency of the algorithm.
基于兴趣测度的Apriori算法分析
针对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学术官方微信