TY - JOUR
T1 - Adaptive sparse polynomial chaos expansions for global sensitivity analysis based on support vector regression
AU - Cheng, Kai
AU - Lu, Zhenzhou
N1 - Publisher Copyright:
© 2017 Elsevier Ltd
PY - 2018/1/1
Y1 - 2018/1/1
N2 - In the context of uncertainty analysis, Polynomial chaos expansion (PCE) has been proven to be a powerful tool for developing meta-models in a wide range of applications, especially for sensitivity analysis. But the computational cost of classic PCE grows exponentially with the size of the input variables. An efficient approach to address this problem is to build a sparse PCE. In this paper, a full PCE meta-model is first developed based on support vector regression (SVR) technique using an orthogonal polynomials kernel function. Then an adaptive algorithm is proposed to select the significant basis functions from the kernel function. The selection criterion is based on the variance contribution of each term to the model output. In the adaptive algorithm, an elimination procedure is used to delete the non-significant bases, and a selection procedure is used to select the important bases. Due to the structural risk minimization principle employing by SVR model, the proposed method provides better generalization ability compared to the common least square regression algorithm. The proposed method is examined by several examples and the global sensitivity analysis is performed. The results show that the proposed method establishes accurate meta-model for global sensitivity analysis of complex models.
AB - In the context of uncertainty analysis, Polynomial chaos expansion (PCE) has been proven to be a powerful tool for developing meta-models in a wide range of applications, especially for sensitivity analysis. But the computational cost of classic PCE grows exponentially with the size of the input variables. An efficient approach to address this problem is to build a sparse PCE. In this paper, a full PCE meta-model is first developed based on support vector regression (SVR) technique using an orthogonal polynomials kernel function. Then an adaptive algorithm is proposed to select the significant basis functions from the kernel function. The selection criterion is based on the variance contribution of each term to the model output. In the adaptive algorithm, an elimination procedure is used to delete the non-significant bases, and a selection procedure is used to select the important bases. Due to the structural risk minimization principle employing by SVR model, the proposed method provides better generalization ability compared to the common least square regression algorithm. The proposed method is examined by several examples and the global sensitivity analysis is performed. The results show that the proposed method establishes accurate meta-model for global sensitivity analysis of complex models.
KW - Adaptive kernel function
KW - Global sensitivity analysis
KW - Sparse polynomial chaos expansion
KW - Support vector regression
UR - http://www.scopus.com/inward/record.url?scp=85029824938&partnerID=8YFLogxK
U2 - 10.1016/j.compstruc.2017.09.002
DO - 10.1016/j.compstruc.2017.09.002
M3 - 文章
AN - SCOPUS:85029824938
SN - 0045-7949
VL - 194
SP - 86
EP - 96
JO - Computers and Structures
JF - Computers and Structures
ER -