刘培奇, 卢麟, 廖福燕, 宋阳. 基于一次性数据库访问策略的关联规则挖掘算法的研究[J]. 微电子学与计算机, 2010, 27(12): 22-25.
引用本文: 刘培奇, 卢麟, 廖福燕, 宋阳. 基于一次性数据库访问策略的关联规则挖掘算法的研究[J]. 微电子学与计算机, 2010, 27(12): 22-25.
LIU Pei-qi, LU Lin, LIAO Fu-yan, SONG Yang. The Research on the Mining Association Rules Algorithm Based on the Strategy Accessing to Database Once[J]. Microelectronics & Computer, 2010, 27(12): 22-25.
Citation: LIU Pei-qi, LU Lin, LIAO Fu-yan, SONG Yang. The Research on the Mining Association Rules Algorithm Based on the Strategy Accessing to Database Once[J]. Microelectronics & Computer, 2010, 27(12): 22-25.

基于一次性数据库访问策略的关联规则挖掘算法的研究

The Research on the Mining Association Rules Algorithm Based on the Strategy Accessing to Database Once

  • 摘要: 针对大型数据库挖掘中需要多次访问数据库和效率较低的局限性, 提出一次性数据库访问策略, 设计了基于Apriori的AprioriADO算法.经过实验分析, AprioriADO算法降低了算法的时间和空间开销, 提高了关联规则挖掘效率.算法具有很强的实用性, 已用于超市中顾客消费知识的挖掘, 并取得了满意的结果.

     

    Abstract: This article analyzes the Apriori algorithm, and points out the limitations that it requires many accesses in the large-scale database mining and its efficiency is low.Based on the strategy accessing to DB once, it designs AprioriADO algorithm based on the Apriori.This algorithm avoids cutting frequently.Experimental analysis shows that the new improved AprioriADO algorithm reduces the time and space, and improves the mining efficiency of association rules.AprioriADO algorithm has strong practicality;it has been used for supermarkets in customer consumer knowledge mining, and has achieved satisfying results.

     

/

返回文章
返回