摘要
提出了基于事务规则树改进的关联规则快速挖掘算法——FG算法。该算法不需要查找频繁项集,可直接求出所有无冗余的关联规则;将FG算法与其他算法进行实验比较,结果表明,FG算法在效率上优于其他算法,是有效的、可行的关联规则挖掘算法。
A quick and effective mining algorithm of association rules：FG algorithm based on the transaction rule-tree was put forward . It immediately mined all no redundancy rules by avoiding finding frequency itemsets. Based on the empirical result, compared the FG algorithm with other algorithms. The results indicated that the method was better than the other algorithms in the efficiency, and it was the feasible and validity.
出处
《计算机应用研究》
CSCD
北大核心
2007年第5期83-86,共4页
Application Research of Computers
基金
江苏省高校自然科学基金资助项目(05KJ520107)
南通大学自然科学基金资助项目(05Z061)
关键词
数据挖掘
关联规则
支持度
事务规则树
data mining
association rule
support
transaction rule-tree
