资源列表
BPANN
- 本例采用vc编程实现BP神经网络，程序将涉及到梯度下降法、函数求逆，以及偏导数的实现。-In this case using vc BP neural network programming, the program will involve the gradient descent method, the inverse function, as well as the realization of partial derivatives.
GA(Genetic-Algorithm)
- 本实例采用遗传算法求多项式最小值，使读者掌握遗传算法的基本思想，并能具体应用-This example uses the minimum polynomial of genetic algorithm, so that the reader grasp the basic idea of ??genetic algorithms, and to the specific application
Keltner-Channel
- Keltner Channel，精选的外汇交易指标，很强大。-Keltner Channel, a selection of foreign exchange index, very powerful.
yichuansuanfachengxu
- 我在论坛上下的遗传算法，非常全，希望对大家有好处-I am up and down the genetic algorithm in the forum, very full, we hope to benefit
SSL_channel_chart
- 金融外汇交易的通道指标，很好的。在通道范围内买卖。-Financial and foreign exchange transactions, channel indicator, very good. Trading within the channel.
Bp
- bp神经网络的代码，经过试用可行。感兴趣的童鞋可以下载，欢迎试用-bp neural network code, after the trial is feasible. Interested in children' s shoes can be downloaded, please try. . .
book-fussy
- 李士勇老师编写的模糊控制·神经控制和智能控制论-Li Shiyong teacher preparation neural control and fuzzy control intelligent control theory
apply
- 王士同编写的模糊系统模糊神经网络及应用程序设计-Wang Shi-fuzzy system with the preparation of fuzzy neural network and application design
BPidentification
- 本程序用BP神经网络实现对十六进制数字的识别.首先将进行数字化处理并建立BP神经网络。然后进行无噪声训练及进行有噪声训练.最后进行识别及测试网络的容错性. -This procedure using BP neural network identification of hexadecimal digits First digitized and the establishment of BP neural network.The establishment of BP neural
LBP
- 本代码为经过优化后的LBP纹理描述子提取代码，非常适合学习该算法的人-After optimization of the code for the LBP texture descr iptor extraction code, the algorithm is very suitable for people to learn
genetic
- c++实现的遗传算法解决八皇后问题，有时候会陷于局部收敛，导致进化代数很多-c++ implementation of genetic algorithm to solve the eight queens problem, and sometimes caught up in the local convergence, resulting in a lot of evolution algebra
K-MEANS
- 均值计算方法源码实现：分群的方法，就改成是一个最佳化的問題，換句话說，我們要如何选取 c 个群聚以及相关的群中心，使得 E 的值为最小。 -Method of calculating the mean source implementation: clustering method, based on the best change is a problem, in other words, how do we choose c a center cluster and related g