A variety of numerical algorithms, including: binary tree, greedy algorithm, sea...

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.

人工智能领域最基本的问题-artificial intelligence fundamental problem

java版的PrefixSpan算法实现，文件里包含了详细的文档说明，还有示例。-PrefixSpan algorithm. The document containing a detailed description and an example.

该源码用来实现基本粒子群的算法，值得参考-The source algorithm is used to achieve the elementary particle group, worth considering

用RBF实现的目标图象识别程序,C实现,可以应用于DSP系统.-RBF realize the goal of using the image recognition program, C realize, can be used in DSP systems.

神经网络算法

ART2自组织神经网络vc++源程序，调试通过，可以使用。-ART2 self-organizing neural network vc++ Source code, debugging through, you can use.

粗糙集软件Rosetta，由挪威科技大学计算机与信息科学系和波兰华沙大学数学研究所合作开发的一个基于Rough集理论框架的表格逻辑数据分析工具包-Rough Set software, Rosetta, by the Norwegian University of Science and Technology, Department of Computer and Information Science, University of Warsaw, Poland Institute of Mathematics, co-developed a theoretical framework based on Rough Set the table logical data analysis tool pack

从其它网站上下载的用VC++编制的模拟退火算法求解TSP问题的源代码-from other websites downloaded VC simulated annealing algorithm for TSP source code!

一个简单的遗传算法C++类-a simple genetic algorithm C