摘要
通过对两个有代表性的算法Apriori和FP-Growth的剖析,说明频集模式挖掘的过程,比较有候选项集产生和无候选项集产生算法的特点,并给出FP-tree结构的构造方法以及对挖掘关联规则的影响,提出了对算法的改进方法.
An anatomy of two representative arithmetics of the Apriori and the FP Growth explains the mining process of frequent patterns item set. The improved method is put forward by comparing the arithmetic characteristics of candidate item set and non candidate item set. The constructing method of FP tree structure is provided and how it affects association rule mining is discussed.
出处
《吉林大学学报(理学版)》
CAS
CSCD
北大核心
2003年第2期180-185,共6页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:60175024)
教育部科学技术研究重点项目(批准号:02090)
教育部"符号计算与知识工程"重点实验室资助项目.