Sciweavers

893 search results - page 15 / 179
» Relational link-based ranking
Sort
View
EOR
2000
64views more  EOR 2000»
13 years 10 months ago
Determination of weights of interacting criteria from a reference set
In this paper, we present a model allowing to determine the weights related to interacting criteria. This is done on the basis of the knowledge of a partial ranking over a referen...
Jean-Luc Marichal, Marc Roubens
ORL
2011
13 years 1 months ago
Random half-integral polytopes
We show that half-integral polytopes obtained as the convex hull of a random set of half-integral points of the 0/1 cube have rank as high as Ω(log n/ log log n) with positive pr...
Gábor Braun, Sebastian Pokutta
CVPR
2008
IEEE
15 years 24 days ago
Multiple-instance ranking: Learning to rank images for image retrieval
We study the problem of learning to rank images for image retrieval. For a noisy set of images indexed or tagged by the same keyword, we learn a ranking model from some training e...
Yang Hu, Mingjing Li, Nenghai Yu
ICML
2009
IEEE
14 years 11 months ago
BoltzRank: learning to maximize expected ranking gain
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...
Maksims Volkovs, Richard S. Zemel
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
14 years 4 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson