基于语义的无限制等级战场信息服务匹配算法  

Semantic-Based Battlefield Information Service Matchmaking Algorithm with Unrestrictedly Divided Match Levels

作　　者：王珏[1] 赵文栋[1] 田畅[1] 成玉茜[2] 

机构地区：[1]解放军理工大学通信工程学院,南京210007 [2]中国国防科技信息中心,北京100142

出　　处：《火力与指挥控制》2013年第10期21-25,共5页Fire Control & Command Control

基　　金：国家重点基础研究发展计划(973)基金资助项目

摘　　要：针对经典语义服务匹配算法服务等级划分受限,匹配结果精度不高的问题,采用基于逻辑推理与基于相似度计算相结合的设计思路,提出了一种匹配等级无限制划分的战场信息服务匹配算法。可有效滤除伪匹配服务,节约战场带宽资源,理论分析及仿真表明,算法的查全率及查准率提高了约50%。Classical semantic service matchmaking algorithms have unsatisfied performance on the precision of service match result because of the limitation caused by the roughly dividing of math level. Combining logical reasoning and similarity computation,this paper proposes a service matching algorithm for battlefield information services,which makes match level unrestrictedly divided. The algorithm can filter out the pseudo-matching service effectively and offer considerable saving in the battlefield bandwidth resources. Theoretical analysis and simulation results show that the precision ratio and recall ratio of this algorithm increase by around 50 %.

关 键 词：语义 领域本体 服务匹配 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]