Bias-variance decomposition in Genetic Programming
نویسندگان
چکیده
منابع مشابه
Doursat Bias - variance decomposition in Genetic Programming
We study properties of Linear Genetic Programming (LGP) through several regression and classification benchmarks. In each problem, we decompose the results into bias and variance components, and explore the effect of varying certain key parameters on the overall error and its decomposed contributions. These parameters are the maximum program size, the initial population, and the function set us...
متن کاملPractical Bias Variance Decomposition
Bias variance decomposition for classifiers is a useful tool in understanding classifier behavior. Unfortunately, the literature does not provide consistent guidelines on how to apply a bias variance decomposition. This paper examines the various parameters and variants of empirical bias variance decompositions through an extensive simulation study. Based on this study, we recommend to use ten ...
متن کاملTomographic Considerations in Ensemble Bias/Variance Decomposition
Classifier decision fusion has been shown to act in a manner analogous to the back-projection of Radon transformations when individual classifier feature sets are non or partially overlapping. It is possible, via this analogy, to demonstrate that standard linear classifier fusion introduces a morphological bias into the decision space due to the implicit angular undersampling of the feature sel...
متن کاملCrossover Bias in Genetic Programming
Path length, or search complexity, is an understudied property of trees in genetic programming. Unlike size and depth measures, path length directly measures the balancedness or skewedness of a tree. Here a close relative to path length, called visitation length, is studied. It is shown that a population undergoing standard crossover will introduce a crossover bias in the visitation length. Thi...
متن کاملInductive Bias and Genetic Programming
Many engineering problems may be described as a search for one near optimal description amongst many possibilities, given certain constraints. Search techniques, such as genetic programming, seem appropriate to represent many problems. This paper describes a grammatically based learning technique , based upon the genetic programming paradigm, that allows declarative biasing and modiies the bias...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2016
ISSN: 2391-5455
DOI: 10.1515/math-2016-0005