Sciweavers

2100 search results - page 24 / 420
» Learning to rank on graphs
Sort
View
COMBINATORICS
2000
71views more  COMBINATORICS 2000»
14 years 9 months ago
Low Rank Co-Diagonal Matrices and Ramsey Graphs
We examine n
Vince Grolmusz
97
Voted
PASTE
2010
ACM
15 years 2 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
ICML
2008
IEEE
15 years 10 months ago
Optimizing estimated loss reduction for active sampling in rank learning
Learning to rank is becoming an increasingly popular research area in machine learning. The ranking problem aims to induce an ordering or preference relations among a set of insta...
Pinar Donmez, Jaime G. Carbonell
SIGIR
2008
ACM
14 years 9 months ago
Learning to rank with partially-labeled data
Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorith...
Kevin Duh, Katrin Kirchhoff
MANSCI
2006
121views more  MANSCI 2006»
14 years 9 months ago
Methodologies and Algorithms for Group-Rankings Decision
The problem of group ranking, a.k.a. rank aggregation, has been studied in contexts varying from sports, to multi-criteria decision making, to machine learning, to ranking web pag...
Dorit S. Hochbaum, Asaf Levin