检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]河南理工大学计算机科学与技术学院,焦作454150 [2]上海大学计算机工程与科学学院,上海200072
出 处:《计算机科学》2008年第12期200-202,共3页Computer Science
基 金:国家自然科学基金(项目批准号60575035)
摘 要:为了提高信息检索的查全率和查准率,经常要处理相似的概念,因此计算概念间的相似度是必要的。OWL中的概念有如下两个特点:概念按照继承关系形成了一个层次结构的分类树,子概念继承父概念的属性;概念的属性由断言条件定义。概念相似度计算分为两步:首先,递归计算相同属性的数量;然后,根据相同属性的数量计算概念相似度。计算模型利用了OWL的较为完整的信息,计算结果与人为判断基本吻合。In order to improve the recall and precision, similar concepts are often processed during the information retrieval. With this regard, the possibility of evaluating concept similarity is acquiring an increasing relevance, since it allows the identification of different concepts that are semantically close. Concepts in owl have two features. Firstly, as son concepts inherit their father concepts' attributes, so all concepts form a hierarchical taxonomy tree. Secondly, concept's attributes are defined by asserted conditions including the ones inherit their father concept's. The computing model also has two parts. First part is using reeursive algorithm to compare concepts' attribute similarity. The second part is to calculate concept similarity by using the amount of same attributes.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222