Sciweavers

441 search results - page 15 / 89
» Query expansion using random walk models
Sort
View
COLING
2010
13 years 4 months ago
FactRank: Random Walks on a Web of Facts
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
Alpa Jain, Patrick Pantel
SIGMETRICS
2008
ACM
131views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
On the design of hybrid peer-to-peer systems
In this paper, we consider hybrid peer-to-peer systems where users form an unstructured peer-to-peer network with the purpose of assisting a server in the distribution of data. We...
Stratis Ioannidis, Peter Marbach
CIKM
2004
Springer
14 years 3 months ago
A framework for selective query expansion
Query expansion is a well-known technique that has been shown to improve average retrieval performance. This technique has not been used in many operational systems because of the...
Stephen Cronen-Townsend, Yun Zhou, W. Bruce Croft
ICASSP
2011
IEEE
13 years 1 months ago
Fast network querying algorithm for searching large-scale biological networks
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
Sayed Mohammad Ebrahim Sahraeian, Byung-Jun Yoon
TREC
2003
13 years 11 months ago
Fondazione Ugo Bordoni at TREC 2003: Robust and Web Track
Our participation in TREC 2003 aims to adapt the use of the DFR (Divergence From Randomness) models with Query Expansion (QE) to the robust track and the topic distillation task o...
Giambattista Amati, Claudio Carpineto, Giovanni Ro...