WEKA 3

使用蚁群算法解决旅行商问题，mfc应用程序，城市数目及坐标在eil51.tsp里-use ant algorithm to solve the traveling salesman problem, and mfc applications, The number of cities and coordinates the eil51.tsp Lane

手书认证。 这是一个实现签名认证系统，需要的人可以下载下来添加自己的一些修改就可以了-handwritten certification. This is a realization of signature authentication system, people in need can be downloaded from adding some of his own amendment on the

一篇研究遗传算法的人都必须看的文章，是国内遗传算法研究的泰斗！-A well know article in the field of genetic algorithm.The writer is very famous in our country

face recognition test source code

介绍了蚁群算法解决具体问题的优化算法，实践证明效果很好-on the ant colony algorithm for solving specific problems Optimization Practice has proved very effective

在数字信号处理中实现相关的能够人工智能滤波的功能-To artificial intelligence filtering

本人编写的incremental 随机神经元网络算法，该算法最大的特点是可以保证approximation特性，而且速度快效果不错，可以作为学术上的比较和分析。目前只适合benchmark的regression问题。 具体效果可参考 G.-B. Huang, L. Chen and C.-K. Siew, “Universal Approximation Using Incremental Constructive Feedforward Networks with Random Hidden Nodes”, IEEE Transactions on Neural Networks, vol. 17, no. 4, pp. 879-892, 2006. -I prepared by incremental random neural network algorithm, which is characterized by the largest approximation properties can be guaranteed, and fast good results can be used as an academic comparison and analysis. The current benchmark is only suitable for the regression problem. Specific effects may refer G.-B. Huang, L. Chen and C.-K. Siew,

由于K－均值聚类算法局部最优的特点，而模拟退火算法理论上具有全局最优的特点。因此，用模拟退火算法对聚类进行了改进。20组聚类仿真表明，平均每次对K结果值改进8次左右，效果显著。下一步工作：实际上在高温区随机生成邻域是个组合爆炸问题（见本人上载软件‘k－均值聚类算法’所述），高温跳出局部解的概率几乎为0，因此正考虑采用凸包约束进行模拟聚类，相关工作正在进行。很快将奉献给各位朋友。-as K-means clustering algorithm for optimal local characteristics, and simulated annealing algorithm theory with the characteristics of the global optimum. Thus, simulated annealing algorithm for clustering improvements. Cluster Group of 20 simulations show that the average value of K results improved about eight times, the results are obvious. The next step : In fact, in high temperature generated random neighborhood is a combination of explosives (see my software on the "k-means clustering algorithm" mentioned above), high-temperature solution of partial out almost zero probability, it is considering the use of convex hull bound for simulation cluster, the work under way . Soon dedication to the ladies.

贝叶斯网络分类器的一点小程序，也许有用，请各位资源下载-Bayesian Network Classifier for small procedures, may be useful, please download resources

遗传算法求解最优解求函数的最大值 : f(x,y)=21.5+x*sin(4*PI*x)+y*sin(20*PI*y) | 定义域 D: -3