摘要
提出了基于文本数据库的完全加权词间关联规则挖掘算法,给出了与其相关的定理及其证明过程。该算法采用三种剪枝策略,候选项集数量和挖掘时间明显减少,提高了挖掘效率。实验结果表明该算法的有效性,和现有算法比较,挖掘效率确实得到改善和提高。
A novel algorithm of item-all-weighted association rule mining between terms from the text database is proposed. A related theorem and its proof are given. The thrice pruning strategy is used in the algorithm, and the number of candidate itemsets and mining time are reduced substantially. The mining efficiency is improved. Experimental results also show effectiveness of the algorithm. Compared with the existing algorithms, the mining efficiency of our algorithm is really improved.
出处
《广西师范大学学报（自然科学版）》
CAS
北大核心
2007年第4期24-27,共4页
Journal of Guangxi Normal University:Natural Science Edition
基金
国家自然科学基金资助项目(60496327
60463003)
关键词
关联规则
数据挖掘
项完全加权
完全加权关联规则
association rules
data mining
all-weighted item
all-weighted association rules
