摘要
关联规则挖掘的核心问题是算法的效率和伸缩性,这就产生了基于约束的关联规则挖掘方法。关联规则挖掘中除了支持度和信任度外的约束外,最基本的是项目约束。本文总结和归纳了含有项目约束的关联规则挖掘的分类,并在算法Apriori的基础上,介绍了基于项目约束的关联规则的挖掘算法D irect。
The core of association rules mining is the problem of efficiency and scalability, this leads to the mining method of association rules containing item constraint. Besides the constraint of support and confidence, the essential constraint is item constraint. This paper concludes the classification of association rules containing constraint, and introduces the Apriori——an approach mining association rules based on item constraint.
出处
《湖北教育学院学报》
2006年第8期21-23,共3页
Journal of Hubei Institute of Education