Sciweavers

ML
2000
ACM
13 years 4 months ago
Enlarging the Margins in Perceptron Decision Trees
Capacity control in perceptron decision trees is typically performed by controlling their size. We prove that other quantities can be as relevant to reduce their flexibility and co...
Kristin P. Bennett, Nello Cristianini, John Shawe-...
INFORMATICALT
2000
118views more  INFORMATICALT 2000»
13 years 4 months ago
Generalization Error of Randomized Linear Zero Empirical Error Classifier: Simple Asymptotics for Centered Data Case
An estimation of the generalization performance of classifier is one of most important problems in pattern clasification and neural network training theory. In this paper we estima...
Valdas Diciunas, Sarunas Raudys
IEICET
2007
94views more  IEICET 2007»
13 years 4 months ago
A New Meta-Criterion for Regularized Subspace Information Criterion
In order to obtain better generalization performance in supervised learning, model parameters should be determined appropriately, i.e., they should be determined so that the gener...
Yasushi Hidaka, Masashi Sugiyama
IEICET
2007
68views more  IEICET 2007»
13 years 4 months ago
Generalization Error Estimation for Non-linear Learning Methods
Estimating the generalization error is one of the key ingredients of supervised learning since a good generalization error estimator can be used for model selection. An unbiased g...
Masashi Sugiyama
IEICET
2007
114views more  IEICET 2007»
13 years 4 months ago
Analytic Optimization of Adaptive Ridge Parameters Based on Regularized Subspace Information Criterion
In order to obtain better learning results in supervised learning, it is important to choose model parameters appropriately. Model selection is usually carried out by preparing a ...
Shun Gokita, Masashi Sugiyama, Keisuke Sakurai
JMLR
2006
140views more  JMLR 2006»
13 years 4 months ago
Active Learning in Approximately Linear Regression Based on Conditional Expectation of Generalization Error
The goal of active learning is to determine the locations of training input points so that the generalization error is minimized. We discuss the problem of active learning in line...
Masashi Sugiyama
JMLR
2008
117views more  JMLR 2008»
13 years 4 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
JMLR
2008
111views more  JMLR 2008»
13 years 4 months ago
Ranking Categorical Features Using Generalization Properties
Feature ranking is a fundamental machine learning task with various applications, including feature selection and decision tree learning. We describe and analyze a new feature ran...
Sivan Sabato, Shai Shalev-Shwartz
BMCBI
2008
139views more  BMCBI 2008»
13 years 4 months ago
The C1C2: A framework for simultaneous model selection and assessment
Background: There has been recent concern regarding the inability of predictive modeling approaches to generalize to new data. Some of the problems can be attributed to improper m...
Martin Eklund, Ola Spjuth, Jarl E. S. Wikberg
ESANN
2003
13 years 6 months ago
Fast approximation of the bootstrap for model selection
The bootstrap resampling method may be efficiently used to estimate the generalization error of a family of nonlinear regression models, as artificial neural networks. The main dif...
Geoffroy Simon, Amaury Lendasse, Vincent Wertz, Mi...