【BP预测】基于Tent混沌映射原子搜索算法优化BP神经网络实现数据回归预测附matlab代码

最新推荐文章于 2023-11-07 00:19:48 发布

matlab科研助手

最新推荐文章于 2023-11-07 00:19:48 发布

阅读量428

点赞数

CC 4.0 BY-SA版权

分类专栏：机器学习组合优化系列matlab完整代码文章标签： matlab 神经网络回归

本文链接：https://blog.youkuaiyun.com/matlab_dingdang/article/details/124948124

机器学习组合优化系列matlab完整代码专栏收录该内容

448 篇文章

订阅专栏

1 简介

BP神经网络算法使用非常广泛,传统的BP神经网络算法虽然具有不错的拟合非线性函数的能力,但是容易陷入局部的极小值,并且传统的算法收敛的速度慢.本篇文章详细地论述了如何使用ent混沌映射原子搜索算法算法优化传统的BP神经网络算法中初始的权值和阀值,通过相应的验证和比较提出了该模型的有效性.

作为物理-元启发式算法中的一种，ASO 最早在 2018 年由赵卫国提出并将其应用于地下水分散系数估计。ASO 的灵感来自于基本的分子动力学,自然界中所有的物质都是由原子组成,原子具备质量和体积,在一个原子系统中,所有原子都是相互作用并且处于恒定的运动状态，其微观相互作用十分复杂。随着科学技术的发展，近些年来分子动力学发展迅速，已经可以使用计算机模拟原子和分子的物理运动规律。

正在上传…重新上传取消

2 部分代码

%--------------------------------------------------------------------------% GSA code v1.0.% Developed in MATLAB R2011b% The code is based on the following papers.% W. Zhao, L. Wang and Z. Zhang, Atom search optimization and its % application to solve a hydrogeologic parameter estimation problem, % Knowledge-Based Systems (2018), https://doi.org/10.1016/j.knosys.2018.08.030.%% W. Zhao, L. Wang and Z. Zhang, A novel atom search optimization for % dispersion coefficient estimation in groundwater, Future Generation % Computer Systems (2018), https://doi.org/10.1016/j.future.2018.05.037.%--------------------------------------------------------------------------% Atom Search Optimization.function [X_Best,Fit_XBest,Functon_Best]=ASO(alpha,beta,Fun_Index,Atom_Num,Max_Iteration)% Dim: Dimension of search space.% Atom_Pop: Population (position) of atoms.% Atom_V:  Velocity of atoms.% Acc: Acceleration of atoms.% M: Mass of atoms. % Atom_Num: Number of atom population.% Fitness: Fitness of atoms.% Max_Iteration: Maximum of iterations.% X_Best: Best solution (position) found so far. % Fit_XBest: Best result corresponding to X_Best. % Functon_Best: The fitness over iterations. % Low: The low bound of search space.% Up: The up bound of search space.% alpha: Depth weight.% beta: Multiplier weightalpha=50;beta=0.2;   Iteration=1;   [Low,Up,Dim]=Test_Functions_Range(Fun_Index);     % Randomly initialize positions and velocities of atoms.     if size(Up,2)==1         Atom_Pop=rand(Atom_Num,Dim).*(Up-Low)+Low;         Atom_V=rand(Atom_Num,Dim).*(Up-Low)+Low;     end        if size(Up,2)>1        for i=1:Dim           Atom_Pop(:,i)=rand(Atom_Num,1).*(Up(i)-Low(i))+Low(i);           Atom_V(:,i)=rand(Atom_Num,1).*(Up(i)-Low(i))+Low(i);        end     end % Compute function fitness of atoms.     for i=1:Atom_Num       Fitness(i)=Test_Functions(Atom_Pop(i,:),Fun_Index,Dim);     end       Functon_Best=zeros(Max_Iteration,1);       [Max_Fitness,Index]=min(Fitness);       Functon_Best(1)=Fitness(Index);       X_Best=Atom_Pop(Index,:);      % Calculate acceleration. Atom_Acc=Acceleration(Atom_Pop,Fitness,Iteration,Max_Iteration,Dim,Atom_Num,X_Best,alpha,beta); % Iteration for Iteration=2:Max_Iteration            Functon_Best(Iteration)=Functon_Best(Iteration-1);           Atom_V=rand(Atom_Num,Dim).*Atom_V+Atom_Acc;           Atom_Pop=Atom_Pop+Atom_V;                      for i=1:Atom_Num       % Relocate atom out of range.             TU= Atom_Pop(i,:)>Up;           TL= Atom_Pop(i,:)<Low;           Atom_Pop(i,:)=(Atom_Pop(i,:).*(~(TU+TL)))+((rand(1,Dim).*(Up-Low)+Low).*(TU+TL));           %evaluate atom.            Fitness(i)=Test_Functions(Atom_Pop(i,:),Fun_Index,Dim);         end        [Max_Fitness,Index]=min(Fitness);                   if Max_Fitness<Functon_Best(Iteration)             Functon_Best(Iteration)=Max_Fitness;             X_Best=Atom_Pop(Index,:);          else            r=fix(rand*Atom_Num)+1;             Atom_Pop(r,:)=X_Best;        end           % Calculate acceleration.       Atom_Acc=Acceleration(Atom_Pop,Fitness,Iteration,Max_Iteration,Dim,Atom_Num,X_Best,alpha,beta); endFit_XBest=Functon_Best(Iteration);