Sciweavers

120
Voted
ICML
2006
IEEE
16 years 3 months ago
An empirical comparison of supervised learning algorithms
A number of supervised learning methods have been introduced in the last decade. Unfortunately, the last comprehensive empirical evaluation of supervised learning was the Statlog ...
Rich Caruana, Alexandru Niculescu-Mizil
83
Voted
ICML
2006
IEEE
16 years 3 months ago
Fast nonparametric clustering with Gaussian blurring mean-shift
Miguel Á. Carreira-Perpiñán
99
Voted
ICML
2006
IEEE
16 years 3 months ago
Learning algorithms for online principal-agent problems (and selling goods online)
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This...
Vincent Conitzer, Nikesh Garera
68
Voted
ICML
2006
IEEE
16 years 3 months ago
Trading convexity for scalability
Fabian H. Sinz, Jason Weston, Léon Bottou, ...
61
Voted
ICML
2006
IEEE
16 years 3 months ago
Semi-supervised learning for structured output variables
Ulf Brefeld, Tobias Scheffer
103
Voted
ICML
2006
IEEE
16 years 3 months ago
Efficient co-regularised least squares regression
In many applications, unlabelled examples are inexpensive and easy to obtain. Semisupervised approaches try to utilise such examples to reduce the predictive error. In this paper,...
Stefan Wrobel, Thomas Gärtner, Tobias Scheffe...
90
Voted
ICML
2006
IEEE
16 years 3 months ago
A regularization framework for multiple-instance learning
Pak-Ming Cheung, James T. Kwok
127
Voted
ICML
2006
IEEE
16 years 3 months ago
Convex optimization techniques for fitting sparse Gaussian graphical models
We consider the problem of fitting a large-scale covariance matrix to multivariate Gaussian data in such a way that the inverse is sparse, thus providing model selection. Beginnin...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
118
Voted
ICML
2006
IEEE
16 years 3 months ago
On Bayesian bounds
We show that several important Bayesian bounds studied in machine learning, both in the batch as well as the online setting, arise by an application of a simple compression lemma....
Arindam Banerjee
112
Voted
ICML
2006
IEEE
16 years 3 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani