-
LVQ1
说明： matlab,编写的LVQ1数据挖掘分类算法。
(Matlab, prepared by the Data Mining LVQ1 classification algorithm.)
- 2005-12-29 14:35:19下载
- 积分：1
-
WEB
ASP.NET3.5_新闻发布系统ASP.NET3.5_新闻发布系统ASP.NET3.5_新闻发布系统(ASP.NET3.5)
- 2010-05-09 15:57:10下载
- 积分：1
-
bayes_k_nn
求Weighted/Non-weighted贝叶斯k近邻模型的matlab程序，内含具体说明。(seeking Weighted/Non-weighted k neighbors Bayesian model matla b procedures, containing details.)
- 2006-12-26 17:23:40下载
- 积分：1
-
dianzy
地球物理电法一维电测深正演系统。通过输入地层数，每一层地层厚度，每一层地层电阻率来进行正演(The geophysical method one-dimensional power forward sounding system. Input to the number of layers, each layer stratigraphic thickness of each layer formation resistivity forward)
- 2013-04-23 10:29:34下载
- 积分：1
-
PCAmatlabdocx
用于主成分分析的源码，由例子可以直接了解PCA的步骤方法(Principal component analysis of the source code used by the example of the method can be directly aware of the steps of PCA)
- 2014-01-14 13:04:50下载
- 积分：1
-
gabp
本程序是利用全有全局搜索能力的遗传算法来优化bp神经网络的，优化神经网络的权值与阈值(This procedure is the use of all-global search capability of genetic algorithm to optimize bp neural network optimization neural network weights and thresholds)
- 2015-05-29 12:15:34下载
- 积分：1
-
AnimBear
Animate a bear using sprites, using cocos 2D
- 2010-08-07 13:44:20下载
- 积分：1
-
matlab-kriging-maozhuangtu
kriging拟合帽状图（其他拟也行的哦）。(kriging fitting cap-like figure (other lines are also to be oh).)
- 2009-10-09 22:53:04下载
- 积分：1
-
fdeconv
说明： 快速反卷积。计算速度很快，必要的时候需要手动更改m文件里的fft点数以改变计算精度。很好的代码。(Rapid deconvolution. Computing speed very quickly, when necessary to manually change the m file points to change the fft calculation accuracy. Very good code.)
- 2008-09-02 14:02:23下载
- 积分：1
-
DTW
DTW算法的程序，申请两个n*m的矩阵D、d,分别为累积距离和帧匹配距离。这里n和m为测试模版与参考模版的帧数。然后通过一个循环计算两个模版的帧匹配距离d。接下来进行动态规划，为每个格点 （i，j）都计算其三个可能的前续格点的累积距离D1，D2，D3。考虑到边界问题，有些前续格点可能不存在，因此加入一些判断条件最后利用最小值函数min()，找到三个前续格点的累积 距离作为累积距离，与当前帧的匹配距离d（i，j）相加，作为当前格点的累积距离。该计算过程一直达到格点（n，m），并将D（n，m）输出，作为模版匹配的结果。(DTW algorithm procedures, apply two n* m matrix D, d, respectively, accumulated distance and frame matching distance. Where n and m is a reference test pattern and the template frames. Then through a loop to calculate two frames template matching distance d. Next, dynamic programming, for each grid point (i, j) are calculated from the cumulative D1 before the renewal of its three possible lattice point, D2, D3. Taking into account the boundary problem, some former continued grid point may not exist, so add some conditions to determine the final use of the minimum function min (), found three former continued accumulation of grid points cumulative distance as the distance from the current frame to match the d (i, j) added, and a current cumulative distance grid. This calculation has reached the grid (n, m), and D (n, m) output, as a result of template matching.)
- 2014-05-05 14:30:21下载
- 积分：1
