本程序用于分类两类数据，分类速度很快，如果分类多类可能还要修改...

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.

蚂蚁算法的VC代码源，模拟蚂蚁觅食的行走途径，解决最优路径问题。-Ant Algorithm VC source code to simulate the foraging ants to walk way to solve the optimal routing problem.

采用动量梯度下降算法训练 BP 网络。 -Gradient descent algorithm using momentum BP network training.

C语言实现的PSO算法，2007标准版，希望对大家有用-PSO algorithm in C

一个简单的遗传算法源代码。。。。。代码保证尽可能少，实际上也不必查错-A simple genetic algorithm source code. . . . . Code to ensure that as little as possible, in fact, do not have error checking

经典的数据关联挖掘算法prefixspan-Classical data association mining algorithm PrefixSpan

该程序是基于MATLAB环境的pso实现tsp问题-The program is based on the MATLAB environment, the issue of PSO realize tsp

数据挖掘中的ID3算法源码 决策树的经典算法之一。 -Data Mining Source ID3 decision tree algorithm, one of the classic algorithm.

he AutoMix package is a C program for Unix-like systems, implementing the automatic reversible jump MCMC sampler of the same name described in Chapters 4, 5, and 6 of David Hastie s Ph.D. thesis-he AutoMix package is a C program for Unix-l ike systems, implementing the automatic reversible jump MC MC sampler of the same name described in Chapter s 4, 5, and 6 of David Hastie"s Ph.D. thesis

基本遗传算法,用来求解函数的最大值!在VC和TC下均可实现.-basic genetic algorithm used to solve the function of the maximum! And the VC can be achieved under TC.