【预测模型】基于哈里斯鹰改进核极限学习机(KELM)分类算法matlab源码

​

一、核极限学习机

本文将介绍一种新的SLFN的算法&＃xff0c;极限学习机&＃xff0c;该算法将随机产生输入层和隐含层间的连接权值和隐含层神经元的阈值&＃xff0c;且在训练过程中无需调整&＃xff0c;只需要设置隐含层的神经元的个数&＃xff0c;便可以获得唯一最优解&＃xff0c;与传统的训练方法相比&＃xff0c;该方法具有学习速率快、泛化性能好等优点。

​

​

典型的单隐层前馈神经网络如上图所示&＃xff0c;输入层与隐含层&＃xff0c;隐含层与输出层之间是全连接的。输入层的神经元的个数是根据样本的而特征数的多少来确定的&＃xff0c;输出层的神经元的个数是根据样本的种类数来确定的

​

​

设隐含层神经元的阈值 b为&＃xff1a;

​

​

​

​

​

​

​

当隐层神经元的个数和样本数相同时&＃xff08;10&＃xff09;式有唯一的解&＃xff0c;也就是说零误差的逼近训练样本。通常的学习算法中&＃xff0c;W和b需要不断进行调整&＃xff0c;但研究结果告诉我们&＃xff0c;他们事实上是不需要进行不断调整的&＃xff0c;甚至可以随意指定。调整他们不仅费时&＃xff0c;而且并没有太多的好处。&＃xff08;此处有疑虑&＃xff0c;可能是断章取义&＃xff0c;这个结论有可能是基于某个前提下的&＃xff09;。

​

二、哈里斯鹰算法

​

​

三、代码介绍

function [TrainingTime, TestingTime, TrainingAccuracy, TestingAccuracy] &＃61; elm_kernel(TrainingData, TestingData, Elm_Type, Regularization_coefficient, Kernel_type, Kernel_para)% Usage: elm(TrainingData_File, TestingData_File, Elm_Type, NumberofHiddenNeurons, ActivationFunction)
% OR: [TrainingTime, TestingTime, TrainingAccuracy, TestingAccuracy] &＃61; elm(TrainingData_File, TestingData_File, Elm_Type, NumberofHiddenNeurons, ActivationFunction)
%
% Input:
% TrainingData_File - Filename of training data settic;
Omega_test &＃61; kernel_matrix(P&＃39;,Kernel_type, Kernel_para,TV.P&＃39;);
TY&＃61;(Omega_test&＃39; * OutputWeight)&＃39;; % TY: the actual output of the testing data
TestingTime&＃61;toc%%%%%%%%%% Calculate training & testing classification accuracyif Elm_Type &＃61;&＃61; REGRESSION
%%%%%%%%%% Calculate training & testing accuracy (RMSE) for regression caseTrainingAccuracy&＃61;sqrt(mse(T - Y))TestingAccuracy&＃61;sqrt(mse(TV.T - TY))
endif Elm_Type &＃61;&＃61; CLASSIFIER
%%%%%%%%%% Calculate training & testing classification accuracyMissClassificationRate_Training&＃61;0;MissClassificationRate_Testing&＃61;0;for i &＃61; 1 : size(T, 2)[x, label_index_expected]&＃61;max(T(:,i));[x, label_index_actual]&＃61;max(Y(:,i));if label_index_actual~&＃61;label_index_expectedMissClassificationRate_Training&＃61;MissClassificationRate_Training&＃43;1;endendTrainingAccuracy&＃61;1-MissClassificationRate_Training/size(T,2) for i &＃61; 1 : size(TV.T, 2)[x, label_index_expected]&＃61;max(TV.T(:,i));[x, label_index_actual]&＃61;max(TY(:,i));if label_index_actual~&＃61;label_index_expectedMissClassificationRate_Testing&＃61;MissClassificationRate_Testing&＃43;1;endendTestingAccuracy&＃61;(1-MissClassificationRate_Testing/size(TV.T,2))*100
end%%%%%%%%%%%%%%%%%% Kernel Matrix %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%function omega &＃61; kernel_matrix(Xtrain,kernel_type, kernel_pars,Xt)nb_data &＃61; size(Xtrain,1);if strcmp(kernel_type,&＃39;RBF_kernel&＃39;),if nargin<4,XXh &＃61; sum(Xtrain.^2,2)*ones(1,nb_data);omega &＃61; XXh&＃43;XXh&＃39;-2*(Xtrain*Xtrain&＃39;);omega &＃61; exp(-omega./kernel_pars(1));elseXXh1 &＃61; sum(Xtrain.^2,2)*ones(1,size(Xt,1));XXh2 &＃61; sum(Xt.^2,2)*ones(1,nb_data);omega &＃61; XXh1&＃43;XXh2&＃39; - 2*Xtrain*Xt&＃39;;omega &＃61; exp(-omega./kernel_pars(1));endelseif strcmp(kernel_type,&＃39;lin_kernel&＃39;)if nargin<4,omega &＃61; Xtrain*Xtrain&＃39;;elseomega &＃61; Xtrain*Xt&＃39;;endelseif strcmp(kernel_type,&＃39;poly_kernel&＃39;)if nargin<4,omega &＃61; (Xtrain*Xtrain&＃39;&＃43;kernel_pars(1)).^kernel_pars(2);elseomega &＃61; (Xtrain*Xt&＃39;&＃43;kernel_pars(1)).^kernel_pars(2);endelseif strcmp(kernel_type,&＃39;wav_kernel&＃39;)if nargin<4,XXh &＃61; sum(Xtrain.^2,2)*ones(1,nb_data);omega &＃61; XXh&＃43;XXh&＃39;-2*(Xtrain*Xtrain&＃39;);XXh1 &＃61; sum(Xtrain,2)*ones(1,nb_data);omega1 &＃61; XXh1-XXh1&＃39;;omega &＃61; cos(kernel_pars(3)*omega1./kernel_pars(2)).*exp(-omega./kernel_pars(1));elseXXh1 &＃61; sum(Xtrain.^2,2)*ones(1,size(Xt,1));XXh2 &＃61; sum(Xt.^2,2)*ones(1,nb_data);omega &＃61; XXh1&＃43;XXh2&＃39; - 2*(Xtrain*Xt&＃39;);XXh11 &＃61; sum(Xtrain,2)*ones(1,size(Xt,1));XXh22 &＃61; sum(Xt,2)*ones(1,nb_data);omega1 &＃61; XXh11-XXh22&＃39;;omega &＃61; cos(kernel_pars(3)*omega1./kernel_pars(2)).*exp(-omega./kernel_pars(1));end
end

​

测试集结果如下图所示&＃xff1a;