遗传算法的简单程序，可用于离散变量优化，多目标优化等许多领域...

cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.

kmeans算法的java描述，我自己编写的，可以运行的-java kmeans algorithm description, I am prepared, ready-to-run

线性M3网络及其示意图，用于检测M3网络冗余的算法-err

支撑向量机算法的一种改进算法，是基于增量学习的算法-Support Vector Machine Algorithm an improved algorithm is based on the incremental learning algorithm

最棒的三大计算机视觉、图像图形函数库之一，C语言版本，支持标准C-best of the three major computer vision, image and graphics functions, one C-language version supports standard C

这个是SA模拟退火求函数极值用c++编译的程序-the simulated annealing SA is seeking function using extreme procedures c compiler

离散二进制粒子群算法 DPSO -DPSO

支持向量机工具箱使用方法演示，讲述如何使用svm的工具箱。-Support Vector Machines to use the toolbox demonstration on how to use the toolbox svm.

k-means(欧氏距离)聚类算法是最基本的聚类算法，是理解和应用聚类算法的基础，通过k-means(欧氏距离)聚类算法我们才可以初步了解数据挖掘的原理。-k-means (Euclidean distance) clustering algorithm is the most basic clustering algorithm, is understanding and the basis for the application of clustering algorithm, through the k-means (Euclidean distance) clustering algorithm we are able to a preliminary understanding of the principles of data mining .

基于svm的机器学习文本分类方法，具有很好的借鉴意义-Svm-based machine learning text classification methods, with a good reference