Statistical learning theory is based on a more solid theoretical basis, in order...

此为蚂蚁算法求解TSP的源代码，希望对大家有所帮助-This is the ant algorithm to solve TSP source code, and they hope to help everyone

遗传算法的源代码下载,遗传算法的源代码下载-Genetic algorithm source code download, genetic algorithm source code download

本例是一个神经网络仿真应用程序，对于无这方面技能的人也能方便地使用它，程序基于BP反传播算法实现，通过网络训练，获得你需要的网络模型，同时，你还可以测试你建立的网络模型。内附三个实例-This is a example of networking simulink application program,

详细介绍了MATLAB遗传算法工具箱及在工程方面的应用，有了这本书，可以很方便地使用遗传算法解决问题了-Detailed MATLAB genetic algorithm toolbox and its application in engineering, with this book, it is easy to use genetic algorithms to solve the problem of

通过MATLAB实现的打砖块游戏(breakout)，内含netlab人工神经网络工具箱-The implementation of a interesting game "breakout" using MATLAB, also a netlab toolbox of artificial neural network is included.

蚁群算法源代码，一个老外的例子-ant colony algorithm source code and an example of a foreigner

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.

java神经网络工具箱-neural network toolbox

把libsvm包在一起，只要能读入矩阵转换成所需的格式libsvm就可以运行了

c++编写的模式识别k均值算法-c k prepared by the average pattern recognition algorithm