关联规则中的频繁项集生成算法TreeMiner，可在linux和windows下编译运行。...

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为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 ...

用蚁群算法求解TSP（旅行商）问题，按照TSP.m中要求的格式输入程序参数即可运行！-Using Ant Colony Algorithm for TSP (traveling salesman) problems, in accordance with the format requested TSP.m input process parameters to run!

本程序用NetLogo开放，模拟行人流。为本人亲字编程。-the procedures used NetLogo open simulated flow. I affinity for the word programming.

极小化误差平方和算法聚类源代码，下载后直接运行就可以了-Minimizing the error sum of squares clustering algorithm source code can be run directly after downloading the

基于小生境遗传算法的分类规则数据挖掘算法 -Based on Niche Genetic Algorithm for Classification Rules Data Mining Algorithm

遗传算法，包含选择，交叉，变异等操作，可求出Y=sin(x)在0-2π的最大值和最小值-Genetic algorithm, including selection, crossover and mutation operation, etc., can be obtained Y = sin (x) at the 0-2π Maximum and minimum

本人编写的GramSchmidt神经网络算法，和传统的神经网络算法比较，该算法能自动产生神经元，节约时间，速度快！ 本人还加了自动产生分类的方法和适合各种函数的转换，该zip包括两个文件，一个是GramSchmidt正交分解，是个子函数，主函数是orth_GramSchmidt，放在同一目录下，就可运行，可以对benchmark的逼近和分类问题提供解决方案-I prepared GramSchmidt neural network algorithm, and the traditional neural network algorithm, the algorithm can automatically generate neurons, saving time, fast! I also added a method of automatically generated classification and conversion for a variety of functions, the zip includes two documents, one is GramSchmidt orthogonal decomposition is a sub-function, the main function is orth_GramSchmidt, on the same directory, you can run can benchmark approximation and classification problems to provide solutions

模式识别中的几个常用算法，包括ISODATA算法、K－均值算法、感知器算法、LMSE最小误差、贝耶斯分类。-pattern_recognition have some usual algorithm,including ISODATA algorithm,K-means algorithm,apperceive algorithm ,

用于神经网络分析与设计-for Neural Network Analysis and Design

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