支持向量机的好程序，强大的推荐，太长，没有办法，三。

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

On the splitting method for VQ codebook generation by using Matlab

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...

模式识别源程序，希望大家能够喜欢，配套书籍是模式识别-Pattern recognition source code, hope that we can like it, matching books are Pattern Recognition

模拟退火生成树，一种比较好分类方法。程序简单，易懂。-simulated annealing Spanning Tree, a better classification. Simple and straightforward.

基于matlab的改进模拟退火算法（经典）-Matlab-based improvements in simulated annealing algorithm (classical)

AI chat ROBOT it is interesting

Schapire 所著的Boosting算法的教程。 对目前物体识别和机器学习领域中广泛应用的Boosting算法展开了深入浅出的描述，还有很多Toy Examples。-Tutorial for Boosting algorithm by Schapire

经典的K均值分类算法源码，修正了原作者没有处理当类中样本为0的情况下的bug-classic K-mean classification algorithm source code, that the original author did not address when the category 0 samples of the bug

FAST apriori.cpp 基于数组和为运算的apriori算法实现,采用为运算来测试子集的存在性，把测试子集存在性的复杂度由O(n^2)降低为O(n)-FAST apriori.cpp array-based computing and for the apriori algorithm, adopted as the operator to test the existence of a subset to test the existence of a subset of the complexity from O (n ^ 2) reduced to O (n)