Name
Abstract | ||
|---|---|---|
This paper presents an approach to automated discovery of high-order multivariate polynomials by inductive Genetic Programming
(iGP). Evolutionary search is used for learning polynomials represented as non-linear multivariate trees. Optimal search performance
is pursued with balancing the statistical bias and the variance of iGP. We reduce the bias by extending the set of basis polynomials
for better agreement with the examples. Possible overfitting due to the reduced bias is conteracted by a variance component,
implemented as a regularizing factor of the error in an MDL fitness function. Experimental results demonstrate that regularized
iGP discovers accurate, parsimonious, and predictive polynomials when trained on practical data mining tasks.
|
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/978-3-540-48247-5_58 | PKDD |
Keywords | Field | DocType |
automated discovery,inductive genetic programming,data mining,fitness function | Polynomial,Multivariate statistics,Computer science,Algorithm,Genetic programming,Fitness function,Artificial intelligence,Overfitting,Multivariate analysis,Machine learning,Genetic program,Genetic algorithm | Conference |
Volume | ISSN | ISBN |
1704 | 0302-9743 | 3-540-66490-4 |
Citations | PageRank | References |
9 | 0.86 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikolay I. Nikolaev | 1 | 113 | 13.68 |
| Hitoshi Iba | 2 | 1541 | 138.51 |