Sciweavers

3395 search results - page 85 / 679
» Learning to efficiently rank
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 9 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
ITA
2006
163views Communications» more  ITA 2006»
13 years 9 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
EOR
2002
165views more  EOR 2002»
13 years 8 months ago
Review of ranking methods in the data envelopment analysis context
Within data envelopment analysis (DEA) is a sub-group of papers in which many researchers have sought to improve the differential capabilities of DEA and to fully rank both effici...
Nicole Adler, Lea Friedman, Zilla Sinuany-Stern
SIGIR
2012
ACM
11 years 11 months ago
Parallelizing ListNet training using spark
As ever-larger training sets for learning to rank are created, scalability of learning has become increasingly important to achieving continuing improvements in ranking accuracy [...
Shilpa Shukla, Matthew Lease, Ambuj Tewari
ICML
2004
IEEE
14 years 10 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye