Discovering the frequent set of item sequences in a transaction database is one of the most important tasks in mining association rules.
最大频繁项目序列集的生成是影响关联规则挖掘的关键问题,传统的算法是通过对事务数据库的多次扫描实现的。
In this paper, we mainly discuss a new method-to find a maximum frequent set based on the mining of relative set transaction database.
基于相关集合事务数据库这一挖掘思想,提出一个新的方法——寻找最大频繁集。
In this paper, we mainly discuss a new method-to find a maximum frequent set based on the mining of relative set transaction database.
基于相关集合事务数据库这一挖掘思想,提出一个新的方法——寻找最大频繁集。
应用推荐