期刊文献+

核方法驱动的本体函数迭代算法

Kernel Method-driven Ontology Function Iterative Algorithm
下载PDF
导出
摘要 机器学习算法在本体中的运用集中在本体最优函数的学习,即通过本体样本点和适当的学习策略得到最优实值函数.核函数由于其在再生性和重构函数上的诸多优点,而被广泛运用于机器学习算法中.在本体函数的优化学习过程,将核方法融入迭代策略中,进而可得到最优的本体函数.实验结果表明,该方法对特定领域本体相似度的计算和本体映射的构建具有较高的准确率. The application of machine learning algorithms in ontology focuses on the learning of ontology optimal functions,that is,the optimal real-valued functions are obtained through ontology sample points and appropriate learning strategies. Kernel functions are widely used in machine learning algorithms due to their many advantages in regenerative and reconstruction functions. In the optimization learning process of ontology function,the kernel method is integrated into the iterative strategy to obtain the optimal ontology function. The experimental results show that the proposed method has higher accuracy for the calculation of ontology similarity and the construction of ontology mapping in specific domains.
作者 兰美辉 高炜 LAN Meihui;GAO Wei(College of Information Engineering,Qujing Normal University,Qujing,Yunnan,China655011;College of Information Science and Technology,Yunnan Normal University,Kunming,Yunnan,China650500)
出处 《昆明学院学报》 2019年第6期97-102,共6页 Journal of Kunming University
基金 国家自然科学基金资助项目(61262071) 云南省教育厅科学研究基金资助项目(2014C131Y)
关键词 本体 相似度计算 本体映射 核矩阵 ontology similarity measure ontology mapping kernel matrix
  • 相关文献

参考文献6

二级参考文献47

  • 1徐天伟,黄晓,周菊香,高炜.随机学习规则下的可学习性和LOO稳定性分析(英文)[J].苏州大学学报(自然科学版),2012,28(4):30-35. 被引量:1
  • 2Mork P, Bernstein P. Adapting a generic match algorithm to align ontologies of human anatomy[C]. 20th International Conf. on Data Engineering, Los Alamitos, CA, USA, Publisher: IEEE Comput. Soc. , 2004: 787-790.
  • 3Fonseca F, Egenhofer M, Davis C, et al. Semantic granularity in ontology-driven geographic information systems [J]. AMAI Annals of Mathematics and Artificial Intelligence-Special Issue on Spatial and Temporal Granularity, 2002, 36(1-2) : 121-151.
  • 4Bouzeghoub A, Elbyed A. Ontology mapping for web- based educational systems interoperability [ J ]. Interoperability in Business Information Systems, 2006, 1(1): 73-84.
  • 5Rajaram S, Agarwa| S, Generalization bounds for k- partite ranking[C]. Proceedings of the NIPS-2005 Workshop on Learning to Rank, 2005.
  • 6Amini M, Truong T, Goutte C. A boosting algorithm for learning bipartite ranking functions with partially labeled data [C]. 31st Annual International ACMSIGIR Conference on Research and Development in Information Retrieval, Singapore: 2008: 99-106.
  • 7Vogt C, Cottrell G. Fusion via a linear combination of scores[J]. Information Retrieval, 1999, 1(3): 151- 173.
  • 8Freund Y, lyer R, Sehapire R, et al. An efficient boosting algorithm for combining preferences [J]. Journal of Machine Learning Research, 2004, 4 : 933- 969.
  • 9http: //www. geneontology, org.
  • 10Craswell N, Hawking D. Overview of the TREC 2003 web track [C]. Proceedings of the Twelfth Text Retrieval Conference. Gaithersburg, Maryland, NIST Special Publication, 2003: 78-92.

共引文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部