Sciweavers

290 search results - page 43 / 58
» The Iterated Version Space Learning
Sort
View
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 years 1 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
TNN
2008
93views more  TNN 2008»
13 years 7 months ago
Towards the Optimal Design of Numerical Experiments
This paper addresses the problem of the optimal design of numerical experiments for the construction of nonlinear surrogate models. We describe a new method, called learner disagre...
S. Gazut, J.-M. Martinez, Gérard Dreyfus, Y...
ICML
2007
IEEE
14 years 8 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
ML
2002
ACM
167views Machine Learning» more  ML 2002»
13 years 7 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
CSB
2004
IEEE
149views Bioinformatics» more  CSB 2004»
13 years 11 months ago
Weighting Features to Recognize 3D Patterns of Electron Density in X-Ray Protein Crystallography
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
Kreshna Gopal, Tod D. Romo, James C. Sacchettini, ...