本体中is a层次的构建与本体集成*

首先给出了本体中isa层次的构建方法,并提出了isa层次中删除概念的算法;其次,分析了本体集成的原因,给出了本体集成的分类、三种集成方式和四条集成原则;最后,提出一种基于OWL (Web ontology language)的本体集成算法,实验证明此算法可行。     

本体在XML信息源集成中的应用

提出了一种应用本体解决XML信息集成中语义异构的方案,设计了一个基于本体(Ontology)的XML信息集成框架。同时介绍了一种本体表示方法,并通过本体到XML Schema的映射算法,实现了对XML信息源语义层次上的有效性验证。最后阐述了XML信息查询算法,使用户可以通过本体方便地对异构XML信息源进行查询。     

基于本体语义映射的数据集成机制研究

数据集成的难点是如何解决数据之间的语义异构问题,本文利用本体在语义集成上的优点,提出了一种基于本体语义映射的数据集成框架。根据本体概念的定义及其结构,给出了一种本体语义映射算法,该算法通过属性集合间的比较确定概念语义关系,在计算概念相似度时,考虑了概念名称、概念属性集合和相关概念的语义信息。最后通过概念的属性集映射算法和概念映射算法实现了本体语义映射,从而重点解决了数据集成中的语义映射问题。     

基于OWL的本体集成

提出一种新的本体集成方法。分析了本体集成的原因,阐述了本体集成时应遵循的4条基本原则,并给出了集成的分类,提出了一种基于OWL DL图闭包的本体集成方法。该方法将OWL DL本体抽象为RDFS图模型,根据给定的OWL DL推理规则生成OWL DL本体的图闭包,在此基础上进行本体集成,同时提出了几种计算实体相似度的方法,将本方法与COMA++和FCA-merge进行实验对比,本方法在准确率和召回率上占优势。     

基于混合本体方法的集成算法研究

本文提出了一种基于混合本体的集成算法。该方法充分利用了领域知识模型以及局部本体之间存在的语义相关性，从语义匹配的角度探讨了构造新的全局本体的可能。本文还重点讨论了n个局部本体如何构造全局本体的算法；最后介绍了一个本体构造系统，并结合项目给出了具体实例。     

浅析本体科技信息集成框架SIIF

文章阐述了基于本体的信息集成的三种方法:单本体方法、多本体方法和混合本体方法,在此基础上提出了基于本体的科技信息集成框架(SIIF)及其组成的三个层次:应用层、查询处理层、信息资源层。并且对各个层次功能进行介绍,实现对异构数据源的语义集成。     

一种基于本体的语义检索算法

本体技术作为一种能在语义和知识层次上描述概念体系的有效工具,在数字图书馆得到了广泛的关注。给出了本体结构及其词法的形式化定义。为解决RDF在语义检索中存在的问题,利用Jena工具,提出了一种提取和处理RDF层本体处理方法,给出了一种基于本体的语义检索算法。算法基于软件工程的思想,忽略不同的本体语言、本体的RDF层集合间的差异。算法分五步骤进行,包括：将RDF层本体信息从网页中分离并构建RDF模型、对RDF模型进行集合运算、RDF层本体的查询、修正RDF层本体以及对RDF层本体的序列化。实验结果表明缩短了查询时间,提高了检索的查全率及查准率。     

旅游本体的概念相似度算法改进

传统的基于信息内容的概念相似度算法在计算信息内容值时过于依赖语料库,给出一个新的只通过WordNet结构计算概念语义相似度的信息内容模型。该模型以WordNet的is-a关系为基础,不仅考虑了概念所包含的子节点个数和所处深度,而且将该概念所处的簇及父节点的信息内容值引入到模型中,使得概念的信息内容值更为精确。实验结果显示将该模型应用到领域本体的概念相似度计算中,可以明显提高现有相似度算法的性能。     

基于范畴论的本体集成描述

针对语义Web中的本体异构问题,提出一种基于范畴论的本体集成描述方法。与集合论相比,范畴论具有更高的抽象性和更强、更直观的表达力,是本体集成形式化嗟理想工具。把本体结构作为对象,范畴论中的“态射”可描述本体映射,“外推”可描述本体合并,运用图例进行说睨并给出本体合并算法。     

基于本体的装备领域信息集成研究

装备信息集成中存在着大量的语义异构数据源,阻碍了信息的共享和交换.本体可以描述信息之间隐含的关系.在语义和知识层次上描述信息系统的概念模型,有效地解决信息集成中的语义异构问题.通过对基于本体的信息集成方法的分析,采用Wrapper/Mediator架构,提出了基于混合本体的装备基础信息集成框架,给出了框架的层次结构和关键技术.结合实际对基于本体的装备指标体系构建和查询处理问题进行了研究,验证了基于本体的信息集成方法在装备领域信息集成中的可行性和有效性.     

On ontology

A previously unpublished text by I. Kh. Shmain [On Ontology] written as a letter to V. B. Borshchev, a member of the editorial board of the collection NTI is presented below.     

基于跨语本体重用的维语本体构建方法

针对维英本体共性知识的获取问题,提出一种基于跨语本体重用的快速构建维语领域本体方法。该方法将初始维语本体转换为英语本体,通过本体选择、映射和合并等过程对其丰富,达到一定阈值,转换为维语本体。提出了数据源势、本体势等概念和构建维语本体的数据模型。基于该方法构造了一个旅游领域本体实例,转换率达到78.8%,充分验证了该方法的可行性与有效性。     

基于本体翻译的领域本体自动构建

手工构建本体是一项既费时又费力的工作,为解决此项工作的瓶颈问题,本体自动构建成为当前的一个研究热点和重点。考虑到不同语言描述的本体在本质上是相同的,只是表层的表示符号不同,提出了一种基于本体翻译的领域本体自动构建算法,该算法针对已存在本体中概念标签的不同情况,分别采用不同的统计指标来筛选标签的目标语翻译。通过将一个英文金融本体翻译成中文对算法进行了实验验证,说明了算法的有效性。     

Supply chain management ontology from an ontology engineering perspective

Knowledge sharing and reuse are important factors affecting the performance of supply chains. These factors can be amplified in information systems by supply chain management (SCM) ontology. The literature provides various SCM ontologies for a range of industries and tasks. Although many studies make claims of the benefits of SCM ontology, it is unclear to what degree the development of these ontologies is informed by research outcomes from the ontology engineering field. This field has produced a set of specific engineering techniques, which are supposed to help developing quality ontologies. This article reports a study that assesses the adoption of ontology engineering techniques in 16 SCM ontologies. Based on these findings, several implications for research as well as SCM ontology adoption are articulated.     

A K-way spectral partitioning of an ontology for ontology matching

Ontology matching, the process of resolving heterogeneity between two ontologies consumes a lot of computing memory and time. This problem is exacerbated in large ontology matching tasks. To address the problem of time and space complexity in the matching process, ontology partitioning has been adopted as one of the methods, however, most ontology partitioning algorithms either produce incomplete partitions or are slow in the partitioning process hence eroding the benefits of the partitioning. In this paper, we demonstrate that spectral partitioning of an ontology can generate high quality partitions geared towards ontology matching.     

A linguistic ontology

This paper defends the choice of a linguistically-based content ontology for natural language processing and demonstrates that a single common-sense ontology produces plausible interpretations at all levels from parsing through reasoning. The paper explores some of the problems and tradeoffs for a method which has just one content ontology. A linguistically-based content ontology represents the "world view" encoded in natural language. The content ontology (as opposed to the formal semantic ontology which distinguishes events from propositions, and so on) is best grounded in the culture, rather than in the world itself, or in the mind. By "world view" we mean naive assumptions about "what there is" in the world, and how it should be classified. These assumptions are time-worn and reflected in language at several levels: morphology, syntax and lexical semantics. The content ontology presented in the paper is part of a Naive Semantic lexicon, Naive Semantics is a lexical theory in which associated with each word sense is a naive theory (or set of beliefs) about the objects or events of reference. While naive semantic representations are not combinations of a closed set of primitives, they are also limited by a shallowness assumption. Included is just the information required to form a semantic interpretation incrementally, not all of the information known about objects. The Naive Semantic ontology is based upon a particular language, its syntax and its word senses. To the extent that other languages codify similar world views, we predict that their ontologies are similar. Applied in a computational natural language understanding system, this linguistically-motivated ontology (along with other native semantic information) is sufficient to disambiguate words, disambiguate syntactic structure, disambiguate formal semantic representations, resolve anaphoric expressions and perform reasoning tasks with text.     

Axiom-based ontology matching

Abstract: Managing multiple ontologies is now a core question in most of the applications that require semantic interoperability. The semantic web is surely the most significant application of this report: the current challenge is not to design, develop and deploy domain ontologies but to define semantic correspondences among multiple ontologies covering overlapping domains. In this paper, we introduce a new approach of ontology matching named axiom-based ontology matching. As this approach is founded on the use of axioms, it is mainly dedicated to heavyweight ontologies, but it can also be applied to lightweight ontologies as a complementary approach to the current techniques based on the analysis of natural language expressions, instances and/or taxonomical structures of ontologies. This new matching paradigm is defined in the context of the conceptual graphs model, where the projection (i.e. the main operator for reasoning with conceptual graphs which corresponds to homomorphism of graphs) is used as a means to semantically match the concepts and the relations of two ontologies through the explicit representation of the axioms in terms of conceptual graphs. We also introduce an ontology of representation, called MetaOCGL, dedicated to the reasoning of heavyweight ontologies at the meta-level.