节点文献

数据挖掘中关联规则算法的研究

Research on Algorithms for the Association Rules in Data Mining

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 程玉熊英

【机构】 湖北工业大学计算机学院

【摘要】 Apriori算法是关联规则挖掘中的经典算法。通过对Apriori算法的基本思想和性能的研究分析,提出了一种基于垂直事务列表的树形结构的挖掘算法,减少了候选频繁项集的数量,提高了挖掘算法的效率。实验结果表明新算法具有良好的性能。

【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 improve the efficiency of min-ing algorithm.Experimental results show it has a good performance.

  • 【分类号】TP311.13
  • 【被引频次】1
  • 【下载频次】191
节点文献中: 

本文链接的文献网络图示:

本文的引文网络