A surrogate method for density-based global sensitivity analysis

被引:9
作者
Rahman, Sharif [1 ]
机构
[1] Univ Iowa, Coll Engn, Iowa City, IA 52242 USA
基金
美国国家科学基金会;
关键词
f-Divergence; f-Sensitivity index; Hellinger distance; Kernel density estimation; Kullback-Leibler divergence; Polynomial dimensional decomposition; Total variational distance; POLYNOMIAL DIMENSIONAL DECOMPOSITION; UNCERTAINTY IMPORTANCE MEASURE; MODELS; EXPANSIONS; CHAOS;
D O I
10.1016/j.ress.2016.07.002
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper describes an accurate and computationally efficient surrogate method, known as the polynomial dimensional decomposition (PDD) method, for estimating a general class of density-based f-sensitivity indices. Unlike the variance-based Sobol index, the f-sensitivity index is applicable to random input following dependent as well as independent probability distributions. The proposed method involves PDD approximation of a high-dimensional stochastic response of interest, forming a surrogate input-output data set; kernel density estimations of output probability density functions from the surrogate data set; and subsequent Monte Carlo integration for estimating the f-sensitivity index. Developed for an arbitrary convex function f and an arbitrary probability distribution of input variables, the method is capable of calculating a wide variety of sensitivity or importance measures, including the mutual information, squared-loss mutual information, and L-1-distance-based importance measure. Three numerical examples illustrate the accuracy, efficiency, and convergence properties of the proposed method in computing sensitivity indices derived from three prominent divergence or distance measures. A finite element-based global sensitivity analysis of a leverarm was performed, demonstrating the ability of the method in solving industrial-scale engineering problems. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:224 / 235
页数:12
相关论文
共 50 条
[21]   Design of computationally efficient density-based clustering algorithms [J].
Nanda, Satyasai Jagannath ;
Panda, Ganapati .
DATA & KNOWLEDGE ENGINEERING, 2015, 95 :23-38
[22]   An Efficient Density-based Approach for Data Mining Tasks [J].
Carlotta Domeniconi ;
Dimitrios Gunopulos .
Knowledge and Information Systems, 2004, 6 :750-770
[23]   An application of the Kriging method in global sensitivity analysis with parameter uncertainty [J].
Wang, Pan ;
Lu, Zhenzhou ;
Tang, Zhangchun .
APPLIED MATHEMATICAL MODELLING, 2013, 37 (09) :6543-6555
[24]   Reliability analysis of concrete gravity dams based on the Bayesian line sampling algorithm and global sensitivity analysis method [J].
Liu, Mingkai ;
Mao, Yanpian ;
Qi, Yining ;
Su, Huaizhi ;
Yuan, Jin ;
Qi, Zhiyong ;
Du, Xuhuang .
EXPERT SYSTEMS WITH APPLICATIONS, 2025, 281
[25]   Stability Evaluation of Slope Based on Global Sensitivity Analysis [J].
Xu, Zhaoxia ;
Wang, Xiuzhen ;
Guo, Lu ;
Yu, Teng .
COMPLEXITY, 2024, 2024
[26]   A high-order density-based finite volume method for the computation of all-speed flows [J].
Nogueira, Xesus ;
Ramirez, Luis ;
Khelladi, Sofiane ;
Chassaing, Jean-Camille ;
Colominas, Ignasi .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2016, 298 :229-251
[27]   Multivariate global sensitivity analysis for dynamic models based on wavelet analysis [J].
Xiao, Sinan ;
Lu, Zhenzhou ;
Wang, Pan .
RELIABILITY ENGINEERING & SYSTEM SAFETY, 2018, 170 :20-30
[28]   Density-based particle swarm optimization algorithm for data clustering [J].
Alswaitti, Mohammed ;
Albughdadi, Mohanad ;
Isa, Nor Ashidi Mat .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 91 :170-186
[29]   DHONE: Density-based higher-order network embedding [J].
Guan, Wei ;
Guan, Qing ;
Duan, Yueran .
INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2024, 35 (10)
[30]   A density-based oversampling approach for class imbalance and data overlap [J].
Zhang, Ruizhi ;
Lu, Shaowu ;
Yan, Baokang ;
Yu, Puliang ;
Tang, Xiaoqi .
COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 186