web流数据聚类挖掘的研究和应用。流数据作为一种特殊的可挖掘的数据类型，特别是基于网络技术迅速发展的今天，其彰显出的重要地位决定了它的挖掘技术需要被认真考虑，而...

BP神经网络解决异或问题.模式识别常见问题解决-BP neural network to solve XOR problem. Pattern Recognition common problem-solving

遗传算法求解TSP问题，内附有遗传算法基本原理，程序已验证-Genetic Algorithm for TSP problem, containing the basic principles of genetic algorithm has the process had been made to verify

室内移动机器人定位与导航关键技术研究,新思路-Indoor mobile robot localization and navigation key technology research and new ideas

这是用Fortran实现的bp算法程序，供大家自学参-This is achieved using Fortran bp algorithm, for your self-Participation

粒子群优化算法(PSO)是一种进化计算技术(evolutionary computation).源于对鸟群捕食的行为研究 PSO同遗传算法类似，是一种基于叠代的优化工具。系统初始化为一组随机解，通过叠代搜寻最优值。但是并没有遗传算法用的交叉(crossover)以及变异(mutation)。而是粒子在解空间追随最优的粒子进行搜索。详细的步骤以后的章节介绍 同遗传算法比较，PSO的优势在于简单容易实现并且没有许多参数需要调整。目前已广泛应用于函数优化，神经网络训练，模糊系统控制以及其他遗传算法的应用领域-Particle Swarm Optimization (PSO) is an evolutionary technology (evolutionary computation). Predatory birds originated from the research PSO with similar genetic algorithm is based on iterative optimization tools. Initialize the system for a group of random solutions, through iterative search for the optimal values. However, there is no genetic algorithm with the cross- (crossover) and the variation (mutation). But particles in the solution space following the optimal particle search. The steps detailed chapter on the future of genetic algorithm, the advantages of PSO is simple and easy to achieve without many parameters need to be adjusted. Now it has been widely used function optimization, neural networks, fuzzy systems control and ot

模糊pid的一个例子，在Visual c++下通过-An example of fuzzy pid, in the Visual c++ Through

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.

解TSP问题的遗传算法C语言程序-solution of TSP genetic algorithm C Programming Language

MYCIN不确定推理机的C++骨架程序，运行高效率。-MYCIN uncertainty reasoning machine C++ skeleton program, run efficient.

C++神经网络开发包,基于C++语言，VisualC++环境-C++ Neural network development package, based on the C++ Language, VisualC++ Environment