WO2011109922A1 - Méthode de sélection d'un sous-intervalle caractéristique du spectre du proche infrarouge basée sur un algorithme génétique d'annelage simulé - Google Patents

Méthode de sélection d'un sous-intervalle caractéristique du spectre du proche infrarouge basée sur un algorithme génétique d'annelage simulé Download PDF

Info

Publication number
WO2011109922A1
WO2011109922A1 PCT/CN2010/000530 CN2010000530W WO2011109922A1 WO 2011109922 A1 WO2011109922 A1 WO 2011109922A1 CN 2010000530 W CN2010000530 W CN 2010000530W WO 2011109922 A1 WO2011109922 A1 WO 2011109922A1
Authority
WO
WIPO (PCT)
Prior art keywords
sub
simulated annealing
interval
genetic algorithm
gene
Prior art date
Application number
PCT/CN2010/000530
Other languages
English (en)
Chinese (zh)
Inventor
邹小波
石吉勇
赵杰文
殷晓平
陈正伟
黄星奕
蔡健荣
陈全胜
Original Assignee
江苏大学
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 江苏大学 filed Critical 江苏大学
Publication of WO2011109922A1 publication Critical patent/WO2011109922A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/12—Computing arrangements based on biological models using genetic models
    • G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01N—INVESTIGATING OR ANALYSING MATERIALS BY DETERMINING THEIR CHEMICAL OR PHYSICAL PROPERTIES
    • G01N21/00—Investigating or analysing materials by the use of optical means, i.e. using sub-millimetre waves, infrared, visible or ultraviolet light
    • G01N21/17—Systems in which incident light is modified in accordance with the properties of the material investigated
    • G01N21/25—Colour; Spectral properties, i.e. comparison of effect of material on the light at two or more different wavelengths or wavelength bands
    • G01N21/31—Investigating relative effect of material at wavelengths characteristic of specific elements or molecules, e.g. atomic absorption spectrometry
    • G01N21/35—Investigating relative effect of material at wavelengths characteristic of specific elements or molecules, e.g. atomic absorption spectrometry using infrared light
    • G01N21/359—Investigating relative effect of material at wavelengths characteristic of specific elements or molecules, e.g. atomic absorption spectrometry using infrared light using near infrared light

Definitions

  • the invention relates to a method for selecting a sub-interval of sub-infrared spectroscopy for analyzing the quality of agricultural products and foods, and particularly relates to a method for selecting sub-intervals of near-infrared spectroscopy based on simulated annealing-genetic algorithm.
  • Near-infrared spectroscopy is widely used in agricultural products and food quality analysis due to its fast analysis speed and high efficiency.
  • certain deficiencies in near-infrared spectroscopy such as complex background, low information intensity, overlapping peaks, etc.
  • Conventional spectral analysis methods are analyzed. Therefore, how to effectively extract feature information from a large number of near-infrared spectral data has become the focus of research in this field.
  • the characteristic absorption of the sample in one or several bands of the near-infrared spectrum determines that the wavenumber points adjacent to the high-information wavenumber point have a relatively large amount of information, that is, the near-infrared spectrum data has a certain continuous correlation. According to the characteristics of the near-infrared spectroscopy data, the calculation of the wavelength selection algorithm is reduced, and the efficiency of the algorithm is improved. Generally, the near-infrared full spectrum is divided into several sub-intervals, and wavelength selection is performed in intervals.
  • the classical spectral interval selection algorithm has interval partial least squares method.
  • the algorithm divides the whole spectrum into sub-interval sub-intervals, and calculates the RMSECV (Root Mean Square of Cross Validation) for each sub-interval.
  • An interval with the smallest square root error is used as the modeling interval.
  • the derivative algorithms of the interval partial least squares algorithm are joint interval partial least squares method, forward/backward interval partial least squares algorithm, moving window partial least squares method, etc., compared with classical interval partial least squares algorithm, derivative algorithm Not only the single interval but also the combination of several intervals. Although these algorithms can extract the characteristic information of the spectrum, the process of dividing the subintervals has certain subjectivity.
  • Genetic algorithm is a new subject emerging in the 1970s. It is based on the simulation of the natural selection and natural genetic mechanism of the biological world to solve practical problems. It is a highly parallel, random and adaptive search algorithm. In recent years, some scholars have combined genetic algorithm with classical interval partial least squares algorithm to select the characteristic subinterval of near-infrared spectroscopy, simulate natural evolution processes such as natural genetic variation, and solve the optimal combination of feature subintervals, but still exist. Some shortcomings, such as sub-intervals, often rely on experience and have certain subjectivity; genetic algorithms are prone to premature convergence and fall into local optimal solutions, and cannot guarantee global optimal approximation solutions.
  • the simulated annealing algorithm is a stochastic optimization algorithm based on the Mote Carlo iterative solution strategy. The starting point is based on the similarity between the physical annealing process and the combined optimization.
  • the simulated annealing algorithm starts from a higher initial temperature and uses the Metropolis sampling strategy with probability jump to perform a random search in the candidate solution combination. After the repeated sampling process, the global optimal solution of the problem is finally obtained, which is suitable for solving the large-scale combinatorial optimization problem.
  • the present invention proposes a sub-interval selection method based on simulated annealing-genetic algorithm for near-infrared spectroscopy, which will simulate The core Metropolis acceptance criterion in the annealing algorithm introduces the genetic algorithm, and prevents the premature fall into the local optimal solution on the basis of ensuring the efficiency of the genetic algorithm, so as to obtain the optimal combination of the sub-intervals of the near-infrared spectrum.
  • the technical scheme adopted by the invention is: pre-processing the near-infrared spectrum, dynamically dividing the sub-intervals of the pre-processed near-infrared spectrum, and introducing the Metropolis criterion in the simulated annealing algorithm into the gene exchange and gene selection calculation in the genetic algorithm. Son, using the simulated annealing-genetic algorithm to select the optimal feature subinterval, and finally judging the best subinterval partitioning method and the optimal feature subinterval combination, and establishing the PLS model for the selected optimal feature subinterval.
  • the sub-interval selection method of near-infrared spectroscopy based on simulated annealing-genetic algorithm lays a solid foundation for quickly obtaining spectral models with high precision and strong predictive ability.
  • Figure 1 is a flow chart of the present invention
  • Figure 2 is a schematic diagram of Metropolis acceptance criteria
  • Figure 3 is a schematic diagram of an exchange operator introducing the Metropolis criterion
  • Figure 4 is a schematic diagram of a mutation operator introducing the Metropolis criterion
  • Figure 5 is a graph showing the results of sub-interval selection of simulated annealing-genetic algorithm
  • Figure 6 is a comparison result of the simulated annealing-genetic algorithm and the traditional genetic algorithm modeling effect
  • Figure 7 is a near-infrared spectrum of the flavonoids of cucumber leaves pretreated by standard orthogonal transformation.
  • the invention firstly pretreats the near-infrared spectrum, and processes the agricultural product and the food raw near red with an appropriate de-noising method.
  • the denoising method includes standard orthogonal variation, multivariate scatter correction, centralization, first-order/second-order derivative preprocessing methods, etc.
  • the spectral pre-processing process also includes the division of the correction set and the prediction set sample.
  • the pre-processed near-infrared spectrum is dynamically divided into sub-intervals. When sub-intervals are divided, the number of sub-intervals changes dynamically within a range [m, n]. The subsequent processing of the algorithm will select the number of optimal feature subintervals in the range of [m, n].
  • the full spectrum is equally divided into subintervals, if the total number of points is divided by i is equal to p, and there is a remainder q, then the number of wave points in each subinterval of the first q subintervals is p+l, and the number of wavenumber points in each subinterval in the remaining subintervals is p.
  • the Metropol is criterion in the simulated annealing algorithm refers to a judgment rule used in the simulated annealing algorithm to judge the importance of the new solution and the old solution.
  • the Metropol is criterion judges which solution in the old solution and the new solution is an important solution according to the objective function value corresponding to the old solution and the new solution. If the new solution is considered to be an important solution, replace the old solution with the new solution into the next iteration; Then keep the old solution unchanged.
  • the invention introduces the Metropol is criterion in the above simulated annealing algorithm into the gene exchange and gene selection operator in the genetic algorithm, which is called "simulated annealing-genetic algorithm", that is, in the traditional gene exchange operator and the gene mutation operator, the parent
  • the chromosome generates the progeny chromosome through gene exchange or gene mutation, and introduces the Metropolis criterion to judge the parent chromosome (corresponding to the old solution X) and the progeny chromosome (corresponding to the importance of the new solution, if the progeny chromosome is more important than the parent chromosome, then accept the progeny chromosome, Otherwise the child chromosome is rejected.
  • Simulated annealing-genetic algorithm was used to select the spectral optimal feature subinterval, combined with the gene exchange, gene mutation operator and other operators of traditional genetic algorithm introduced by Metropolis criterion, and the optimal feature subinterval was selected for the near-infrared spectrum after subinterval. Intelligently judge the optimal sub-interval division method and the optimal feature sub-interval combination, establish the PLS model of the correction set and the prediction set for the selected optimal feature subinterval, and calculate the correction set rms error and the prediction set rms error. , modeling parameters such as correction set correlation coefficient and prediction set correlation coefficient.
  • the present invention divides the subinterval and selects the optimal feature subinterval, and needs to set the following parameters:
  • the maximum number of sub-intervals I f refers to dividing the full spectrum into If sub-intervals at most.
  • the objective function ⁇ ⁇ ⁇ The role of the objective function is to judge the quality of the current solution X. In general, f (the higher the value of 3 ⁇ 4, the better the quality of the current solution X. The goal of the simulated annealing-genetic algorithm of the present invention is the preferred feature.
  • Population size refers to the number of chromosomes in the population and the number of genes in each chromosome.
  • the number of genes is generally determined according to the parameters of the actual problem. For the feature sub-interval selection problem, the number of chromosomes is generally selected from 30 to 100, and the number of genes is equal to the number of sub-intervals.
  • Gene exchange probability p. In the process of gene exchange, the proportion of chromosome individuals involved in gene exchange accounts for the total number of chromosomes, and the probability of gene exchange is generally set to 0.65 ⁇ 0.9.
  • Probability of gene mutation p D In the process of gene mutation, the chromosome individual involved in the gene mutation accounts for the ratio of the chromosome always, and the probability of gene mutation is generally set to 0.001 to 0.1.
  • Initialization temperature t. Corresponding to the initial temperature during solid annealing, the initial temperature is usually set to 200 to 1000 degrees.
  • Temperature decay function g(d) used to control the temperature cooling rate during solid annealing.
  • + 1 t k g(a )- ⁇
  • ⁇ is usually in the range of 0.5 ⁇ 0.99.
  • End temperature t f When the annealing temperature reaches the end temperature, the solid will reach a certain stable state, and the solid annealing process is finished. Generally, the annealing temperature t f is about 0 degree.
  • the number of subintervals is i
  • the near-infrared spectrum is divided into i sub-intervals, and binary gene coding is performed, and the number of genes is the number of sub-intervals i.
  • Chromosome initialization randomly generating an initial population of a given size.
  • the temperature decay function g ( a ) slowly decreases, whenever the temperature t decreases, the fitness of each individual in the population is calculated, the parent chromosome is selected by the chromosome selection operator, and the gene exchange is performed according to the improved gene exchange operator.
  • the same solution is used to calculate the optimal solution corresponding to the total number of new subintervals, and the above process is repeated until the total number of subintervals i is greater than the end window width If.
  • the optimal solutions corresponding to the total number of sub-intervals i' e [I0, If] have been obtained. From these optimization solutions, the solution with the largest value of the objective function is selected as Xi , X, which is the global optimal feature of the near-infrared spectrum. Sub-interval set, subscript i is the total number of sub-intervals corresponding to the optimal solution. Finally, the correction set and the prediction set model are established according to the selected global optimal solution.
  • FIG. 2 shows the process by which the Metropolis Code judges the importance of the new solution.
  • the new solution transition probability pt is compared with the random probability density function re [0, 1]. If pt>r holds, the new solution is accepted, otherwise the old solution remains unchanged.
  • the specific judgment process is as follows: (1) The Metropol is criterion first calculates the objective function value f (x) f (y) corresponding to the old solution X new solution y; (2) Produces the random probability density function value ⁇ "; (3) Calculates the new (4) Compare the new solution transition probability Pi with the value of the random probability function value r. If it is greater than or equal to r, replace the old solution with a new solution. Otherwise, the old solution remains unchanged.
  • the Metropol is criterion can not only accept the optimization solution, but also accept the deterioration solution with a certain probability, which provides a guarantee for avoiding the algorithm falling into the local optimal solution.
  • Figure 3 shows the improved gene exchange operator and gene mutation operator flow chart, because the improved gene exchange operator is similar to the improved gene mutation operator, taking the improved gene exchange operator as an example. Details the workflow of this operator. Based on the traditional genetic operation, the Metropolis acceptance criterion in simulated annealing algorithm is introduced. The probability of positive mutation is increased on the basis of the original, the probability of negative mutation is reduced, and the algorithm can jump out of the local optimal solution to the global optimal solution. . The exchange operator randomly selects the parents of the parents from the parent group (denoted as Pi), and generates new generations of children by gene exchange (reported as Ci to calculate their fitness values and f(Ci) respectively, and judge whether to accept the new generation according to the Metropolis criterion. The individual judgment process is shown in Figure 3.
  • Figure 7 shows the near-infrared spectrum of 100 pieces of cucumber leaves pretreated by standard orthogonal change, spectral range lOOOC ⁇ OOcm— 1 , the number of scans is 32; the wave number interval is 7. 712cm—'; the resolution is 16cm- 1 .
  • the spectrum of 70 leaves was used as a correction set, and the near infrared spectrum of the remaining 30 leaves was used as a prediction set.
  • the minimum and maximum number of subintervals are 30, 60, the number of populations is 60, the probability of gene exchange is 0.9, the probability of gene mutation is 0.01, the initial temperature is 200, the end temperature is 0.1, and the temperature attenuation coefficient is 0.95.
  • the simulated annealing-genetic algorithm is used to select the feature subinterval. The specific process is as follows:
  • the number of chromosomes in the population is 60, and the number of genes per chromosome is 30, and the population is initialized;
  • step (6) Decrease the temperature according to the temperature decay function. If the temperature is not equal to the end temperature, repeat steps (3) to (4). If it is equal to the end temperature, perform step (6).
  • the number of subintervals is increased by 1. If the number of subintervals is not equal to the maximum number of subintervals of 60, repeat (1:) ⁇ (5). If the number of subintervals is equal to the maximum number of subintervals of 60, execute step (7). .
  • Figure 5 shows the results of sub-interval selection of near-infrared spectroscopy of cucumber leaf lutein using simulated annealing-genetic algorithm.
  • Figure 6 is a comparison of simulated annealing-genetic algorithm and traditional genetic algorithm modeling of cucumber leaf lutein model.
  • the abscissa is the number of modeling times
  • the ordinate is the calibration set correlation coefficient of the spectral model
  • the curve with the ⁇ mark The calibration set correlation coefficient obtained by modeling the near-infrared spectrum of cucumber leaf lutein by simulated annealing-genetic algorithm
  • the curve with mouth mark is the correction set correlation of the near-infrared model of cucumber leaf lutein obtained by traditional genetic algorithm. coefficient. It can be seen from Figure 6 that the spectral model obtained by simulated annealing-genetic algorithm is superior to the spectral model established by traditional genetic algorithm.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biophysics (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Evolutionary Biology (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Linguistics (AREA)
  • General Engineering & Computer Science (AREA)
  • Biomedical Technology (AREA)
  • Genetics & Genomics (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • Artificial Intelligence (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Physiology (AREA)
  • Investigating Or Analysing Materials By Optical Means (AREA)
  • Aiming, Guidance, Guns With A Light Source, Armor, Camouflage, And Targets (AREA)
  • Radiation Pyrometers (AREA)
  • Spectrometry And Color Measurement (AREA)

Abstract

Cette invention concerne une méthode de sélection d'un sous-intervalle caractéristique du spectre du proche infrarouge basée sur un algorithme génétique d'annelage simulé, ladite méthode comprenant d'abord le prétraitement d'un spectre du proche infrarouge, puis la division dynamique du spectre du proche infrarouge prétraité en sous-intervalles, l'introduction de la règle de Métropolis de l'algorithme d'annelage simulé dans l'opérateur d'échange de gènes et l'opérateur de sélection de gène de l'algorithme génétique, la sélection d'un sous-intervalle caractéristique optimal à l'aide de l'algorithme génétique d'annelage simulé, et pour finir, l'estimation d'une combinaison procédure de division en sous-intervalles optimale et sous-intervalle caractéristique optimal, pour établir un modèle partiel par les moindres carrés (PLS) pour le sous-intervalle caractéristique optimal sélectionné.
PCT/CN2010/000530 2010-03-12 2010-04-19 Méthode de sélection d'un sous-intervalle caractéristique du spectre du proche infrarouge basée sur un algorithme génétique d'annelage simulé WO2011109922A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010123931.2 2010-03-12
CN2010101239312A CN101832909B (zh) 2010-03-12 2010-03-12 基于模拟退火-遗传算法近红外光谱特征子区间选择方法

Publications (1)

Publication Number Publication Date
WO2011109922A1 true WO2011109922A1 (fr) 2011-09-15

Family

ID=42717054

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/000530 WO2011109922A1 (fr) 2010-03-12 2010-04-19 Méthode de sélection d'un sous-intervalle caractéristique du spectre du proche infrarouge basée sur un algorithme génétique d'annelage simulé

Country Status (2)

Country Link
CN (1) CN101832909B (fr)
WO (1) WO2011109922A1 (fr)

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102183467B (zh) * 2011-01-24 2012-07-25 中国科学院长春光学精密机械与物理研究所 一种近红外谱区新疆红枣品质分级建模方法
CN102928382B (zh) * 2012-11-12 2015-04-22 江苏大学 基于改进型模拟退火算法的近红外光谱特征波长选择方法
CN105046003B (zh) * 2015-07-23 2018-06-29 王家俊 模拟退火-遗传算法的光谱特征区间选择及光谱加密方法
CN105160184B (zh) * 2015-09-08 2017-11-28 合肥工业大学 一种多组元熔体互扩散系数的分析方法
CN105224961B (zh) * 2015-11-04 2018-05-11 中国电子科技集团公司第四十一研究所 一种高识别度的红外光谱特征提取与匹配方法
CN106021859B (zh) * 2016-05-09 2018-10-16 吉林大学 改进遗传算法的可控源音频大地电磁法一维反演方法
CN106198446A (zh) * 2016-06-22 2016-12-07 中国热带农业科学院热带作物品种资源研究所 近红外光谱快速测定艾纳香叶粉中左旋龙脑含量的方法
CN106198433B (zh) * 2016-06-27 2019-04-12 中国科学院合肥物质科学研究院 基于lm-ga算法的红外光谱定性分析方法
CN108882256B (zh) * 2018-08-21 2020-11-10 广东电网有限责任公司 一种无线传感器网络节点覆盖优化方法和装置
CN109145873B (zh) * 2018-09-27 2022-03-22 广东工业大学 基于遗传算法的光谱高斯峰特征提取算法
CN109507143B (zh) * 2018-10-29 2019-12-31 黑龙江八一农垦大学 沼液理化指标近红外光谱同步快速检测方法
CN109540836A (zh) * 2018-11-30 2019-03-29 济南大学 基于bp人工神经网络的近红外光谱糖度检测方法及系统
CN111125629B (zh) * 2019-12-25 2023-04-07 温州大学 一种域自适应的pls回归模型建模方法
CN112881333B (zh) * 2021-01-13 2022-03-04 江南大学 一种基于改进免疫遗传算法的近红外光谱波长筛选方法
CN117494630B (zh) * 2023-12-29 2024-04-26 珠海格力电器股份有限公司 一种寄存器时序优化方法、装置、电子设备和存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040033617A1 (en) * 2002-08-13 2004-02-19 Sonbul Yaser R. Topological near infrared analysis modeling of petroleum refinery products
CN1657907A (zh) * 2005-03-23 2005-08-24 江苏大学 基于间隔偏最小二乘法的农产品、食品近红外光谱谱区选择方法
JP2005291704A (ja) * 2003-11-10 2005-10-20 New Industry Research Organization 可視光・近赤外分光分析方法
CN101078685A (zh) * 2007-05-17 2007-11-28 常熟雷允上制药有限公司 近红外光谱快速在线检测中药苦黄注射剂有效成分的方法

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101520412A (zh) * 2009-03-23 2009-09-02 中国计量学院 基于独立分量分析和遗传神经网络的近红外光谱分析方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040033617A1 (en) * 2002-08-13 2004-02-19 Sonbul Yaser R. Topological near infrared analysis modeling of petroleum refinery products
JP2005291704A (ja) * 2003-11-10 2005-10-20 New Industry Research Organization 可視光・近赤外分光分析方法
CN1657907A (zh) * 2005-03-23 2005-08-24 江苏大学 基于间隔偏最小二乘法的农产品、食品近红外光谱谱区选择方法
CN101078685A (zh) * 2007-05-17 2007-11-28 常熟雷允上制药有限公司 近红外光谱快速在线检测中药苦黄注射剂有效成分的方法

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
CHU XIAOLI ET AL.: "Variable selection for partial least squares modeling by genetic algorithm", CHINESE JOURNAL OF ANALYTICAL CHEMISTRY, vol. 29, no. 4, April 2001 (2001-04-01), pages 437 - 442 *
GU XIAOYU ET AL.: "Application of wavelength selection algorithm to measure the effective component of Chinese medicine based on near-infrared spectroscopy", SPECTROSCOPY AND SPECTRAL ANALYSIS, vol. 26, no. 9, September 2006 (2006-09-01), pages 1618 - 1620 *
ZHU SHIPING ET AL.: "Region selection method of near infrared spectrum based on genetic algorithm", TRANSACTIONS OF THE CHINESE SOCIETY FOR AGRICULTRAL MACHINERY, vol. 35, no. 5, September 2004 (2004-09-01), pages 152 - 156 *

Also Published As

Publication number Publication date
CN101832909B (zh) 2012-01-18
CN101832909A (zh) 2010-09-15

Similar Documents

Publication Publication Date Title
WO2011109922A1 (fr) Méthode de sélection d'un sous-intervalle caractéristique du spectre du proche infrarouge basée sur un algorithme génétique d'annelage simulé
CN110363344B (zh) 基于miv-gp算法优化bp神经网络的概率积分参数预测方法
CN111007040B (zh) 大米食味品质近红外光谱快速评价方法
CN110046378B (zh) 一种基于进化多目标优化的选择性分层集成高斯过程回归软测量建模方法
CN111191835B (zh) 基于c-gan迁移学习的ies不完备数据负荷预测方法及系统
CN102626557B (zh) 基于ga-bp算法的分子蒸馏工艺参数优化方法
CN104573820A (zh) 一种用于带约束条件的工程优化问题的遗传算法
CN113049507A (zh) 多模型融合的光谱波长选择方法
CN107894710B (zh) 一种裂解反应炉温度的主成分分析建模方法
CN107729988B (zh) 基于动态深度置信网络的蓝藻水华预测方法
CN114004153A (zh) 一种基于多源数据融合的侵彻深度预测方法
CN106296434A (zh) 一种基于pso‑lssvm算法的粮食产量预测方法
CN108107724A (zh) 基于遗传算法的模型预测控制参数在线优化方法
CN111126560A (zh) 一种基于云遗传算法优化bp神经网络的方法
CN114841468A (zh) 一种汽油质量指标预测及致因解析方法
CN107577918A (zh) 基于遗传算法和隐马尔可夫模型的CpG岛识别方法、装置
CN101806728B (zh) 基于模拟退火算法的近红外光谱特征波长的选择方法
CN110119842A (zh) 一种微电网短期负荷预测方法
CN107688702B (zh) 一种基于狼群算法的河道洪水流量演进规律模拟方法
CN105136688A (zh) 一种用于分析分子光谱的改进可变移动窗偏最小二乘法
CN111709519B (zh) 一种深度学习并行计算架构方法及其超参数自动配置优化
Ji et al. An improved simulated annealing genetic algorithm of EEG feature selection in sleep stage
CN106295667B (zh) 一种基于遗传算法选择最优光谱谱段的方法及其应用
CN114117917B (zh) 一种多目标优化的舰船磁偶极子阵列建模方法
CN115114838A (zh) 基于粒子群算法思想和模拟退火策略的光谱特征波长选择方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10847181

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 10847181

Country of ref document: EP

Kind code of ref document: A1