检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈华城[1] 杜学绘[1] 陈性元[1] 夏春涛[1]
出 处:《计算机应用》2012年第11期3030-3033,共4页journal of Computer Applications
基 金:国家973计划项目(2011CB311801);河南省科技创新人才计划(114200510001)
摘 要:随着计算机技术及互联网的高速发展,越来越多的办公主机接入互联网,敏感信息的泄露隐患增多,文档的敏感信息检测显得尤为必要。为了解决传统的查询扩展检测方法查准率和查全率低的问题,构建了监测者关于敏感信息的兴趣本体,提出基于兴趣本体的概念相似度查询扩展算法,并验证了算法的可行性。实验证明该算法有效提高了文档敏感信息检测的查全率和查准率。With the development of computer technology and Internet,more and more office hosts have been connected to Internet,the threat of sensitive information leakage becomes serious.Therefore,it is extremely necessary to detect whether documents contain sensitive information.In order to solve the low precision and low recall problems caused by the traditional query expansion retrieval methods,this paper built an ontology of sensitive information for users' interest,proposed a concept similarity query expansion algorithm based on the interest ontology,and described an experimental case to verify the feasibility of algorithm.The experimental results show that the proposed algorithm can improve the precision and recall of the traditional methods.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30