Sciweavers

90 search results - page 9 / 18
» Probabilistic Ranking Queries on Gaussians
Sort
View
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 7 months ago
Comparing and Combining Methods for Automatic Query Expansion
Abstract. Query expansion is a well known method to improve the performance of information retrieval systems. In this work we have tested different approaches to extract the candid...
José R. Pérez-Agüera, Lourdes A...
CIKM
2007
Springer
14 years 1 months ago
Query expansion using probabilistic local feedback with application to multimedia retrieval
As one of the most effective query expansion approaches, local feedback is able to automatically discover new query terms and improve retrieval accuracy for different retrieval ...
Rong Yan, Alexander G. Hauptmann
ERCIMDL
2007
Springer
87views Education» more  ERCIMDL 2007»
14 years 1 months ago
A Model of Uncertainty for Near-Duplicates in Document Reference Networks
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
Claudia Hess, Michel de Rougemont
VLDB
2007
ACM
132views Database» more  VLDB 2007»
14 years 1 months ago
EntityRank: Searching Entities Directly and Holistically
As the Web has evolved into a data-rich repository, with the standard “page view,” current search engines are becoming increasingly inadequate for a wide range of query tasks....
Tao Cheng, Xifeng Yan, Kevin Chen-Chuan Chang
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
14 years 7 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu