Sciweavers

186 search results - page 15 / 38
» Learning to rank at query-time using association rules
Sort
View
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 12 days ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
SDM
2007
SIAM
146views Data Mining» more  SDM 2007»
13 years 9 months ago
ROAM: Rule- and Motif-Based Anomaly Detection in Massive Moving Object Data Sets
With recent advances in sensory and mobile computing technology, enormous amounts of data about moving objects are being collected. One important application with such data is aut...
Xiaolei Li, Jiawei Han, Sangkyum Kim, Hector Gonza...
KDD
2004
ACM
162views Data Mining» more  KDD 2004»
14 years 8 months ago
Discovering Links Between Lexical and Surface Features in Questions and Answers
Information retrieval systems, based on keyword match, are evolving to question answering systems that return short passages or direct answers to questions, rather than URLs point...
Soumen Chakrabarti
IOR
2011
107views more  IOR 2011»
13 years 2 months ago
Information Collection on a Graph
We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values i...
Ilya O. Ryzhov, Warren B. Powell
ICML
2000
IEEE
13 years 12 months ago
Discriminative Reranking for Natural Language Parsing
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
Michael Collins