首页> 外文会议>ISG*ISARC World Conference >New sampling scheme for neural network-based metamodelling with application to air pollutant estimation
【24h】

New sampling scheme for neural network-based metamodelling with application to air pollutant estimation

机译:基于神经网络的元模拟的新抽样方案,适用于空气污染物估算

获取原文

摘要

Purpose A new method for the design of experiments (DOE) or sampling technique is proposed, using a distance weight function and the k-means theory. The radial basis function neural network metamodelling approach is used to evaluate the performance of the proposed DOE by using an n-degree of test function, applied to the complex nonlinear problem of spatial distribution of air pollutants. A comparison study is included to analyse the performance of the proposed technique against available methods such as the n-level full fractional design method and the Latin Hypercube Design method. Method For one design objective and n number of input design variables, a set of input-output training dataset are X {x_1~(1), x_1~(2), … , x_1~(I); …; x_j~(1), x_j~(2), … x_j~(i)|i=1, …, m, j=1, … n} and Y = {y~(1), y~(2), …, y~(i) i =1, 2, …, m}, where m is the maximum number of the data points. Each data point has its own unique weight obtained from the distance factors between point pi and a common reference point c, by using the Euclidean distance measure (i.e. d_i (p~i, c)). The weights represent the distinct patterns between each data point. A neighbour can be clustered as a group where the data point is taken as a candidate. To generalise the solution, the pairs of the input and output data points are combined to become the design space, given as S = {X; Y}. The solution can be simplified further if we set a common reference centre at the coordinate origin by firstly normalising the design space to [s] = [-1, 1]~(n+1). A list of distance weight values, D {d_1, d_2, … d_|i=1, 2, …, m}, is then sorted and clustered by using an available clustering algorithm. In this work, the k-means algorithm based on the Voronoi iteration is used due to its fast computation especially in the 1-dimensional case. Here, the initial points are replicated randomly, to expectedly result in a global minimum solution. The maximum number of k corresponds to the number data points that will be sampled. Results & Discussion to initially validate the accuracy of the scheme, a known test function called as "Hock-Schittkowski Problem 100" is used in which this nonlinear problem involving of 7 variables, 1 objective, and 4 constraints. A prepared dataset which generated randomly, are sampled at different sample size N, and then mapped using RBFNN metamodel.
机译:目的,使用距离重量函数和k均值理论提出了一种设计实验设计的新方法(DOE)或采样技术。径向基函数神经网络中典型方法用于通过使用N型测试功能来评估提出的DOE的性能,其应用于空气污染物的空间分布的复杂非线性问题。包括比较研究,以分析所提出的技术的性能,以防止现有方法,例如N级全部分数设计方法和拉丁超立体设计方法。一个设计目标和n个输入设计变量的方法,一组输入输出训练数据集是x {x_1〜(1),x_1〜(2),...,x_1〜(i); ...... x_j〜(1),x_j〜(2),... x_j〜(i)| i = 1,...,m,j = 1,... n}和y = {y〜(1),y〜(2), ...,y〜(i)i = 1,2,...,m},其中m是数据点的最大数量。通过使用欧几里德距离测量(即D_I(P〜I,C)),每个数据点都有其自身独特的重量从点PI和公共参考点C之间获得的距离因子。权重表示每个数据点之间的不同模式。邻居可以聚集为数据点作为候选的组。为了概括解决方案,将输入和输出数据点对组合成成为设计空间,以S = {x; y}。如果我们通过首先将设计空间设置为坐标原点,可以进一步简化解决方案,通过首先将设计空间归一化至[s] = [-1,1]〜(n + 1)。然后,通过使用可用的聚类算法对距离权重值D {d_1,d_2,... d_ | i = 1,2,...,m}进行排序和群集。在这项工作中,由于其快速计算,因此使用了基于Voronoi迭代的K-Means算法,特别是在1维外壳中。这里,初始点随机复制,以预期导致全局最小解决方案。最大k值对应于将采样的数字数据点。结果与讨论最初验证该方案的准确性,使用称为“Hock-Schittkowski问题100”的已知测试函数,其中该非线性问题涉及7个变量,1个目标和4个约束。随机生成的准备数据集在不同的样本大小N以不同的样本大小进行采样,然后使用RBFNN元模型映射。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号