-
极限学习机
ELMmetlab算法实现。特性:1.需要的数学模型简单,学习速度快;2.能获得全局最优解;3.具有良好的泛化性能。泛化性能是指机器学习算法对新样本的适应性。Extreme Learning Machine极限学习机器神经网络研究中的一种算法,是一种泛化的单隐层前馈神经网络(Single-hidden layer feedforward network)。
- 2023-04-30 17:15:03下载
- 积分:1
-
vc编的线性规划源码,单纯形方法求解线性规划问题
vc编的线性规划源码,单纯形方法求解线性规划问题-vc-compile-source linear programming, simplex method for solving linear programming problems
- 2022-06-30 20:40:35下载
- 积分:1
-
用于连续优化的 moead 源代码
嗨,这是MOEAD代码Contious优化问题,它是用于多目标,不断优化和此工作分解的原则,它用来找出2个以上目标,不断优化和此代码是没有约束的实现。
- 2022-03-23 16:02:47下载
- 积分:1
-
monte carlo方法在各个方面中的小应用
monte carlo方法在各个方面中的小应用-monte carlo method in all aspects of small applications
- 2022-02-10 11:48:07下载
- 积分:1
-
Apriori 算法的 c + + 实现
Apriori 算法 c + + 实现。
它可以处理数据的量大。
该程序可以用于数据挖掘。
- 2022-04-01 12:01:40下载
- 积分:1
-
贝叶思网络分类规则例程
贝叶思网络分类规则例程-Bayesian Network Classification Rule tutorial
- 2022-04-10 19:55:02下载
- 积分:1
-
自动谱分析:可用于丢失/采样/子束光谱分析;矢量自动迭代,可用于建模,故障诊断;...
自动谱分析:可用于丢失/采样/子束光谱分析;矢量自动迭代,可用于建模,故障诊断;-The applications of this additional toolbox are:
- Automatic spectral analysis for Irregular sampling/Missing data, analysis of spectral subbands,
- Vector Autoregressive modeling and Detection [uses ARMASA]
- Reduced statistics ARMAsel: A compact yet accurate ARMA model is obtained based on a given power spectrum. Can be used for generation of colored noise with a prescribed spectrum.
- ARfil algorithm: The analysis of missing data/irregularly sampled signals
- Subband analysis: Accurate analysis of a part of the power spectrum
- Detection: Generally applicable test statistic to determine whether two signals have been generated by the same process or not. Based on the Kullback-Leibler index or Likelihood Ratio.
- Analysis of segments of data, possibly of unequal length.
- 2022-03-04 02:22:26下载
- 积分:1
-
图像处理综合应用
计算机图形处理学科中的一些基本功能的实现(压缩,线性滤波,水平镜像等等)
- 2022-05-28 15:03:47下载
- 积分:1
-
TEST a program
gdsfgdfgd
fgdf
gd
g
df
gd
fg
dfg
- 2022-01-22 10:36:48下载
- 积分:1
-
鼹鼠闯迷宫
资源描述void creatWay(int (*mg)[N],int x, int y)//在迷宫中产生一条路,使用图的深度遍历思想来实现,
{
static int dir[4][2] = {0, 1, 1, 0, 0, -1, -1, 0};////将要走的4个方向保存在二维数组中
int zx = x*2;
int zy = y*2;
int next, turn, i;
mg[zx][zy] = 0;
if(rand()%2)
turn = 1;
else
turn = 3;
for(i=0,next=rand()%4;i
- 2022-01-26 05:46:58下载
- 积分:1