摘要： 研究了在大型事务数据库中挖掘有约束条件的关联规则问题;给出了约束频繁模式树的定义;提出了一种基于约束频繁模式树的约束关联规则挖掘算法,并与其它相应算法进行了比较,实验结果表明算法是有效的。-CFPTACFPTA

关键词: 数据挖掘, 关联规则, 项目约束

Abstract: This paper discusses the problem of discovering constrained association rules between items in a large database of sales ,.,transaction and a new algorithm is presentedComparing with other algorithmsthe author also offers some experiments to show .that the new algorithm is more efficient

中图分类号: 

• TP311.12