检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京理工大学信息科学技术学院,北京100081
出 处:《Journal of Southeast University(English Edition)》2007年第3期385-388,共4页东南大学学报(英文版)
基 金:Foundation of Next Generation Internet of China
摘 要:A Kullback-Leibler(KL)distance based algorithm is presented to find the matches between concepts from different ontologies. First, each concept is represented as a specific probability distribution which is estimated from its own instances. Then, the similarity of two concepts from different ontologies is measured by the KL distance between the corresponding distributions. Finally, the concept-mapping relationship between different ontologies is obtained. Compared with other traditional instance-based algorithms, the computing complexity of the proposed algorithm is largely reduced. Moreover, because it proposes different estimation and smoothing methods of the concept distribution for different data types, it is suitable for various concepts mapping with different data types. The experimental results on real-world ontology mapping illustrate the effectiveness of the proposed algorithm.提出了一种基于Kullback-Leibler(KL)距离的本体映射方法.该方法将本体中每个概念抽象为一个概率分布,并通过相应的实例数据对其进行估计;对于不同本体的2个概念,通过计算相应概率分布之间的KL距离而求得其相似度.进而求得本体间概念的映射关系.该方法与传统的方法相比,极大地降低了计算的复杂度,并且此算法针对不同的数据类型提出了不同的概念分布的估计和平滑方法,所以能够适用于各种数值类型的概念映射.通过试验,证明了此方法的有效性.
关 键 词:semantic web ontology mapping Kullback-Leibler distance
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.231