Smooth fitting with a method for determining the regularization parameter under the genetic programming algorithm

DOI10.1016/S0020-0255(01)00084-6zbMath0981.68738OpenAlexW2059218015WikidataQ126590635 ScholiaQ126590635MaRDI QIDQ5946305

Yun Seog Yeun, Young Soon Yang, Sang Min Han, Kyung Ho Lee

Publication date: 14 October 2001

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(01)00084-6

zbMATH Keywords

genetic programmingcross-validation B-splines

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Polynomial genetic programming for response surface modeling. I. A methodology

Uses Software

• GCVSPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite element approximation of regularized solutions of the inverse potential problem of electrocardiography and applications to experimental data
• Linear and nonlinear associative memories for parameter estimation
• Self-organization and associative memory.
• Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
• Associative memory approach to the identification of structural and mechanical systems
• Function approximations by superimposing genetic programming trees: with applications to engineering problems
• Weighted linear associative memory approach to nonlinear parameter estimation
• `` Direct Search Solution of Numerical and Statistical Problems
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems

This page was built for publication: Smooth fitting with a method for determining the regularization parameter under the genetic programming algorithm