Clustering algorithm for experimental datasets using global sensitivity-based affinity propagation (GSAP)

被引:3
|
作者
Wang, Yiru [1 ,2 ,3 ]
Tao, Chenyue [1 ,2 ,3 ]
Zhou, Zijun [1 ,2 ,3 ]
Lin, Keli [1 ,2 ,3 ]
Law, Chung K. [1 ,2 ,4 ]
Yang, Bin [1 ,2 ,3 ]
机构
[1] Tsinghua Univ, Ctr Combust Energy, Beijing 100084, Peoples R China
[2] Tsinghua Univ, Dept Energy & Power Engn, Beijing 100084, Peoples R China
[3] Tsinghua Univ, Key Lab Thermal Sci & Power Engn MOE, Int Joint Lab Low Carbon Clean Energy Innovat, Beijing 100084, Peoples R China
[4] Princeton Univ, Dept Mech & Aerosp Engn, Princeton, NJ 08544 USA
关键词
Data clustering; Affinity propagation; Global sensitivity analysis; Uncertainty quantification; COMBUSTION KINETIC-MODELS; UNCERTAINTY QUANTIFICATION; EXPERIMENTAL-DESIGN; RS-HDMR; OPTIMIZATION; MINIMIZATION; CONSISTENCY;
D O I
10.1016/j.combustflame.2023.113121
中图分类号
O414.1 [热力学];
学科分类号
摘要
To minimize the uncertainty of the parameters in combustion kinetics models, Bayesian methods are commonly used for uncertainty constraints based on experimental data. With the rapid and substantial growth of experimental data, using all the experimental data for optimization is not only redundant and time-consuming, but it could also lead to data consistency problems. In this work, the global sensitivitybased affinity propagation method (GSAP) is proposed to cluster experimental datasets and to select representative experimental conditions. Specifically, the global sensitivity coefficient is first obtained through an analysis to characterize the sources of uncertainty in the kinetic model under different experimental conditions. The similarity coefficient, which is defined based on the global sensitivity, measures the resemblance between two experimental conditions. By exchanging messages calculated from similarity, affinity propagation enables the experimental dataset to be automatically clustered into several classes without specifying the number of classes in advance. This method innovatively introduces the consideration of model and experimental uncertainty under different conditions to obtain better optimization results. The correctness and effectiveness of the method are validated through clustering and optimizing on a laminar flame speed dataset of common C 0 -C 4 fuels. The dataset consisting of 288 experimental conditions has been automatically clustered into 27 categories, and an exemplar of each category is given. These exemplary conditions reflect the dominant chemistry behind their cluster. At the same time, these conditions have larger model prediction uncertainty and smaller experimental uncertainty to provide better Bayesian constraints. The uncertainty of the model parameters after Bayesian optimization is effectively constrained. The average uncertainty of model predictions across the dataset is reduced from 30 % to 10 % using only 27 exemplar conditions for optimization. While selecting experimental data for model optimization, the clustering strategies provided by this method also, in turn, help understand its underlying chemical essence.(c) 2023 The Combustion Institute. Published by Elsevier Inc. All rights reserved.
引用
收藏
页数:9
相关论文
共 50 条
  • [41] Sensitivity-Based Parameterization for Aerodynamic Shape Global Optimization
    Li, Haoge
    Li, Chengrui
    Chen, Weifang
    Yang, Hua
    JOURNAL OF AEROSPACE ENGINEERING, 2022, 35 (02)
  • [42] Sensitivity-based gate delay propagation in static timing analysis
    Nazarian, S
    Pedram, M
    Tuncer, E
    Lin, T
    6TH INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN, PROCEEDINGS, 2005, : 536 - 541
  • [43] Clustering of fMRI Data Using Affinity Propagation
    Liu, Dazhong
    Lu, Wanxuan
    Zhong, Ning
    BRAIN INFORMATICS, BI 2010, 2010, 6334 : 399 - 406
  • [44] Robust Speaker Clustering Using Affinity Propagation
    Zhang, Xiang
    Lu, Ping
    Suo, Hongbin
    Zhao, Qingwei
    Yan, Yonghong
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2008, E91D (11): : 2739 - 2741
  • [45] A Sensitivity-Based Training Algorithm with Architecture Adjusting for Madalines
    Liu, Yanjun
    Zeng, Xiaoqin
    Zhong, Shuiming
    Wu, Shengli
    2009 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2009), VOLS 1-9, 2009, : 4586 - +
  • [46] Transfer affinity propagation-based clustering
    Hang, Wenlong
    Chung, Fu-lai
    Wang, Shitong
    INFORMATION SCIENCES, 2016, 348 : 337 - 356
  • [47] GABoost: A Clustering Based Undersampling Algorithm for Highly Imbalanced Datasets Using Genetic Algorithm
    Ajilisa, O. A.
    Jagathyraj, V. P.
    Sabu, M. K.
    INNOVATIONS IN BIO-INSPIRED COMPUTING AND APPLICATIONS, 2019, 939 : 235 - 246
  • [48] Non-Stationary Signals Separation Using STFT and Affinity Propagation Clustering Algorithm
    Sattar, F.
    Driessen, P. F.
    2013 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING (PACRIM), 2013, : 389 - 394
  • [49] Affinity propagation clustering algorithm based on large-scale data-set
    Wang L.
    Zheng K.
    Tao X.
    Han X.
    International Journal of Computers and Applications, 2018, 40 (03) : 1 - 6
  • [50] Semi-supervised Affinity Propagation Clustering Algorithm based on Fireworks Explosion ptimization
    Wang Limin
    Han Xuming
    Ji Qiang
    2014 INTERNATIONAL CONFERENCE ON MANAGEMENT OF E-COMMERCE AND E-GOVERNMENT (ICMECG), 2014, : 273 - 279