Sciweavers

1283 search results - page 13 / 257
» Probabilistic structured query methods
Sort
View
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 8 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...
EMNLP
2007
13 years 10 months ago
Recovery of Empty Nodes in Parse Structures
In this paper, we describe a new algorithm for recovering WH-trace empty nodes. Our approach combines a set of hand-written patterns together with a probabilistic model. Because t...
Denis Filimonov, Mary P. Harper
ICML
2008
IEEE
14 years 9 months ago
Learning to learn implicit queries from gaze patterns
In the absence of explicit queries, an alternative is to try to infer users' interests from implicit feedback signals, such as clickstreams or eye tracking. The interests, fo...
Antti Ajanki, Kai Puolamäki, Samuel Kaski
TSMC
2002
112views more  TSMC 2002»
13 years 8 months ago
A method for evaluating elicitation schemes for probabilistic models
We present an objective approach for evaluating probability and structure elicitation methods in probabilistic models. The main idea is to use the model derived from the experts�...
Haiqin Wang, Denver Dash, Marek J. Druzdzel
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 3 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu