-
MYCIN不确定推理机的C++骨架程序，运行高效率。
MYCIN不确定推理机的C++骨架程序，运行高效率。-MYCIN uncertainty reasoning machine C++ skeleton program, run efficient.
- 2022-12-17 13:05:04下载
- 积分：1
-
目标函数是De Jong函数，是一个连续、凸起的单峰函数
目标函数是De Jong函数，是一个连续、凸起的单峰函数-Objective function is De Jong function, is a continuous, convex function of the single-peak
- 2022-05-13 15:07:14下载
- 积分：1
-
BP neural network C language package
BP神经网络C语言程序包-BP neural network C language package
- 2022-01-24 09:28:46下载
- 积分：1
-
C development based on the three hidden layer neural network, the output weights...
基于C开发的三个隐层神经网络，输出权值、阈值文件，训练样本文件，提供如下函数：1）初始化权、阈值子程序；2）第m个学习样本输入子程序；3）第m个样本教师信号子程序；4）隐层各单元输入、输出值子程序；5）输出层各单元输入、输出值子程序；6）输出层至隐层的一般化误差子程序；7）隐层至输入层的一般化误差子程序；8）输出层至第三隐层的权值调整、输出层阈值调整计算子程序；9）第三隐层至第二隐层的权值调整、第三隐层阈值调整计算子程序；10）第二隐层至第一隐层的权值调整、第二隐层阈值调整计算子程序；11）第一隐层至输入层的权值调整、第一隐层阈值调整计算子程序；12）N个样本的全局误差计算子程序。-C development based on the three hidden layer neural network, the output weights, threshold documents, training sample documents, for the following functions : a) initialization, the threshold subroutine; 2) m learning samples imported subroutine; 3) m samples teachers signal Subroutine ; 4) hidden layer of the module input and output value subroutine; 5) the output layer of the module input and output value subroutine; 6) the output layer to the hidden layer subroutine error of generalization; 7) hidden layer to the input layer subroutine error of generalization; 8) the output layer to the third hidden layer Weight adjustment, the output layer threshold adjustment routines; 9) 3rd hidden layer t
- 2022-07-11 04:13:40下载
- 积分：1
-
portal门户开发，jetspeed的应用及理论讲解
portal门户开发，jetspeed的应用及理论讲解-portal development portal, jetspeed application and theory to explain
- 2022-12-21 20:55:03下载
- 积分：1
-
K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K－均值聚类的的时间复杂度是n*k*m，其中n为样本数，k为类别数，m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类，寻找最优，列举一遍约66.7天，分成3类，则要约3500万年。针对算法局部最优的缺点，本人正在编制模拟退火程序进行改进。希望及早奉给大家，倾听高手教诲。-K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.
- 2022-01-28 00:58:44下载
- 积分：1
-
模式识别k_means聚类算法。
模式识别k_means聚类算法。-kmeans clutering algorithm for Pattern Recognition
- 2023-04-21 16:10:03下载
- 积分：1
-
隐马尔可夫模型算法(解压后为ppt文件，改名为a.ppt)
隐马尔可夫模型算法(解压后为ppt文件，改名为a.ppt)-HMM algorithm (decompression after ppt documents, renamed a.ppt)
- 2022-08-05 10:26:45下载
- 积分：1
-
algorithm data mining algorithm is the classic algorithm, which is based on the...
apriori算法是数据挖掘的经典算法,它基于关联规则的思想.此为我的第3个收藏-algorithm data mining algorithm is the classic algorithm, which is based on the idea of association rules. This was my first three collections
- 2022-07-16 17:51:33下载
- 积分：1
-
Vb prepared using a one
一个用vb编写的一维模糊控制器程序!
简单易懂-Vb prepared using a one-dimensional fuzzy controller program! Easy-to-read
- 2022-03-17 04:38:18下载
- 积分：1
