摘要
在对海量数据库进行关联规则开采时 ,项目集支持度和规则置信度的计算是一件十分耗时的工作 ,本文提出一种利用已知项目集的支持度信息来计算未知项目集支持度和规则置信度上下界的算法 ,可减少生成不必要的项目集 ,从而大大缩短数据开采的时间 .
the evaluation of support and confidence of itemsets is a time consuming work in the process of mining association rules in very large databases. In this paper, we propose an algorithm that evaluate the boundaries of support and confidence of uncalculated itemsets using the informations of calculated itemsets, it results in greatly decreasing the number of unnecessary itemsets, furthermore, the time of data mining is reduced remarkably.
出处
《小型微型计算机系统》
EI
CSCD
北大核心
2000年第8期851-854,共4页
Journal of Chinese Computer Systems
基金
:国防预研基金赞助
