Sciweavers

52 search results - page 4 / 11
» ml 2002
Sort
View
ML
2002
ACM
121views Machine Learning» more  ML 2002»
13 years 9 months ago
Choosing Multiple Parameters for Support Vector Machines
The problem of automatically tuning multiple parameters for pattern recognition Support Vector Machines (SVMs) is considered. This is done by minimizing some estimates of the gener...
Olivier Chapelle, Vladimir Vapnik, Olivier Bousque...
ML
2002
ACM
128views Machine Learning» more  ML 2002»
13 years 9 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
ML
2002
ACM
168views Machine Learning» more  ML 2002»
13 years 9 months ago
On Average Versus Discounted Reward Temporal-Difference Learning
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
John N. Tsitsiklis, Benjamin Van Roy
ML
2002
ACM
145views Machine Learning» more  ML 2002»
13 years 9 months ago
Boosting Methods for Regression
In this paper we examine ensemble methods for regression that leverage or "boost" base regressors by iteratively calling them on modified samples. The most successful lev...
Nigel Duffy, David P. Helmbold
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 9 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio