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 条
  • [1] Clustering algorithm for experimental datasets using global sensitivity-based affinity propagation (GSAP)
    Wang, Yiru
    Tao, Chenyue
    Zhou, Zijun
    Lin, Keli
    Law, Chung K.
    Yang, Bin
    Combustion and Flame, 2024, 259
  • [2] An Affinity Propagation Clustering Algorithm for Mixed Numeric and Categorical Datasets
    Zhang, Kang
    Gu, Xingsheng
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2014, 2014
  • [3] Affinity Propagation Clustering Algorithm based on Spark Platform
    Zhang, Lijia
    Cheng, Lianglun
    PROCEEDINGS OF THE 2016 2ND WORKSHOP ON ADVANCED RESEARCH AND TECHNOLOGY IN INDUSTRY APPLICATIONS, 2016, 81 : 532 - 535
  • [4] A visual word clustering algorithm based on affinity propagation
    Zhao, Jian
    Sun, Cheng
    Ma, Miao
    Xie, Yu
    2012 7TH INTERNATIONAL CONFERENCE ON SYSTEM OF SYSTEMS ENGINEERING (SOSE), 2012, : 14 - 17
  • [5] A Stable Clustering Algorithm based on Affinity Propagation for VANETs
    Shahwani, Hamayoun
    Toan Duc Bui
    Jeong, Jaehoon
    Shin, Jitae
    2017 19TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATIONS TECHNOLOGY (ICACT) - OPENING NEW ERA OF SMART SOCIETY, 2017, : 501 - 504
  • [6] An improved PSO clustering algorithm based on affinity propagation
    Zheng, Yuyan
    Qu, Jianhua
    Zhou, Yang
    1600, World Scientific and Engineering Academy and Society, Ag. Ioannou Theologou 17-23, Zographou, Athens, 15773, Greece (12): : 447 - 456
  • [7] Online Stream Clustering using Density and Affinity Propagation Algorithm
    Zhang, Jian-Peng
    Chen, Fu-Cai
    Liu, Li-Xiong
    Li, Shao-Mei
    PROCEEDINGS OF 2013 IEEE 4TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS), 2012, : 828 - 832
  • [8] A Partial CSI Based Affinity Propagation Dynamic Clustering Algorithm
    Ran, Xiaomin
    Tong, Min
    Mo, Youquan
    2013 INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND TECHNOLOGY (ICIST), 2013, : 1561 - 1566
  • [9] Data Stream Clustering Algorithm Based on Affinity Propagation and Density
    Li Yang
    Tan Baihong
    MANUFACTURING SYSTEMS AND INDUSTRY APPLICATIONS, 2011, 267 : 444 - 449
  • [10] Fingerprint indoor positioning algorithm based on affinity propagation clustering
    Zengshan Tian
    Xiaomou Tang
    Mu Zhou
    Zuohong Tan
    EURASIP Journal on Wireless Communications and Networking, 2013