摘要
在大型数据库关联规则开采过程中,采用动态项目集计算算法寻找大项目集,以空间换取时间方法提高执行效率.同时,用坚信度作为构造关联规则的依据,更好地反映逻辑上的因果关系.
The technique of mining association rules in large databases is investigated. From a func- tional perspective, the method is developed, based on itemset counting algorithm for finding large itemsets in order to improve efficiency by giving up space to get time. From a semantic perspective, the conviction is used for the standard of generating association rules that are normalized based on both the antecedent and the consequent.
出处
《华中理工大学学报》
CSCD
北大核心
1998年第10期60-61,67,共3页
Journal of Huazhong University of Science and Technology
关键词
数据开采
大项目集
数据库
关联规划
data mining
large itemset
conviction Ning Li Postgraduate
College of Computer Sci. & Tech., HUST, Wuhan 430074, China.