Sciweavers

648 search results - page 25 / 130
» A general dimension for query learning
Sort
View
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
16 years 4 days ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims
SIGIR
2005
ACM
15 years 5 months ago
Predicting query difficulty on the web by learning visual clues
We describe a method for predicting query difficulty in a precision-oriented web search task. Our approach uses visual features from retrieved surrogate document representations (...
Eric C. Jensen, Steven M. Beitzel, David A. Grossm...
AAAI
1996
15 years 1 months ago
Learning to Parse Database Queries Using Inductive Logic Programming
This paper presents recent work using the Chill parser acquisition system to automate the construction of a natural-language interface for database queries. Chill treats parser ac...
John M. Zelle, Raymond J. Mooney
ICDE
2002
IEEE
91views Database» more  ICDE 2002»
15 years 4 months ago
Lossy Reduction for Very High Dimensional Data
We consider the use of data reduction techniques for the problem of approximate query answering. We focus on applications for which accurate answers to selective queries are requi...
Chris Jermaine, Edward Omiecinski
AAAI
1990
15 years 28 days ago
Symbolic Probabilistic Inference in Belief Networks
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
Ross D. Shachter, Bruce D'Ambrosio, Brendan Del Fa...