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 条
  • [11] An expert weighting method based on affinity propagation clustering algorithm
    Liu, Bingqi
    Hu, Jianbo
    Wang, Yingyang
    Liu, Chang
    SECOND INTERNATIONAL CONFERENCE ON PHYSICS, MATHEMATICS AND STATISTICS, 2019, 1324
  • [12] Fingerprint indoor positioning algorithm based on affinity propagation clustering
    Tian, Zengshan
    Tang, Xiaomou
    Zhou, Mu
    Tan, Zuohong
    EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2013,
  • [13] A Parallel Attribute Reduction Algorithm based on Affinity Propagation Clustering
    Zhu, Hong
    Ding, Shifei
    Xu, Xinzheng
    Xu, Li
    JOURNAL OF COMPUTERS, 2013, 8 (04) : 990 - 997
  • [14] Color Image Segmentation Algorithm Based on Affinity Propagation Clustering
    Wang, Lei
    Zhang, Lin
    FOUNDATIONS OF INTELLIGENT SYSTEMS (ISKE 2011), 2011, 122 : 731 - 739
  • [15] Semi-supervised clustering based on affinity propagation algorithm
    Xiao, Yu
    Yu, Jian
    Ruan Jian Xue Bao/Journal of Software, 2008, 19 (11): : 2803 - 2813
  • [16] Point Cloud Simplification Based on an Affinity Propagation Clustering Algorithm
    Li, Lanlan
    Chen, S. Y.
    Guan, Qiu
    Du, Xiaoyan
    Hu, Z. Z.
    2009 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, VOL III, PROCEEDINGS, 2009, : 163 - 167
  • [17] Proper Global Shared Preference Detection Based on Golden Section and Genetic Algorithm for Affinity Propagation Clustering
    Jiao, Libin
    Bie, Rongfang
    Zhang, Guangzhi
    Wang, Shenling
    Mehmood, Rashid
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2016, 12 (08):
  • [18] Affinity Propagation Clustering Using Path Based Similarity
    Jiang, Yuan
    Liao, Yuliang
    Yu, Guoxian
    ALGORITHMS, 2016, 9 (03)
  • [19] On Expanded and Improved Affinity Propagation Clustering Algorithm
    Chen Xinquan
    MEASURING TECHNOLOGY AND MECHATRONICS AUTOMATION, PTS 1 AND 2, 2011, 48-49 : 753 - 756
  • [20] Instance selection for data reduction using affinity propagation clustering algorithm
    Feng, Xinghua
    Liu, Xiaodong
    Wang, Xin
    ICIC Express Letters, 2013, 7 (08): : 2423 - 2428