158 search results - page 27 / 32 » Prediction of Ordinal Classes Using Regression Trees |
NIPS
2007
13 years 9 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
TOG
2012
11 years 10 months ago
2012
This paper investigates “Schelling points” on 3D meshes, feature points selected by people in a pure coordination game due to their salience. To collect data for this investig...
AI
2000
Springer
13 years 7 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Current work in object categorization discriminates
among objects that typically possess gross differences
which are readily apparent. However, many applications
require making ...