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 条
  • [31] Band Selection Algorithm Based on Multi-Feature and Affinity Propagation Clustering
    Zhuang, Junbin
    Chen, Wenying
    Huang, Xunan
    Yan, Yunyi
    REMOTE SENSING, 2025, 17 (02)
  • [32] Multi-objective Differential Evolution Algorithm Based on Affinity Propagation Clustering
    Qu, Dan
    Li, Hongyi
    Chen, Huafei
    IAENG International Journal of Applied Mathematics, 2023, 53 (04)
  • [33] Semi-supervised affinity propagation clustering algorithm based on stratified combination
    Zhang, Z. (zhangzhen2096@163.com), 2013, Science Press (35):
  • [34] A New Method for Grayscale Image Segmentation Based on Affinity Propagation Clustering Algorithm
    Du, Hui
    Wang, Yuping
    Duan, Lili
    2013 9TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2013, : 170 - 173
  • [35] Gravity Theory-Based Affinity Propagation Clustering Algorithm and Its Applications
    Wang, Limin
    Hao, Zhiyuan
    Han, Xuming
    Zhou, Ruihong
    TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2018, 25 (04): : 1125 - 1135
  • [36] CLUSTERING LARGE-SCALE DATA BASED ON MODIFIED AFFINITY PROPAGATION ALGORITHM
    Serdah, Ahmed M.
    Ashour, Wesam M.
    JOURNAL OF ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING RESEARCH, 2016, 6 (01) : 23 - 33
  • [37] Voting Affinity Propagation Algorithm for Clustering XML Documents
    Wang, Xu
    Wei, Jinmao
    Fan, Baoquan
    Yang, Ting
    PROCEEDINGS OF 2012 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2012), 2012, : 1907 - 1913
  • [38] Semi-supervised Affinity Propagation Clustering Algorithm Based On Kernel Function
    Zhao Xiaoqiang
    Xie Yaping
    2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2015, : 3275 - 3279
  • [39] Global Sensitivity-Based Model Updating for Heritage Structures
    Boscato, Giosue
    Russo, Salvatore
    Ceravolo, Rosario
    Fragonara, Luca Zanotti
    COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2015, 30 (08) : 620 - 635
  • [40] Load Profile Based Electricity Consumer Clustering Using Affinity Propagation
    Zarabie, Ahmad Khaled
    Lashkarbolooki, Sahar
    Das, Sanjoy
    Jhala, Kumarsinh
    Pahwa, Anil
    2019 IEEE INTERNATIONAL CONFERENCE ON ELECTRO INFORMATION TECHNOLOGY (EIT), 2019, : 474 - 478