首页> 外文学位 >Towards mutual understanding: Rule-based and learning-based matching algorithms for ontologies.
【24h】

Towards mutual understanding: Rule-based and learning-based matching algorithms for ontologies.

机译:走向相互理解:本体的基于规则和基于学习的匹配算法。

获取原文
获取原文并翻译 | 示例

摘要

Ontologies are formal, declarative knowledge representation models. They form a semantic foundation for many domains, such as Web services, E-commerce, service-oriented computing, and the Semantic Web. As the Semantic Web gains attention as the next generation of the Web, the importance of ontologies increases accordingly. However, because their designers have different conceptual views of the world, the resultant ontologies are heterogeneous. The heterogeneity can lead to misunderstandings, so there is a need for ontologies from different partners to be related and to reuse, wherever possible, each other's concepts. The availability of a global ontology can mitigate the heterogeneity, but it is infeasible, as verified by both theory and practice; an alternative manual matching process is time-consuming and error-prone, and cannot scale. Therefore, tools for ontology matching are in great need.;However, performing ontology matching automatically is an extremely difficult task. Much research has been done on this topic and the suggested approaches can be categorized as either rule-based or learning-based. The former works on ontology schema information, and the latter considers both schemas and instance data.;The approach described in this thesis makes six assumptions to bound the matching problem, and explains the assumptions and the bounds they provide. Then, three systems are presented towards the mutual reconciliation of concepts from different ontologies: (1) the Puzzle system belongs to the rule-based approach; (2) the SOCCER (Similar Ontology Concept ClustERing) system is mostly a learning-based solution, integrated with some rule-based techniques; and (3) the Compatibility Vector system, although not an ontology-matching algorithm by itself, instead is a means of measuring and maintaining ontology compatibility, which helps in the mutual understanding of ontologies and determines the compatibility of services (or agents) associated with ontologies.
机译:本体是形式化的,声明性的知识表示模型。它们为许多领域构成了语义基础,例如Web服务,电子商务,面向服务的计算和语义Web。随着语义Web作为下一代Web的关注,本体的重要性也随之增加。但是,由于他们的设计师对世界有不同的概念性看法,因此产生的本体是异构的。异质性可能导致误解,因此需要将来自不同合作伙伴的本体关联起来,并尽可能地重用彼此的概念。全局本体的可用性可以减轻异质性,但正如理论和实践所证明的那样,这是不可行的。另一种手动匹配过程既耗时又容易出错,并且无法扩展。因此,迫切需要用于本体匹配的工具。然而,自动执行本体匹配是非常困难的任务。关于此主题已进行了大量研究,建议的方法可以归类为基于规则或基于学习的方法。前者研究本体模式信息,后者考虑模式和实例数据。本文所描述的方法提出了六个假设来约束匹配问题,并解释了它们所提供的假设和范围。然后,提出了三种系统,以实现来自不同本体的概念的相互和解:(1)拼图系统属于基于规则的方法; (2)SOCCER(类似本体概念聚类)系统主要是基于学习的解决方案,并结合了一些基于规则的技术; (3)Compatibility Vector系统,尽管它本身不是本体匹配算法,而是一种度量和维护本体兼容性的方法,它有助于相互理解本体并确定与之关联的服务(或代理)的兼容性。本体。

著录项

  • 作者

    Huang, Jingshan.;

  • 作者单位

    University of South Carolina.;

  • 授予单位 University of South Carolina.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2007
  • 页码 130 p.
  • 总页数 130
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号