基于元数据的语义搜索技术研究

描述了为现有的Web资源加入元数据语义描述信息,从而可提高基于语义的搜索引擎的查准率提出一种搜索引擎和外界智能设备或终端交互的接口形式最后展望语义Web和语义搜索引擎相关技术进一步发展的方向.     

基于语义Web服务的分布式服装搜索引擎系统设计

从电子商务环境下服装供应链管理的需求出发,分析了目前服装搜索引擎存在的问题,提出了基于语义Web服务的分布式服装商品搜索引擎系统模型,并讨论了它的体系结构。介绍了基于Ontology Web Language (OWL)的服装本体设计模型及其语义描述方法。分析了服装搜索引擎的基本功能及分布式环境下的Web Services (WS)合成。理论分析和实例原型说明了基于服装语义树的搜索引擎多关键词搜索效率明显高于全文搜索引擎。     

基于语义Web的搜索引擎研究

传统搜索引擎是基于关键字的检索,然而文档的关键字未必和文档有关,而相关的文档也未必显式地包含此关键字。基于语义Web的搜索引擎利用本体技术,可以很好地对关键字进行语义描述。当收到用户提交的搜索请求时,先在已经建立好的本体库的基础上对该请求进行概念推理,然后将推理结果提交给传统的搜索引擎,最终将搜索结果返回给用户。相对于传统的搜索引擎,基于语义Web的搜索引擎有效地提高了搜索的查全率和查准率。     

Web2．0社区搜索模块排序算法的设计与实现

网页排序技术是搜索引擎的核心技术之一。描述Web2.0社区构建语义搜索的必要性,分析影响网页排序的因素,将搜索引擎的排序算法借鉴到基于Web2.0社区的搜索模块中,以改进的TF/IDF和PageRank算法为基础,在一个Web2.0开源社区开发平台上实现基于语义排序的搜索模块。测试结果表明,该排序算法具有内容定位精确、有效结果靠前的特点。     

基于中文分词的OWL—S/UDDI语义Web服务检索模型

目前中文搜索引擎尚不能进行语义检索,经OWL-S语义扩展后的语义Web服务检索也未充分考虑中文词语之间无空格的特点.基于语义Web服务技术与中文分词技术,提出基于中文分词的OWL-S/UDDI语义Web服务检索模型.该模型对中文检索请求语句进行中文分词并附加语义,所生成的服务请求OWL-S文档与语义扩展UDDI中的OWL-S服务描述进行匹配,进而实现Web服务的动态查找与组合.实验结果表明,语义Web服务检索可提高Web服务发现的质量.     

基于语义的Web信息检索

用户要从网络中得到所需的信息一般是通过各种搜索引擎。但是现有的搜索引擎都存在着检索相关度不高等问题。随着语义Web概念的提出及相关技术的发展，基于语义的Web信息检索逐渐成为了语义Web研究的热点。给出了传统搜索引擎存在的问题，从理论上分析了如何将语义Web技术融入Web信息检索中去，并在理论分析的基础上给出了基于语义的Web信息检索的模型。     

基于语义的Web信息检索

用户要从网络中得到所需的信息一般是通过各种搜索引擎。但是现有的搜索引擎都存在着检索相关度不高等问题。随着语义Web概念的提出及相关技术的发展,基于语义的Web信息检索逐渐成为了语义Web研究的热点。给出了传统搜索引擎存在的问题,从理论上分析了如何将语义Web技术融入Web信息检索中去,并在理论分析的基础上给出了基于语义的Web信息检索的模型。     

语义搜索研究综述

语义搜索将语义Web技术引入搜索引擎,改善当前搜索引擎的搜索效果,近年来得到广泛关注.文章介绍了语义搜索领域的研究基础,包括研究现状和常用的研究方法,对语义搜索进行了分类研究和深入分析,语义搜索主要可分为基于传统搜索的增强型语义搜索和基于本体推理的知识型语义搜索;文章指出了语义搜索研究中存在的问题,并对未来开展语义搜索研究进行了总结和展望.     

语义网的研究和发展对未来搜索引擎的影响

目前在全球市场里占据主要份额的谷歌、雅虎、百度等搜索引擎,提供给人们的依旧是比较笨拙的工具,因为它们始终受制于传统Web,对搜索关键字的精确度要求苛刻,处理自然语言的能力很低。语义网(SW)的提出、研究和发展,给搜索引擎带来了新的希望。而基于语义Web的智能搜索引擎,则是下一代搜索引擎的必然选择。     

基于本体论相互属性的Web资源元数据模型

要使Web资源支持资源的自动发现，首先需要对Web资源提供必要的描述。Web资源的元数据模型——资源描述框架只能表示资源之间的二元关系，多元关系必须转化为二元关系后才能表示。然而多元关系与其转化为多个二元关系后所具有的语义是不相同的。针对资源描述框架存在的上述问题，该文引入本体论相互属性的概念，避免了不恰当地使用多个二元关系表示多元关系。同时给出了Web资源元数据本体模型的XML标记库，使得描述Web资源的本体模型可以在Web网络上传输，并被搜索引擎解析和理解。     

语义网站点的发现与排序

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

WebOWL: A Semantic Web search engine development experiment

This paper presents WebOWL, an experiment in using the latest technologies to develop a Semantic Web search engine. WebOWL consists of a community of intelligent agents, acting as crawlers, that are able to discover and learn the locations of Semantic Web neighborhoods on the Web, a semantic database to store data from different ontologies, a query mechanism that supports semantic queries in OWL, and a ranking algorithm that determines the order of the returned results based on the semantic relationships of classes and individuals. The system has been implemented using Jade, Jena and the db4o object database engine and has successfully stored over one million OWL classes, individuals and properties.     

Search on the Semantic Web

To help human users and software agents find relevant knowledge on the Semantic Web, the Swoogle search engine discovers, indexes, and analyzes the ontologies and facts that are encoded in Semantic Web documents.     

Searching and browsing Linked Data with SWSE: The Semantic Web Search Engine

In this paper, we discuss the architecture and implementation of the Semantic Web Search Engine (SWSE). Following traditional search engine architecture, SWSE consists of crawling, data enhancing, indexing and a user interface for search, browsing and retrieval of information; unlike traditional search engines, SWSE operates over RDF Web data – loosely also known as Linked Data – which implies unique challenges for the system design, architecture, algorithms, implementation and user interface. In particular, many challenges exist in adopting Semantic Web technologies for Web data: the unique challenges of the Web – in terms of scale, unreliability, inconsistency and noise – are largely overlooked by the current Semantic Web standards. Herein, we describe the current SWSE system, initially detailing the architecture and later elaborating upon the function, design, implementation and performance of each individual component. In so doing, we also give an insight into how current Semantic Web standards can be tailored, in a best-effort manner, for use on Web data. Throughout, we offer evaluation and complementary argumentation to support our design choices, and also offer discussion on future directions and open research questions. Later, we also provide candid discussion relating to the difficulties currently faced in bringing such a search engine into the mainstream, and lessons learnt from roughly six years working on the Semantic Web Search Engine project.     

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

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

Semantic Web search based on ontological conjunctive queries

Many experts predict that the next huge step forward in Web information technology will be achieved by adding semantics to Web data, and will possibly consist of (some form of) the Semantic Web. In this paper, we present a novel approach to Semantic Web search, called Serene, which allows for a semantic processing of Web search queries, and for evaluating complex Web search queries that involve reasoning over the Web. More specifically, we first add ontological structure and semantics to Web pages, which then allows for both attaching a meaning to Web search queries and Web pages, and for formulating and processing ontology-based complex Web search queries (i.e., conjunctive queries) that involve reasoning over the Web. Here, we assume the existence of an underlying ontology (in a lightweight ontology language) relative to which Web pages are annotated and Web search queries are formulated. Depending on whether we use a general or a specialized ontology, we thus obtain a general or a vertical Semantic Web search interface, respectively. That is, we are actually mapping the Web into an ontological knowledge base, which then allows for Semantic Web search relative to the underlying ontology. The latter is then realized by reduction to standard Web search on standard Web pages and logically completed ontological annotations. That is, standard Web search engines are used as the main inference motor for ontology-based Semantic Web search. We develop the formal model behind this approach and also provide an implementation in desktop search. Furthermore, we report on extensive experiments, including an implemented Semantic Web search on the Internet Movie Database.     

Comparing keyword search to semantic search: a case study in solving crossword puzzles using the Google™ API

Keyword‐based search engines such as Google? index Web pages for human consumption. Sophisticated as such engines have become, surveys indicate almost 25% of Web searchers are unable to find useful results in the first set of URLs returned (Technology Review, March 2004). The lack of machine‐interpretable information on the Web limits software agents from matching human searches to desirable results. Tim Berners‐Lee, inventor of the Web, has architected the Semantic Web in which machine‐interpretable information provides an automated means to traversing the Web. A necessary cornerstone application is the search engine capable of bringing the Semantic Web together into a searchable landscape. We implemented a Semantic Web Search Engine (SWSE) that performs semantic search, providing predictable and accurate results to queries. To compare keyword search to semantic search, we constructed the Google CruciVerbalist (GCV), which solves crossword puzzles by reformulating clues into Google queries processed via the Google API. Candidate answers are extracted from query results. Integrating GCV with SWSE, we quantitatively show how semantic search improves upon keyword search. Mimicking the human brain's ability to create and traverse relationships between facts, our techniques enable Web applications to ‘think’ using semantic reasoning, opening the door to intelligent search applications that utilize the Semantic Web. Copyright © 2007 John Wiley & Sons, Ltd.     

An Adaptation of the Vector-Space Model for Ontology-Based Information Retrieval

Semantic search has been one of the motivations of the semantic Web since it was envisioned. We propose a model for the exploitation of ontology-based knowledge bases to improve search over large document repositories. In our view of information retrieval on the semantic Web, a search engine returns documents rather than, or in addition to, exact values in response to user queries. For this purpose, our approach includes an ontology-based scheme for the semiautomatic annotation of documents and a retrieval system. The retrieval model is based on an adaptation of the classic vector-space model, including an annotation weighting algorithm, and a ranking algorithm. Semantic search is combined with conventional keyword-based retrieval to achieve tolerance to knowledge base incompleteness. Experiments are shown where our approach is tested on corpora of significant scale, showing clear improvements with respect to keyword-based search     

Making knowledge machine-processable: some implications of general semantic search

The central argument of this paper is that the design, implementation and use of technologies that underpin general semantic search have implications for what we know and the way in which knowledge is understood. Semantic search is an assemblage of technologies that most Internet users would use regularly without necessarily realising. Users of search engines implementing semantic search can obtain answers to questions rather than just retrieve pages that include their search query. This paper critically examines the design of the Semantic Web, upon which semantic search is based. It demonstrates that implicit in the design of the Semantic Web are particular assumptions about the nature of classification and the nature of knowledge. The Semantic Web was intended for interoperability within specific domains. It is here argued that the extension to general semantic search, for use by the general public, has implications for what type of knowledge is visible and what counts as legitimate knowledge. The provision of a definitive answer to a query, via the reduction of discursive knowledge into machine-processable data, provides the illusion of objectivity and authority in a way that is increasingly impenetrable to critical scrutiny.