摘要
在关联规则挖掘中,Apriori和FP-tree是两种最基本的算法.文章讨论这两种算法的基本思想、数据挖掘步骤、优缺点并以具体的实例描述两种算法的实现过程.深入分析这两种算法为关联规则挖掘算法的扩展和改进奠定了基础.
Apriori algorithm and FP-tree algorithm are two basic methods in association rule data minging.In the paper,the main ideas of the two algorithms,data mining steps,advantages and disadvantages are discussed.At the same time,specific examples are given to describe the implementation process of the two algorithms.The detailed analysis above provides foundation for the improvement of the accociation rule mining algorithm.
出处
《淮北煤炭师范学院学报(自然科学版)》
CAS
2010年第2期44-49,共6页
Journal of Huaibei Coal Industry Teachers College(Natural Science edition)