Sciweavers

2018 search results - page 68 / 404
» Magnitude-preserving ranking algorithms
Sort
View
FCSC
2007
159views more  FCSC 2007»
15 years 6 months ago
Ranking with uncertain labels and its applications
1 The techniques for image analysis and classi cation generally consider the image sample labels xed and without uncertainties. The rank regression problem is studied in this pape...
Shuicheng Yan, Huan Wang, Jianzhuang Liu, Xiaoou T...
SIGIR
2006
ACM
16 years 18 hour ago
Learning a ranking from pairwise preferences
We introduce a novel approach to combining rankings from multiple retrieval systems. We use a logistic regression model or an SVM to learn a ranking from pairwise document prefere...
Ben Carterette, Desislava Petkova
ICML
2010
IEEE
15 years 7 months ago
Metric Learning to Rank
We study metric learning as a problem of information retrieval. We present a general metric learning algorithm, based on the structural SVM framework, to learn a metric such that ...
Brian McFee, Gert R. G. Lanckriet
CIKM
2009
Springer
16 years 19 days ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
APPROX
2006
Springer
179views Algorithms» more  APPROX 2006»
15 years 9 months ago
Adaptive Sampling and Fast Low-Rank Matrix Approximation
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
Amit Deshpande, Santosh Vempala