| 数据挖掘中关联规则算法的研究 |
| |
| 引用本文： | 程玉,熊英.数据挖掘中关联规则算法的研究[J].人天科学研究,2009(11). |
| |
| 作者姓名： | 程玉 熊英 |
| |
| 作者单位： | 湖北工业大学计算机学院 |
| |
| 摘 要： | Apriori算法是关联规则挖掘中的经典算法。通过对Apriori算法的基本思想和性能的研究分析,提出了一种基于垂直事务列表的树形结构的挖掘算法,减少了候选频繁项集的数量,提高了挖掘算法的效率。实验结果表明新算法具有良好的性能。
|
| 关 键 词： | 数据挖掘 关联规则 Apriori算法 频繁项集 |
Research on Algorithms for the Association Rules in Data Mining |
| |
| Abstract: | Mining association rule is an important task in data mining research field,its purpose is to mine interesting associations in transaction database.Apriori algorithm is a classical algorithm traditional association rule.Based on the study of principle and efficiency of the Apriori algorithm,in this paper it points out a tree structure algorithm based vertical tid-list to resolve the frequent itemsets pro-poses in Apriori,and improve the efficiency of mining algorithm,It reduces the number of alternatives and... |
| |
| Keywords: | Data Mining Association Rules Apriori Algorithm Frequent Itemsets |
| 本文献已被 维普 等数据库收录！ |
|
