Sciweavers

99 search results - page 2 / 20
» Ranking and Scoring Using Empirical Risk Minimization
Sort
View
IM
2007
13 years 9 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
JMLR
2010
105views more  JMLR 2010»
13 years 4 months ago
Classification Methods with Reject Option Based on Convex Risk Minimization
In this paper, we investigate the problem of binary classification with a reject option in which one can withhold the decision of classifying an observation at a cost lower than t...
Ming Yuan, Marten H. Wegkamp
CIVR
2008
Springer
245views Image Analysis» more  CIVR 2008»
13 years 11 months ago
Probabilistic optimized ranking for multimedia semantic concept detection via RVM
We present a probabilistic ranking-driven classifier for the detection of video semantic concept, such as airplane, building, etc. Most existing concept detection systems utilize ...
Yantao Zheng, Shi-Yong Neo, Tat-Seng Chua, Qi Tian
ALDT
2011
Springer
200views Algorithms» more  ALDT 2011»
12 years 9 months ago
Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs
A variety of preference aggregation schemes and voting rules have been developed in social choice to support group decision making. However, the requirement that participants provi...
Tyler Lu, Craig Boutilier
IIE
2006
101views more  IIE 2006»
13 years 9 months ago
Random Factors in IOI 2005 Test Case Scoring
We examine the precision with which the cumulative score from a suite of test cases ranks participants in the International Olympiad in Informatics (IOI). Our concern is the abilit...
Gordon V. Cormack