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

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

一种基于语义网中本体的排序算法

为提高本体的重用度,出现了许多本体搜索引擎.但由于其排序算法的局限性,效果都不理想.该文通过分析已有的本体排序算法,并针对排序结果与用户查询的相关性低以及检索响应时间过长等不足,给出了改进ImOntoRank算法.实验结果表明,改进后的算法可以满足用户的需求.     

一种基于加权领域本体的语义检索方法

提出了新方法WOSR,以对已经被本体概念标注的领域信息资源进行语义检索.WOSR方法首先建立领域本体,再采用均等概率分布方法为概念赋权,然后通过概念的权重求出概念相似度,最后计算用户检索请求和信息资源之间的语义相似度,并根据相似度的大小排序输出检索结果.实验结果表明,WOSR方法比其他经典方法的检索效果更好.     

基于本体的关系数据库语义检索

以经济学领域本体为例,首先研究SemSORD基本原理和方法,然后提出基于关系数据库关键词检索(Keyword Search over Relational Databases,KSORD)技术实现的关系数据库语义检索模型,并实现相应的原型系统Si-SEEKER,最后提出该领域的研究挑战和技术发展趋势.     

基于本体的关系数据库语义检索

以经济学领域本体为例,首先研究SemSORD基本原理和方法,然后提出基于关系数据库关键词检索(Keyword Search over Relational Databases,KSORD)技术实现的关系数据库语义检索模型,并实现相应的原型系统Si-SEEKER,最后提出该领域的研究挑战和技术发展趋势。     

基于本体的语义检索技术

基于本体的语义检索是建立在语义Web的基础上的检索技术。与传统的检索技术相比,它能提高检索的精度,减少了不相关的返回结果。使用句子成分进行实体的实例的初步创建,然后通过已经构造好的领域本体把实例和实体进行映射,从而构建领域本体的实例,通过对实例进行索引,达到概念级检索的目的。首先介绍了语义Web和本体的基本概念。然后详细讨论了基于本体的语义检索的实现的具体步骤及方法。最后分析了该方法的不足。     

基于本体语义检索技术研究

络信息的激增和多样化给有效的信息检索带来了种种困难,目前的检索工具仅提供了基于关键字的检索,而忽视了关键字本身所含的语义内容。本文提出的图书信息检索系统利用本体论中概念规范、语义丰富的特点将用户的检索要求扩充成语义集,并且将检索到的文档通过文档分析器进一步过滤,使用户最终得到与检索要求内容匹配度较高的 的文档。     

基于本体语义检索技术研究

网络信息的激增和多样化给有效的信息检索带来了种种困难,目前的检索工具仅提供了基于关键字的检索,而忽视了关键字本身所含的语义内容.该文提出的图书信息检索系统,利用本体论中概念规范、语义丰富的特点,将用户的检索要求扩充成语义集.并且将检索到的文档通过文档分析器进一步过滤,使用户最终得到与检索要求内容匹配度较高的文档.     

一种改进的基于语义距离的模糊数据库检索技术

模糊数据库检索是信息检索技术的一个重要分支。本文将语义距离引入模糊数据库中,并且结合模糊逻辑理论,提出了一种改进的语义距离计算方法,构造了一种新的实现模糊数据库数据检索的框架。     

专家视图与本体视图的语义映射方法

由于本体具有强大的知识表示和推理能力,本体已经在很多领域得到了广泛应用.然而,本体的深入应用还面临着很多深层次的共性语义映问题,已有的本体建模方法仅仅提出了一些简单的指导原则和基本步骤,使得知识工程师仍然无从下手.在基于领域专家知识构建领域语义知识库时,针对领域专家知识中的一词多义、多元关系和安全需求等3类共性语义映射问题,从5个方面展开了深入研究,提出了相应的语义映射方法,总结了10条本体建模约定.最后构建了一个完整的应用案例,并对所提出的5类语义映射方法进行了评价.     

基于进化分布式本体的语义Web服务动态发现

在语义Web服务中,确认分布式本体变动、维护其一致性并实现基于进化的分布式本体的Web服务语义查询成为了一个重要挑战．该文使用SHOQ(D)的分布式描述逻辑扩展(DDL)描述相互关联的异构分布式本体,提出了优先分布式知识库(PDK)的概念,探讨了PDK方法的一些重要属性．PDK用来描述分布式本体的进化和更新,它适用于语义Web服务环境．基于PDK,文中还给出了相应的语义查询方法,Web服务的语义查询可以归结为检测同这个查询对应的概念在最优先PDK中的p-可满足性．     

Constructing Consensus Ontologies for the Semantic Web: A Conceptual Approach

Organizational knowledge typically comes from numerous independent sources, each with its own semantics. This paper describes a methodology by which information from large numbers of such sources can be associated, organized, and merged. The hypothesis is that a multiplicity of ontology fragments, representing the semantics of the independent sources, can be related to each other automatically without the use of a global ontology. That is, any pair of ontologies can be related indirectly through a semantic bridge consisting of many other previously unrelated ontologies, even when there is no way to determine a direct relationship between them. The relationships among the ontology fragments indicate the relationships among the sources, enabling the source information to be categorized and organized. An evaluation of the methodology has been conducted by relating numerous small, independently developed ontologies for several domains. A nice feature of the methodology is that common parts of the ontologies reinforce each other, while unique parts are deemphasized. The result is a consensus ontology.     

A Semantic Matchmaker for Ranking Web Services

This paper is concerned with the matchmaker for ranking web services by using semantics. So far several methods of semantic matchmaker have been proposed. Most of them, however, focus on classifying the services into predefined categories rather than providing a ranking result. In this paper, a new method of semantic matchmaker is proposed for ranking web services. It is proposed to use the semantic distance for estimating the matching degree between a service and a user request. Four types of semantic distances are defined and four algorithms are implemented respectively to calculate them. Experimental results show that the proposed semantic matchmaker significantly outperforms the keyword based baseline method.     

A Methodology to Create Legal Ontologies in a Logic Programming Based Web Information Retrieval System

Web legal information retrieval systems need the capability to reason with the knowledge modeled by legal ontologies. Using this knowledge it is possible to represent and to make inferences about the semantic content of legal documents. In this paper a methodology for applying NLP techniques to automatically create a legal ontology is proposed. The ontology is defined in the OWL semantic web language and it is used in a logic programming framework, EVOLP+ISCO, to allow users to query the semantic content of the documents. ISCO allows an easy and efficient integration of declarative, object-oriented and constraint-based programming techniques with the capability to create connections with external databases. EVOLP is a dynamic logic programming framework allowing the definition of rules for actions and events. An application of the proposed methodology to the legal web information retrieval system of the Portuguese Attorney General’s Office is described.     

DR-Prolog: A System for Defeasible Reasoning with Rules and Ontologies on the Semantic Web

Nonmonotonic rule systems are expected to play an important role in the layered development of the semantic Web. Defeasible reasoning is a direction in nonmonotonic reasoning that is based on the use of rules that may be defeated by other rules. It is a simple, but often more efficient approach than other nonmonotonic rule systems for reasoning with incomplete and inconsistent information. This paper reports on the implementation of a system for defeasible reasoning on the Web. The system 1) is syntactically compatible with RuleML, 2) features strict and defeasible rules, priorities, and two kinds of negation, 3) is based on a translation to logic programming with declarative semantics, 4) is flexible and adaptable to different intuitions within defeasible reasoning, and 5) can reason with rules, RDF, RDF Schema, and (parts of) OWL ontologies     

基于语义距离度量模型的语义Web服务匹配排序机制

随着语义Web服务技术研究工作的不断深入,因特网上语义Web服务数量急剧增加。如何快速便捷地定位可用语义Web服务已经成为一个迫切且关键的问题。在语义Web服务匹配技术研究中,其中一个重要的研究主题就是语义Web服务匹配结果的排序机制。本文在综合概括和分析各种关于语义Web服务匹配结果排序机制的基础上,提出了一种基于语义距离度量模型的语义Web服务匹配结果排序机制,利用该排序机制,计算待匹配语义Web服务的语义相似度量,并依据此度量对语义Web服务匹配结果进行排序。该度量模型将语义Web服务引用概念间的语义关系转换成可精确比较的量化度量值,对属于相同语义匹配类型的匹配候选服务也能够分别计算语义距离,区分出相同匹配类型的候选服务与服务请求的匹配程度,从而达到改善用户对语义Web服务的搜索体验的目的。     

语义网站点的发现与排序

随着语义网中RDF数据的大量涌现,语义搜索引擎为用户搜索RDF数据带来了便利.但是,如何自动地发现包含语义网信息资源的站点,并高效地在语义网站点中收集语义网信息资源,一直是语义搜索引擎所面临的问题.首先介绍了语义网站点的链接模型.该模型刻画了语义网站点、语义网信息资源、RDF模型和语义网实体之间的关系.基于该模型讨论了语义网实体的归属问题,并进一步定义了语义网站点的发现规则;另外,从站点链接模型出发,定义了语义网站点依赖图,并给出了对语义网站点进行排序的算法.将相关算法在一个真实的语义搜索引擎中进行了初步测试.实验结果表明,所提出的方法可以有效地发现语义网站点并对站点进行排序.     

基于语义索引词的语义网信息检索模型

提出了一个基于语义索引词的语义网信息检索模型(Semantic Information Retrieval，SIR)，解决了在传统的基于关键字的信息检索中只能从句法上对关键字进行分析，无法根据信息资源中的语义关系进行检索的问题。     

A Probabilistic Approach for Distillation and Ranking of Web Pages

A great number of recent papers have investigated the possibility of introducing more effective and efficient algorithms for search engines. In traditional search engines the resulting ranking is carried out using textual information only and, as showed by several works, they are not very useful for extracting relevant information. Present research, instead, takes a new approach, called Topic Distillation, whose main task is finding relevant documents using a different similarity criterion: retrieved documents are those related to the query topic, but which do not necessarily contain the query string. Current algorithms for topic distillation first compute a base set containing all the relevant pages and then, by applying an iterative procedure, obtain the authoritative pages. In this paper, we present a different approach which computes the authoritative pages by analyzing the structure of the base set. The technique applies a statistical approach to the co-citation matrix (of the base set) to find the most co-cited pages and combines a link analysis approach with the content page evaluation. Several experiments have shown the validity of our approach.