资源列表
2
- tsp遗传算法代码 利用交叉算子改进方法求解旅行商问题-tsp genetic algorithm code
ga_bp
- 基于gaot工具箱优化BP以实现数据拟合。在nninit.m中修改数据存储的路径以及隐含层节点数的设置(S1),遗传算法与bp的参数修改在ga_bp.m中进行。-Toolbox gaot Optimize based on BP in order to achieve data fitting. At nninit.m modify the path of data storage as well as the hidden layer nodes of the set (S1), geneti
naive_bayes_classifer
- naive bayes classification
DataMining
- 用VC或Java实现K-means聚类算法,分别以迭代次数及分配不再发生变化为算法终止条件,用图片(自己选择)作为数据集,比较运行时间(画出时间与像素点的关系曲线图,因此须用多幅像素个数不同的图片进行实验),提交实验报告与源代码。-With the picture (choose your own) as data sets, more running time (draw time and pixels relations diagram, so must use many different
fault_diagnosis
- 故障诊断程序,齿轮故障诊断,这里的神经网络可以根据需要选择,也可以都选择进行比较,方便写学术论文。-Troubleshooting procedures, gear fault diagnosis, where the neural network can be selected according to, you can also choose to compare, easy to write academic papers.
bayes_total
- 最小错误概率贝叶斯分类器的matlab程序,可用于二维数据的分类以及分类效果的图像显示,可帮助初学者加深对贝叶斯分类算法的理解。-This is a matlab program of the minimum probability of error of Bayesian classifier.Which can display the image of two-dimensional data classification and the classification results . I
waveletnnnpid
- 基于小波神经网络的PID控制Matlab仿真,有代表性,值得研究
myPod
- potencia algorithm that works for every case
eg20-bianliangshaixuan
- 《MATLAB神经网络30个案例分析》中的第20个例子,案例20 神经网络变量筛选—基于BP的神经网络变量筛选。希望对大家有一定的帮助!-The MATLAB neural network analysis of 30 cases of example, 20 cases of 20 neural network variable selection- based on BP neural network of variable selection. Hope to have certain h
KPitch
- 这个是用来进行基频检测的,目前做的最好的应该数Paul的基频提取算法了,误差可以小于万分之五。该源代码的算法是我根据Paul的算法修改得到,省略了插值部分,所以误差在百分之五以内,但是在实际工作中已经足够了。-is for the frequency of detection, so the best should be the number of frequency Paul extraction algorithm, can be less than prior error. The sou
mayi
- 用MATLAB语言编写。三十三座城市的蚂蚁算法。解决TSP问题。
xilihuala
- 具有图形化界面的一个路由模拟程序。路由算法为Dijkstra算法。具有求出图中任意节点间所有最短路径以及最短路径子图的功能。-Graphical interface with a routing simulation program. Routing algorithm is Dijkstra algorithm. Find the figure with all the shortest path between any node and the shortest path subgraph