Sciweavers

537 search results - page 64 / 108
» Complete Performance Graphs in Probabilistic Information Ret...
Sort
View
SIGIR
2009
ACM
14 years 2 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
14 years 8 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu
VLDB
2007
ACM
132views Database» more  VLDB 2007»
14 years 1 months ago
EntityRank: Searching Entities Directly and Holistically
As the Web has evolved into a data-rich repository, with the standard “page view,” current search engines are becoming increasingly inadequate for a wide range of query tasks....
Tao Cheng, Xifeng Yan, Kevin Chen-Chuan Chang
CIKM
2004
Springer
14 years 1 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
RECOMB
2010
Springer
14 years 2 months ago
Incremental Signaling Pathway Modeling by Data Integration
Constructing quantitative dynamic models of signaling pathways is an important task for computational systems biology. Pathway model construction is often an inherently incremental...
Geoffrey Koh, David Hsu, P. S. Thiagarajan