Results 1 - 10 of 2,554

Semantic multimedia retrieval using lexical query expansion and model-based reranking

by Alexander Haubold, Apostol (paul Natsev, Milind R. Naphade - In Proc. of ICME’06 , 2006
"... We present methods for improving text search retrieval of visual multimedia content by applying a set of visual models of semantic concepts from a lexicon of concepts deemed relevant for the collection. Text search is performed via queries of words or fully qualified sentences, and results are retur ..."
Abstract - Cited by 18 (6 self) - Add to MetaCart
are returned in the form of ranked video clips. Our approach involves a query expansion stage, in which query terms are compared to the visual concepts for which we independently build classifier models. We leverage a synonym dictionary and WordNet similarities during expansion. Results over each query

Query expansion using lexical-semantic relations

by Ellen M. Voorhees - In Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval , 1994
"... Applications such as office automation, news filtering, help facilities in complex systems, and the like require the ability to retrieve documents from full-text databases where vocabulary problems can be particularly severe. Experiments performed on small collections with single-domain thesauri sug ..."
Abstract - Cited by 395 (1 self) - Add to MetaCart
suggest that expanding query vectors with words that are lexically related to the original query words can ameliorate some of the problems of mismatched vocabularies. This paper examines the utility of lexical query expansion in the large, diverse TREC collection. Concepts are represented by Word

Query Expansion Using Local and Global Document Analysis

by Jinxi Xu, W. Bruce Croft - In Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval , 1996
"... Automatic query expansion has long been suggested as a technique for dealing with the fundamental issue of word mismatch in information retrieval. A number of approaches to expansion have been studied and, more recently, attention has focused on techniques that analyze the corpus to discover word re ..."
Abstract - Cited by 610 (24 self) - Add to MetaCart
Automatic query expansion has long been suggested as a technique for dealing with the fundamental issue of word mismatch in information retrieval. A number of approaches to expansion have been studied and, more recently, attention has focused on techniques that analyze the corpus to discover word

Using Linear Algebra for Intelligent Information Retrieval

by Michael W. Berry, Susan T. Dumais - SIAM REVIEW , 1995
"... Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical ..."
Abstract - Cited by 676 (18 self) - Add to MetaCart
Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document

An Efficient Boosting Algorithm for Combining Preferences

by Raj Dharmarajan Iyer , Jr. , 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract - Cited by 727 (18 self) - Add to MetaCart
search strategies, each of which is a query expansion for a given domain. For this task, we compare the performance of RankBoost to the individual search strategies. The second experiment is a collaborative-filtering task for making movie recommendations. Here, we present results comparing Rank

Improving automatic query expansion

by Ar Mitra Amit Singhal , 1998
"... Abstract Most casual users of IR systems type short queries. Recent research has shown that adding new words to these queries via odhoc feedback improves the re-trieval effectiveness of such queries. We investigate ways to improve this query expansion process by refining the set of documents used in ..."
Abstract - Cited by 286 (4 self) - Add to MetaCart
Abstract Most casual users of IR systems type short queries. Recent research has shown that adding new words to these queries via odhoc feedback improves the re-trieval effectiveness of such queries. We investigate ways to improve this query expansion process by refining the set of documents used

IR evaluation methods for retrieving highly relevant documents

by Kalervo Järvelin, Jaana Kekäläinen , 2000
"... This paper proposes evaluation methods based on the use of non-dichotomous relevance judgements in IR experiments. It is argued that evaluation methods should credit IR methods for their ability to retrieve highly relevant documents. This is desirable from the user point of view in moderu large IR e ..."
Abstract - Cited by 414 (5 self) - Add to MetaCart
given ranked position. We then demonstrate the use of these evaluation methods in a case study on the effectiveness of query types, based on combinations of query structures and expansion, in retrieving documents of various degrees of relevance. The test was run with a best match retrieval system (In

Concept Based Query Expansion

by Yonggang Qiu, H. P. Frei , 1993
"... Query expansion methods have been studied for a long time - with debatable success in many instances. In this paper we present a probabilistic query expansion model based on a similarity thesaurus which was constructed automatically. A similarity thesaurus reflects domain knowledge about the particu ..."
Abstract - Cited by 233 (2 self) - Add to MetaCart
Query expansion methods have been studied for a long time - with debatable success in many instances. In this paper we present a probabilistic query expansion model based on a similarity thesaurus which was constructed automatically. A similarity thesaurus reflects domain knowledge about

Generating query substitutions

by Rosie Jones, Benjamin Rey, Omid Madani - In WWW , 2006
"... We introduce the notion of query substitution, that is, generating a new query to replace a user’s original search query. Our technique uses modifications based on typical substitutions web searchers make to their queries. In this way the new query is strongly related to the original query, containi ..."
Abstract - Cited by 273 (5 self) - Add to MetaCart
, containing terms closely related to all of the original terms. This contrasts with query expansion through pseudo-relevance feedback, which is costly and can lead to query drift. This also contrasts with query relaxation through boolean or TFIDF retrieval, which reduces the specificity of the query. We

PATH PLANNING IN EXPANSIVE CONFIGURATION SPACES

by David Hsu, Jean-Claude Latombe, Rajeev Motwani , 1999
"... We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomlysampled milestones. The analysis of expansive configuration spaces has inspired us to develop a new randomized planning algorithm. ..."
Abstract - Cited by 264 (30 self) - Add to MetaCart
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomlysampled milestones. The analysis of expansive configuration spaces has inspired us to develop a new randomized planning algorithm
Results 1 - 10 of 2,554