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 条
  • [21] Improved Semi-supervised Clustering Algorithm Based on Affinity Propagation
    金冉
    刘瑞娟
    李晔锋
    寇春海
    Journal of Donghua University(English Edition), 2015, 32 (01) : 125 - 131
  • [22] Quotient space granularity selection based Affinity Propagation clustering algorithm
    Li, H. (lihui400@163.com), 1600, Binary Information Press (10):
  • [23] A Novel Fast Affinity Propagation Based Visual Word Clustering Algorithm
    Jian, Zhao
    Jian, Jia
    Duan, Xie
    Ning, Feng
    Yu, Xie
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2014, 11 (11) : 2258 - 2262
  • [24] Affinity propagation clustering algorithm based on probabilistic undirected graphical model
    Qin H.
    Zhan J.-J.
    Su Y.-D.
    Kongzhi yu Juece/Control and Decision, 2017, 32 (10): : 1796 - 1802
  • [25] Sensitivity-based damage detection algorithm for structures using vibration data
    Krishnanunni, C. G.
    Raj, R. Sethu
    Nandan, Deepak
    Midhun, C. K.
    Sajith, A. S.
    Ameen, Mohammed
    JOURNAL OF CIVIL STRUCTURAL HEALTH MONITORING, 2019, 9 (01) : 137 - 151
  • [26] Subspace clustering using affinity propagation
    Gan, Guojun
    Ng, Michael Kwolc-Po
    PATTERN RECOGNITION, 2015, 48 (04) : 1455 - 1464
  • [27] Sensitivity-based damage detection algorithm for structures using vibration data
    C. G. Krishnanunni
    R. Sethu Raj
    Deepak Nandan
    C. K. Midhun
    A. S. Sajith
    Mohammed Ameen
    Journal of Civil Structural Health Monitoring, 2019, 9 : 137 - 151
  • [28] Mobility-Based Clustering in VANETs using Affinity Propagation
    Shea, Christine
    Hassanabadi, Behnam
    Valaee, Shahrokh
    GLOBECOM 2009 - 2009 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-8, 2009, : 4500 - 4505
  • [29] Incremental clustering based on affinity propagation
    Xing, Yan
    Meng, Fanrong
    Zhou, Yong
    Journal of Computational Information Systems, 2013, 9 (19): : 7955 - 7965
  • [30] OPTIMIZATION OF TRAVELING SALESMAN PROBLEM USING AFFINITY PROPAGATION CLUSTERING AND GENETIC ALGORITHM
    El-Samak, Ahmad Fouad
    Ashour, Wesam
    JOURNAL OF ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING RESEARCH, 2015, 5 (04) : 239 - 245