Sciweavers

7215 search results - page 180 / 1443
» On the Consistency of Ranking Algorithms
Sort
View
IR
2010
13 years 6 months ago
Gradient descent optimization of smoothed information retrieval metrics
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
Olivier Chapelle, Mingrui Wu
SIGIR
2009
ACM
14 years 2 months ago
Counting ancestors to estimate authority
The AncestorRank algorithm calculates an authority score by using just one characteristic of the web graph—the number of ancestors per node. For scalability, we estimate the num...
Jian Wang, Brian D. Davison
SEMWEB
2004
Springer
14 years 1 months ago
Top-k Query Evaluation for Schema-Based Peer-to-Peer Networks
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
Wolfgang Nejdl, Wolf Siberski, Uwe Thaden, Wolf-Ti...
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
14 years 8 months ago
The TopX DB&IR engine
This paper proposes a demo of the TopX search engine, an extensive framework for unified indexing, querying, and ranking of large collections of unstructured, semistructured, and ...
Martin Theobald, Ralf Schenkel, Gerhard Weikum
CIKM
2009
Springer
14 years 2 months ago
On domain similarity and effectiveness of adapting-to-rank
Adapting to rank address the the problem of insufficient domainspecific labeled training data in learning to rank. However, the initial study shows that adaptation is not always...
Keke Chen, Jing Bai, Srihari Reddy, Belle L. Tseng