检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:廖明涛[1] 张德运[1] 侯琳[2] 李金库[1]
机构地区:[1]西安交通大学网络研究所,西安710049 [2]西安建筑科技大学信息与控制工程学院,西安710055
出 处:《西安交通大学学报》2006年第12期1393-1396,共4页Journal of Xi'an Jiaotong University
基 金:国家高技术研究发展计划资助项目(2003AA148010);国家火炬计划资助项目(2005EB011484)
摘 要:为了实现网络信息审计系统中的实时网页分类,提出了一种基于Dempster-Shafer证据理论的分类新方法.其基本思路是:不进行IP分片包重组,直接将网页地址特征和分片数据包作为分类的证据,计算各个证据对类的支持度,然后利用Dempster证据组合规则将各种证据提供的信息进行不断地在线融合判决,并最终给出网页的分类结果.当已有证据可以对网页进行有效分类时,对后续数据包不再做进一步处理.实验结果表明,所提方法的查准率大于83%,查全率大于90%,在分类性能和运行时间上均优于已有的基于分片的模糊K最近邻分类算法.To accomplish the categorization of real-time web page in network information audit systems, a new method based on Dempster-Shafer evidence theory is proposed. The main idea of it is as follows: the web page address and fragments are regarded as the evidence of categorization without reassembling IP fragments, and then the support degree that each of evidence stands up for a category is calculated. The Dempster combination rule is used to continuously fuse and adjudge the information provided by various evidences online, and finally the categorized result is obtained. When the existing evidences can efficiently categorize the web page, the subsequence fragments are no need to be handled further. The experiment shows that the precision rate and recall rate of the proposed method are larger than 83% and 90% respectively, and it is superior to the fuzzy K nearest neighbor algorithm based on fragments in the categorization performance and running time.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7