Genetic Algorithms in Artificial Intelligence the authority of books suitable fo...

决策树分类中经典算法的ID3和Ｃ４．５代码公共包！-Classical decision tree classification algorithm ID3 and C4.5 code public packet!

平台vs2005 模拟固体退火算法实现144个城市的旅行商问题，可设置具体参数-VS2005 simulation platform to achieve solid annealing algorithm 144 city traveling salesman problem, you can set specific parameters

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

基于k均值聚类学习算法的rbf神经网络实现-K-means clustering-based learning algorithm of rbf neural network

数据挖掘算法之一，基于代表点的CURE聚类算法，该算法先把每个数据点看成一类，然后合并距离最近的类，直至类个数为所要求的个数为止。-CURE cluster algorithm based on representive point,one of data mining algorithms,classifies each data as a category firstly, then unifies categories with the nearest distance into one until the number of class is coincidence with the classes demanded.

自主式决策树学习的程序源码，对研究机器学习的同行很有用。-Autonomous Decision Tree learning procedures source, the study machine learning peer useful.

这是一个模式识别中的parzen窗的一个简单仿真分类实例，其中female.txt和male.txt是训练样本，test.txt是测试样本，分类效果非常好，对于模式学习的初学者将会有很大帮助。-This is a pattern recognition in a simple window parzen Category simulation examples, one of female.txt and male.txt training samples, test.txt is the measurement, classification effect is very good for beginners will be learning model has very big help.

基于java实现的遗传算法的源代码，利于初学者了解GA以及如何用java实现。-Java-based genetic algorithm realize the source code, which will help beginners learn how to use GA as well as realize java.

matlab神经网络应用设计，里面随有详细代码-Matlab neural network application design, which with a detailed code

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