2017
DOI: 10.1155/2017/3021950
|View full text |Cite
|
Sign up to set email alerts
|

Kernel Parameter Optimization for Kriging Based on Structural Risk Minimization Principle

Abstract: An improved kernel parameter optimization method based on Structural Risk Minimization (SRM) principle is proposed to enhance the generalization ability of traditional Kriging surrogate model. This article first analyses the importance of the generalization ability as an assessment criteria of surrogate model from the perspective of statistics and proves the applicability to Kriging. Kernel parameter optimization method is used to improve the fitting precision of Kriging model. With the smoothness measure of t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…Therefore, RELM works on the SRM principle which is based on the statistical learning theory. It provides the relationship between empirical risk and real risk, which is known as the bound of the generalization ability [ 63 ]. Here, the empirical risk is represented by the sum of squared error, i.e., ‖ ɛ ‖ 2 and structural risk can be represented with ‖ β ‖ 2 .…”
Section: Proposed Methodologymentioning
confidence: 99%
“…Therefore, RELM works on the SRM principle which is based on the statistical learning theory. It provides the relationship between empirical risk and real risk, which is known as the bound of the generalization ability [ 63 ]. Here, the empirical risk is represented by the sum of squared error, i.e., ‖ ɛ ‖ 2 and structural risk can be represented with ‖ β ‖ 2 .…”
Section: Proposed Methodologymentioning
confidence: 99%
“…X c is the sum of the N-CWPIC. SVM is a machine learning method based on statistical learning theory and structural risk minimization [14][15][16]. The algorithm essentially finds a maximum-margin hyper-plane (in a three-dimensional space, its hyper-plane is a two-dimensional plane) to maximize the distance between the hyper-plane and the nearest data point.…”
Section: Cwpic Extraction Of Arc Faultsmentioning
confidence: 99%