Sciweavers

1016 search results - page 44 / 204
» Generalized distances between rankings
Sort
View
126
Voted
SIGIR
2011
ACM
14 years 3 months ago
The interactive PRP for diversifying document rankings
The assumptions underlying the Probability Ranking Principle (PRP) have led to a number of alternative approaches that cater or compensate for the PRP’s limitations. In this pos...
Guido Zuccon, Leif Azzopardi, C. J. van Rijsbergen
165
Voted
WSDM
2012
ACM
352views Data Mining» more  WSDM 2012»
13 years 8 months ago
Multi-relational matrix factorization using bayesian personalized ranking for social network data
A key element of the social networks on the internet such as Facebook and Flickr is that they encourage users to create connections between themselves, other users and objects. On...
Artus Krohn-Grimberghe, Lucas Drumond, Christoph F...
92
Voted
PAMI
2006
164views more  PAMI 2006»
15 years 19 days ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
IPM
2008
100views more  IPM 2008»
15 years 21 days ago
Query-level loss functions for information retrieval
Many machine learning technologies such as support vector machines, boosting, and neural networks have been applied to the ranking problem in information retrieval. However, since...
Tao Qin, Xu-Dong Zhang, Ming-Feng Tsai, De-Sheng W...
97
Voted
ICML
2010
IEEE
15 years 1 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan