Sciweavers

20 search results - page 1 / 4
» Stability and Generalization of Bipartite Ranking Algorithms
Sort
View
COLT
2005
Springer
13 years 9 months ago
Stability and Generalization of Bipartite Ranking Algorithms
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Partha Niyogi
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 4 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
ICML
2008
IEEE
14 years 4 months ago
Query-level stability and generalization in learning to rank
This paper is concerned with the generalization ability of learning to rank algorithms for information retrieval (IR). We point out that the key for addressing the learning proble...
Yanyan Lan, Tie-Yan Liu, Tao Qin, Zhiming Ma, Hang...
ICML
2006
IEEE
14 years 4 months ago
Ranking on graph data
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or order...
Shivani Agarwal
SIGIR
2008
ACM
13 years 3 months ago
Re-ranking search results using document-passage graphs
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
Michael Bendersky, Oren Kurland