Sciweavers

2164 search results - page 116 / 433
» Learning to rank for information retrieval
Sort
View
CIKM
2006
Springer
15 years 10 months ago
A probabilistic relevance propagation model for hypertext retrieval
A major challenge in developing models for hypertext retrieval is to effectively combine content information with the link structure available in hypertext collections. Although s...
Azadeh Shakery, ChengXiang Zhai
CIKM
2009
Springer
16 years 27 days ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
IRI
2007
IEEE
16 years 19 days ago
Acronym-Expansion Recognition and Ranking on the Web
The paper presents a study on large-scale automatic extraction of acronyms and associated expansions from Web data and from the user interactions with this data through Web search...
Alpa Jain, Silviu Cucerzan, Saliha Azzam
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
16 years 6 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
CIKM
2008
Springer
15 years 8 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell