基于兴趣测度的Apriori算法分析

2012 International Conference on Control Engineering and Communication Technology Pub Date : 2012-12-07 DOI:10.1109/ICCECT.2012.185

Jingyao Hu

{"title":"基于兴趣测度的Apriori算法分析","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":"{\"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}","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

摘要

针对Apriori算法存在的弊端，提出了一种改进算法。该算法通过增加兴趣项和构建兴趣模型来提高强关联规则的可读性。实验结果表明，该算法能有效地提高运算速度，减少候选集，提高算法效率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The Analysis on Apriori Algorithm Based on Interest Measure

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 International Conference on Control Engineering and Communication Technology

自引率

0.00%

发文量