检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安交通大学电子与信息工程学院,西安710049
出 处:《西安交通大学学报》2005年第4期376-379,共4页Journal of Xi'an Jiaotong University
摘 要:提出了一种基于关联规则的垃圾邮件挖掘算法,通过计算邮件源地址和邮件关键词的支持度来定位垃圾邮件源地址.该算法在Apriori算法基础上进行了改进,增加了邮件源地址和关键词约束,与基于关键词过滤算法相比提高了准确率,与基于语义分析的过滤算法相比降低了算法复杂度.实验结果表明,该算法的误判率在邮件数量增加到350封时会减小到4%,其过滤速度也会随着邮件的增加而提高.A method for mining junk e-mails based on association rules was proposed. The supporting rate of key words and source addresses were computed for determining junk e-mails. Adding restraints of source addresses and key words, the algorithm is improved on the basis of Apriori algorithm. The algorithm is more accurate than the e-mails filtering algorithms based on key words, and its complexity is less than the algorithm based on semantic analysis. The experiments results show that the error judgment rate is reduced to 4 percent when the number of e-mails reaches to 350, and the filtering speed is increased with increasing the amount of e-mails.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28