Sciweavers

1088 search results - page 151 / 218
» Probabilistic query expansion using query logs
Sort
View
WWW
2007
ACM
14 years 9 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
WWW
2009
ACM
14 years 9 months ago
Learning consensus opinion: mining data from a labeling game
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
Paul N. Bennett, David Maxwell Chickering, Anton M...
IPM
2006
83views more  IPM 2006»
13 years 9 months ago
A risk minimization framework for information retrieval
This paper presents a probabilistic information retrieval framework in which the retrieval problem is formally treated as a statistical decision problem. In this framework, querie...
ChengXiang Zhai, John D. Lafferty
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
14 years 2 months ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick
SIGIR
1998
ACM
14 years 1 months ago
DOLORES: A System for Logic-Based Retrieval of Multimedia Objects
We describe the design and implementation of a system for logic-based multimedia retrieval. As highlevel logic for retrieval of hypermedia documents, we have developed a probabilis...
Norbert Fuhr, Norbert Gövert, Thomas Röl...