Secondly we mine multidimensional frequent items set and generate association rules.
第二步是求基于多维的频繁项集的算法的实现及关联规则生成。
This paper also discusses how to set the optimal minimum support for the common association rules mining algorithm, which can guarantee the frequent items are the weighted frequent items' superset.
同时,给出了最优的最小支持度设定方法,保证了普通关联规则算法所产生的频繁集为加权频繁集的超集。
This paper also discusses how to set the optimal minimum support for the common association rules mining algorithm, which can guarantee the frequent items are the weighted frequent items' superset.
同时,给出了最优的最小支持度设定方法,保证了普通关联规则算法所产生的频繁集为加权频繁集的超集。
应用推荐