摘要
分析了基于频繁模式的关联规则算法Fptree,给出了一种基于二进制表示的改进算法,详细介绍了该算法的主要思想,算法实现方案。并通过实例比较了两种算法,证明新算法提高了挖掘规则的效率。
The association algorithm based on frequent pattern was analyzed in this paper, and an improved binary algorithm was put forward. The main idea of algorithm and application were introduced. Comparing two algorithms through some instance certifies that the data mining efficiency was improved by new algorithm.
出处
《河北省科学院学报》
CAS
2006年第3期51-53,共3页
Journal of The Hebei Academy of Sciences
关键词
关联规则
频繁模式
数据挖掘
Association rules
Frequent pattern
Data mining
