A personalized query expansion approach for engineering document retrieval

Engineers create engineering documents with their own terminologies, and want to search existing engineering documents quickly and accurately during a product development process. Keyword-based search methods have been widely used due to their ease of use, but their search accuracy has been often problematic because of the semantic ambiguity of terminologies in engineering documents and queries. The semantic ambiguity can be alleviated by using a domain ontology. Also, if queries are expanded to incorporate the engineer’s personalized information needs, the accuracy of the search result would be improved. Therefore, we propose a framework to search engineering documents with less semantic ambiguity and more focus on each engineer’s personalized information needs. The framework includes four processes: (1) developing a domain ontology, (2) indexing engineering documents, (3) learning user profiles, and (4) performing personalized query expansion and retrieval. A domain ontology is developed based on product structure information and engineering documents. Using the domain ontology, terminologies in documents are disambiguated and indexed. Also, a user profile is generated from the domain ontology. By user profile learning, user’s interests are captured from the relevant documents. During a personalized query expansion process, the learned user profile is used to reflect user’s interests. Simultaneously, user’s searching intent, which is implicitly inferred from the user’s task context, is also considered. To retrieve relevant documents, an expanded query in which both user’s interests and intents are reflected is then matched against the document collection. The experimental results show that the proposed approach can substantially outperform both the keyword-based approach and the existing query expansion method in retrieving engineering documents. Reflecting a user’s information needs precisely has been identified to be the most important factor underlying this notable improvement.     

基于领域本体的贝叶斯网络检索模型研究

针对传统的信息检索方法无法实现用户查询的语义理解、检索效率低等问题,本文提出基于领域本体进行查询扩展的贝叶斯网络检索模型。该模型首先将用户查询通过领域本体进行语义扩展,然后将扩展后的查询作为证据在贝叶斯网络检索模型中进行传播,进而得到查询结果,实验表明本文提出的贝叶斯网络检索模型能提高检索效率。     

基于领域本体的新闻视频检索

新闻视频作为视频数据中有代表性的一种媒体,受到人们的广泛关注,对新闻视频的检索要求也越来越高.传统的新闻视频检索大多是非语义层面的,采用的是基于关键词的检索方法，难于获得令人满意的查准率和查全率．本文提出一种基于领域本体的新闻视频检索框架，定义了新闻视频检索中的新闻视频对象，使用语义表达能力强的领域本体来指导视频语义对象的标注，并针对“一词多义”问题提出了“概念域-概念”两阶段概念消歧算法；针对自然语言检索问题，使用领域本体进行查询优化和查询扩展，并提出了查询语句自动生成方法．实验表明，基于领域本体的新闻视频检索方法可以有效的提高检索性能．     

保护位置隐私和查询内容隐私的路网K近邻查询方法

位置隐私和查询内容隐私是LBS兴趣点（point of interest,简称POI）查询服务中需要保护的两个重要内容,同时,在路网连续查询过程中,位置频繁变化会给LBS服务器带来巨大的查询处理负担,如何在保护用户隐私的同时,高效地获取精确查询结果,是目前研究的难题.以私有信息检索中除用户自身外其他实体均不可信的思想为基本假设,基于Paillier密码系统的同态特性,提出了无需用户提供真实位置及查询内容的K近邻兴趣点查询方法,实现了对用户位置、查询内容隐私的保护及兴趣点的精确检索;同时,以路网顶点为生成元组织兴趣点分布信息,进一步解决了高强度密码方案在路网连续查询中因用户位置变化频繁导致的实用效率低的问题,减少了用户的查询次数,并能确保查询结果的准确性.最后从准确性、安全性及查询效率方面对本方法进行了分析,并通过仿真实验验证了理论分析结果的正确性.     

An approach for selecting seed URLs of focused crawler based on user-interest ontology

Seed URLs selection for focused Web crawler intends to guide related and valuable information that meets a user's personal information requirement and provide more effective information retrieval. In this paper, we propose a seed URLs selection approach based on user-interest ontology. In order to enrich semantic query, we first intend to apply Formal Concept Analysis to construct user-interest concept lattice with user log profile. By using concept lattice merger, we construct the user-interest ontology which can describe the implicit concepts and relationships between them more appropriately for semantic representation and query match. On the other hand, we make full use of the user-interest ontology for extracting the user interest topic area and expanding user queries to receive the most related pages as seed URLs, which is an entrance of the focused crawler. In particular, we focus on how to refine the user topic area using the bipartite directed graph. The experiment proves that the user-interest ontology can be achieved effectively by merging concept lattices and that our proposed approach can select high quality seed URLs collection and improve the average precision of focused Web crawler.     

Metaform: updatable form screens and their application to the use of office metaphors in query language instruction

Abstract

A database interface language and system, called Metaform, which automatically generates multi-relational form screen interfaces for use by non-computer professionals has been developed. A form screen is a subset of the relational database, with a particular relation or combination of relations being represented. Through form screens, users can simultaneously query and update several relations in the database without having to know about its underlying structure. An overview of the Metaform system is presented and several examples of the use of the Metaform query language and update operators are described.

A series of ‘usability’ studies were conducted on a prototype of the Metaform system to examine the claims that the form concept aids computer-naive users in building complex database queries. These studies adopted the form screen concept to present six office paper work analogies to users to help them to understand the database retrieval concepts. The analogies of a file cabinet, a file folder, a stack of forms, a single form, a table of information on a form and a field of information were used in a two-staged training module.

At the end of each training sequence, users answered questions with the prototype and with paper and pencil which tapped their understanding of the database retrievals they were learning to perform. The results from these questionnaires were mixed. Users performed successful relational queries for simple retrievals and for those using existential quantifiers. They had difficulty with queries involving multiple steps and intermediate stages. Although users understood and used the analogies, they ran into difficulties with the ambiguities in the English statements of the queries, thus suggesting a need for another level of metaphors and/or problem representation tools not associated with the machine but with the user's comprehension of database retrieval problems.     

A knowledge-based approach for retrieving scenario-specific medical text documents

Medical free-text queries often share the same scenario. A scenario represents a repeating task in healthcare. For example, a specific scenario is searching for treatment methods for a specific disease, where “treatment” is a term indicating the scenario. To support scenario-specific retrieval, in this paper we present a new knowledge-based approach to address these problems. In addition, we describe a testbed system developed using the approach. Our specific implementation uses the UMLS Metathesaurus and semantic structure to extract key concepts from a free text. The approach uses phrase-based indexing to represent similar concepts, and query expansion to improve matching query terms with the terms in the document. The system formulates the query based on the user's input and the selected scenario template such as “disease, treatment” or “disease, diagnosis.” Thus, it is able to retrieve documents relevant to the specific scenario. Evaluating the system using the standard OSHMED corpus, our empirical results validate the effectiveness of this new approach over the traditional text retrieval techniques.     

Toward a Privacy Agent for Information Retrieval

In this paper, we tackle the private information retrieval (PIR) problem associated with the use of Internet search engines. We address the desire for a user to retrieve information from the Web without the search provider learning about it. Traditional PIR protocols present two main shortcomings for their application: (i) They assume cooperation by the database, which is not affordable for a real‐world search engine like Google and (ii) their computational complexity is linear in the size of the database, which is unfeasible in the case of the Web. More recent approaches relax PIR conditions to overcome these limitations and present some level of privacy. Mostly, they aim to distort server logs regardless of the loss of information that is involved. Server logs are used by search engines for profiling and, thereby, provide personalized results. This becomes a user's need given the growth of the Web and can also be used for targeted advertising. This study focuses on a noncooperative agent for private search that considers profiling as valuable data used for both sides of the search process. It is based on the assumption that the user's identity is formed by the union of various areas of interests or facets. Managing the HTTP connections properly, submitted queries are mapped to different server logs according to these facets. The rationale is that these logs cannot be used for tracing the user while they are still helpful for profiling. We present a personalized query classification approach based on the user's browsing history and to provide empirical results; we developed an attacking algorithm against the agent that shows that the disclosure risk is reduced.     

Fast semantic object search and detection for vegetable trading information using Steiner tree

We propose an approach to speed up the semantic object search and detection for vegetable trading information using Steiner Tree. Through analysis, comparing the relevant ontology construction method, we present a set of ontology construction methods based on domain ontology for vegetables transaction information. With Jena2 provides rule-based reasoning engine, More related information could be searched with the help of ontology database and ontology reasoning, query expansion is to achieve sub-vocabulary of user input, the parent class of words, equivalence class of extensions, and use of ontology reasoning to get some hidden information to use of these technologies, we design and implementation of ontology-based semantic vegetables transaction information retrieval system, and through compare to keyword-based matching of large-scale vegetable trading site retrieval systems, the results show that the recall and precision rate of ontology-based information retrieval system much better than keyword-based information retrieval system, and has some practical value.     

基于用户兴趣的查询扩展语义模型

自然语言中词的同义现象和歧义现象一直是降低信息检索查全率和查准率的关键,在Web搜索引擎上显得更加突出。提出了一种基于用户兴趣的查询扩展语义模型,通过构建基于Yahoo的语义ontology知识库消除同义现象,设计客户端的用户兴趣挖掘模型消除歧义现象。实验结果显示该方法能有效提高Web信息检索的查全率与查准率。     

知识网格中基于领域本体的智能检索

本文提出知识网格环境下基于领域本体的智能检索模型,采用OWL DL语言对领域知识进行形式化描述,支持推理和深层语义检索.＂标注＂和＂查询优化＂是检索的两个关键技术.通过规范的概念和概念间语义关系对文档片段进行标注,并针对＂一词多义＂问题提出＂主题-概念＂两阶段消歧算法.＂查询优化＂过程中,基于OWL DL推理的优化算法实现查询概念的自动扩展,提高了查全率和查准率.基于以上方法,建立航天领域本体,利用网上数据库开放资源作为测试集进行评测.实验显示,与传统基于     

Opinion-Based Entity Ranking using learning to rank

As social media and e-commerce on the Internet continue to grow, opinions have become one of the most important sources of information for users to base their future decisions on. Unfortunately, the large quantities of opinions make it difficult for an individual to comprehend and evaluate them all in a reasonable amount of time. The users have to read a large number of opinions of different entities before making any decision. Recently a new retrieval task in information retrieval known as Opinion-Based Entity Ranking (OpER) has emerged. OpER directly ranks relevant entities based on how well opinions on them are matched with a user's preferences that are given in the form of queries. With such a capability, users do not need to read a large number of opinions available for the entities. Previous research on OpER does not take into account the importance and subjectivity of query keywords in individual opinions of an entity. Entity relevance scores are computed primarily on the basis of occurrences of query keywords match, by assuming all opinions of an entity as a single field of text. Intuitively, entities that have positive judgments and strong relevance with query keywords should be ranked higher than those entities that have poor relevance and negative judgments. This paper outlines several ranking features and develops an intuitive framework for OpER in which entities are ranked according to how well individual opinions of entities are matched with the user's query keywords. As a useful ranking model may be constructed from many ranking features, we apply learning to rank approach based on genetic programming (GP) to combine features in order to develop an effective retrieval model for OpER task. The proposed approach is evaluated on two collections and is found to be significantly more effective than the standard OpER approach.     

基于本体的检索方法在数字期刊中的应用研究

基于关键词处理的传统检索技术会在检索过程中遗漏大量与检索概念相关或同义的内容。本文在本体基础上重点研究语义相似度算法及相应的语义扩展算法,在此基础上将模型应用于数字期刊的信息检索中,以提高查准率和查全率。     

知识管理中基于本体的扩展检索方法

在知识管理系统中,为有效地解决用户查询与文档之间相同概念的不同表达形式造成的失配问题,提出一种基于本体、以面向任务情景的结构化描述作为信息体内容的语义索引的双向扩展检索方法,通过相容匹配和知识联网2种机制实现了扩展检索,分别对应于自上而下的和自下而上的2种途径;并采用查询重写模板（QRT）来搜索与当前任务相关的知识．基于原始查询和本体,QRT生成大量的子查询,同时将与原始查询相关度的权重传递给子查询式．自上而下方法或知识联网机制通过组织、任务本体检索到相关知识项．自下而上方法在任务情景中搜索相似任务,并获取包含该任务描述的知识项．2种方法都应用QRT实现基于本体的知识检索．实验结果表明：文中方法提高了知识管理系统的检索效率和准确率．     

基于领域本体科学效应知识语义检索的研究

当前传统的信息检索技术并不能准确的捕获用户的信息需求,基于本体的方法虽然考虑到语义搜索的复杂性但是却迫使用户使用一个十分难以掌握的查询语法．通过对用户查询习惯和查询短语的分析,我们发现查询短语通常为简单的动宾结构短语．针对化学领域科学效应知识和用户的查询习惯的特点,给出了一种从自然语言查询到本体知识映射的语义检索的方法．     

基于本体的语义网检索模型及关键技术研究

为解决传统的基于题,构建了一个基于本体的语义网检索模型.提出了一种领域本体库和应用本体库的构建方法,给出了查询本体的生成以及相似本体匹配推理的方法,实现了以该模型为基础的试验性检索系统.实验结果表明,该模型能够进行本体的语义推理,在一定程度上增强信息检索系统的语义处理能力,检索效率得到了改善.     

基于本体的Web智能检索研究

针对传统的基于关键词信息检索方式存在的问题,提出一种基于领域本体的语义检索模型,在建立本体概念与文档内容关联关系的基础上,对用户的查询输入预处理,利用本体计算两者的相似程度,给出与查询请求相关的排序后的文档。通过搭建基于本体的Web智能检索原型系统,验证了该模型的有效性。     

A practical ontology query expansion algorithm for semantic-aware learning objects retrieval

Following the rapid development of Internet, particularly web page interaction technology, distant e-learning has become increasingly realistic and popular. To solve the problems associated with sharing and reusing teaching materials in different e-learning systems, several standard formats, including SCORM, IMS, LOM, and AICC, etc., recently have been proposed by several different international organizations. SCORM LOM, namely learning object metadata, facilitates the indexing and searching of learning objects in a learning object repository through extended sharing and searching features. However, LOM suffers a weakness in terms of semantic-awareness capability. Most information retrieval systems assume that users have cognitive ability regarding their needs. However, in e-learning systems, users may have no idea of what they are looking for and the learning object metadata. This study presents an ontological approach for semantic-aware learning object retrieval. This approach has two significant novel features: a fully automatic ontology-based query expansion algorithm for inferring and aggregating user intention based on their original short query, and another “ambiguity removal” procedure for correcting inappropriate user query terms. This approach is sufficiently generic to be embedded to other LOM-based search mechanisms for semantic-aware learning object retrieval.Focused on digital learning material and contrasted to other traditional keyword-based search technologies, the proposed approach has experimentally demonstrated significantly improved retrieval precision and recall rate.     

模糊查询中的策略优化

提出一种基于本体的交互式查询请求优化方法。该方法综合考虑影响查询模糊性的各个因素,对查询模糊性进行测试,并给出了各模糊性参数定量的计算方法,根据模糊性参数值交互式地给出相应的查询请求优化策略。     

Classifying Ambiguities in a Visual Spatial Language

Geographic information systems (GIS) manage geographical data and present the results visually using maps. Visual languages are well adapted to query such data. We propose to express queries sent to a GIS using symbolic maps with metaphors, i.e., visual representation of the spatial relationships making up the query. Visual languages suffer from the appearance of ambiguity. We distinguish visual ambiguities from selection ambiguities. Visual ambiguities appear when a given visual representation of a query corresponds with several interpretations. In order to define new spatial relationship, the user points out one (or several) metaphor(s) already available in the restitution space. Selection ambiguities appear when a given selection corresponds with several metaphors. We suggest palliating visual and selection ambiguities by associating a placing method with composition automata. The placing method insures to minimize level of ambiguity. We determine levels of ambiguity and user interaction complexity depending on the required expressive power. The higher the desired expressive power is, the higher the level of ambiguity is and thus the more complex the user interaction is. A prototype has been implemented to validate the placing method and the automaton allowing the highest expressive power.