首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于k-部排序学习方法的本体映射算法
引用本文:兰美辉,高炜.基于k-部排序学习方法的本体映射算法[J].苏州科技学院学报(自然科学版),2012,29(2):60-62,71.
作者姓名:兰美辉  高炜
作者单位:1. 曲靖师范学院计算机科学与工程学院,云南曲靖,655011
2. 云南师范大学信息学院,云南昆明650092/苏州大学数学科学学院,江苏苏州215006
基金项目:国家自然科学基金资助项目
摘    要:本体映射作为实现多本体间相互操作的重要手段,已广泛应用于诸多领域。利于k-部排序学习算法得到最优排序函数,从而将多本体结构图中每个顶点映射成一个实数,通过比较来自不同本体顶点对应实数间的差值判断概念间的相似程度。实验表明:该方法对于在不同本体间建立映射是有效的。

关 键 词:本体  本体映射  南一部排序  排序亏损函数

Ontology mapping based on k-partite ranking learning method
LAN Meihui,GAO Wei.Ontology mapping based on k-partite ranking learning method[J].Journal of University of Science and Technology of Suzhou,2012,29(2):60-62,71.
Authors:LAN Meihui  GAO Wei
Institution:2,3(1.College of Computer Science and Engineering,Qujing Normal University,Qujing 655011,China;2.School of Information Science and Technology,Yunnan Normal University,Kunming 650092,China;3.School of Mathematical Sciences,Suzhou University,Suzhou 215006,China)
Abstract:Ontology mapping,as an important means of multi-ontology mutual operations,has been widely used in many fields.The optimized ranking function was obtained by using k-partite ranking learning method.The function mapped the vertices of the graph into real numbers.The similarities of the concepts from different ontologies were calculated by comparing the difference of their corresponding values.The experiment shows that the method for building mapping among different ontologies is efficient.
Keywords:ontology  ontology mapping  k-partite ranking  ranking loss function
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号