一种基于哈希技术的文本关联规则算法  

A Text Algorithm under Association Rule Based on Hash Technology

作　　者：耿新青[1] 娄亚斌[1] 张恩胜[1] 

机构地区：[1]鞍山师范学院数学系,辽宁鞍山114007

出　　处：《鞍山师范学院学报》2007年第6期36-39,共4页Journal of Anshan Normal University

摘　　要：采用新的关键字的获得方法,并基于DHP算法提出一种新的高效的文本关联规则算法.根据TF.IDF公式计算特征词的权重,特征词的平均权重作为阈值,权重大于阈值的特征词作为该文本的关键词,将关键词的权重用到本文的算法ARTREE中,抽取出文本的关联规则.本文算法和Apriori算法相比,具有运算效率高、规则的精度高的优点.实验验证本算法的有效性.This paper proposes a new effective text algorithm under association rule by acquiring the keywords based on DHP algorithm.According to the weight of the eigen word in TF.IDF,the average weight is used as the threshold of the eigen word,and the one whose weight is bigger than threshold is used as the keyword.Therefore,the weight of the keyword is applied to ARTREE algorithm to derive the association rule.It is proved that,compared to Apriori algorithm,ARTREE algorithm is more efficient and accurate.

关 键 词：哈希技术 文本 关联规则 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]