Sciweavers

417 search results - page 3 / 84
» Generalization Bounds for Some Ordinal Regression Algorithms
Sort
View
NIPS
2004
13 years 8 months ago
Online Bounds for Bayesian Algorithms
We present a competitive analysis of Bayesian learning algorithms in the online learning setting and show that many simple Bayesian algorithms (such as Gaussian linear regression ...
Sham M. Kakade, Andrew Y. Ng
ECML
2007
Springer
13 years 11 months ago
Ordinal Classification with Decision Rules
We consider the problem of ordinal classification, in which a value set of the decision attribute (output, dependent variable) is finite and ordered. This problem shares some chara...
Krzysztof Dembczynski, Wojciech Kotlowski, Roman S...
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
14 years 7 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims
AIA
2007
13 years 8 months ago
Improving the aggregating algorithm for regression
Kernel Ridge Regression (KRR) and the recently developed Kernel Aggregating Algorithm for Regression (KAAR) are regression methods based on Least Squares. KAAR has theoretical adv...
Steven Busuttil, Yuri Kalnishkan, Alexander Gammer...
ISIPTA
2003
IEEE
130views Mathematics» more  ISIPTA 2003»
14 years 18 days ago
Some Results on Generalized Coherence of Conditional Probability Bounds
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo