| 基于消费行为的Apriori算法研究 |
| |
| 引用本文： | 骆嘉伟,彭蔓蔓,陈景燕,王思玮.基于消费行为的Apriori算法研究[J].计算机工程,2003,29(5):72-73,118. |
| |
| 作者姓名： | 骆嘉伟 彭蔓蔓 陈景燕 王思玮 |
| |
| 作者单位： | 湖南大学计算机与通信学院,长沙,410082 |
| |
| 摘 要： | 介绍了关联规则的数据挖掘，对布尔关联规则中的经典算法－Apriori算法进行了分析和评价，指出了基本Apriori算法的不足，并提出具有广泛适应性的改进算法，此算法既提高在扫描数据库过程中的信息区率，又及时剔除超集不是频繁项集的项集，进一步缩减项集的潜在规模，提高了频繁项集生成的效率。
|
| 关 键 词： | 消费行为 Apriori算法 数据挖掘 关联规则 候选项集 频繁项集 数据库 |
| 文章编号： | 1000-3428(2003)05-0072-02 |
Research of Apriori Algorithm Based on Consumption Behavior |
| |
| LUO Jiawei,PENG Manman,CHEN Jingyan,WANG Siwei.Research of Apriori Algorithm Based on Consumption Behavior[J].Computer Engineering,2003,29(5):72-73,118. |
| |
| Authors: | LUO Jiawei PENG Manman CHEN Jingyan WANG Siwei |
| |
| Abstract: | This paper focuses on the concepts and techniques of data mining association rules. Through an improvement of the Apriori algorithm, it can enhance the information-gain ratio in database scanning, identify more quickly the supersets that are not members of the large itemsets, and, thus, reduce the size of the large itemsets. It decreases the size of candidate itemsets by deleting some items in them in order to increase the efficiency of generating large itemsets. |
| |
| Keywords: | Data mining Association rules Apriori algorithm Candidate itemsets Frequent itemsets |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
