DataMining software (integrated association rules, k

遗传算法的通用程序，可以根据需要改编以适应不同的应用-Generic genetic algorithm procedure can be adapted to the needs of different applications

微分进化算法DE（Differential Evolution）由Storn和Price等学者于1995年首先提出。它是一种基于种群优化的新智能优化方法，它已被证明在求解过程中具有高效性、收敛性、鲁棒性等优点-Differential evolution algorithm DE (Differential Evolution) by Storn and Price and other scholars in 1995, the first place. It is a species based on the optimization of the new intelligent optimization method, which has been proved in the solving process with high efficiency, convergence, robustness, etc.

人工智能编程示例-artificial intelligence programming paradigm

遗传算法中的新的多点交叉算法用来优化选择最优值-Genetic algorithm in the new multi-point crossover algorithm

libsvm中文声明对流行的SVM软件libsvm的详细说明会对大家有所帮助

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

一个使用Java实现的人工智能的图搜索策略程序――酒九宫图问题 人工智能－图搜索策略－演示程序－使用说明 程序简介 在人工智能领域，对隐式图的搜索是求解问题的一种基本方法，本程序通过使用多种图搜索策略，对 重排九宫问题进行求解，演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术，界面设计美观友好，使用方便。-use a Java artificial intelligence plans Search Strategy-- Liquor JiuGongTu problems of artificial intelligence-map search strategy- Demonstration Program-use guide in the field of artificial intelligence, the implicit search of the plan to solve the problem is one of the basic methods, the procedures through the use of multiple map search strategy, the rearrangement JiuGongTu problem solving, presentation of the "breadth- first search," "depth-first search", "bounded depth-first search", "best-first search" and "partial selection of the best search" five basic map search strategy. The whole process of using animation, interface design aesthetic friendly, easy to use.

这是一个用遗传算法对KDDCUP数据集，实现自动检测的C程序，希望有用。-This is a genetic algorithm with KDDCUP data sets, to achieve automatic detection of the C program, I hope useful.

一个用C编写的实现BP神经网络的源程序，希望大家用得上-C prepared by a BP neural network to achieve the source, I hope everyone useful

关于人工神经网络的实用书籍，适合初学者，以及有一定基础的读者学习-Information on artificial neural networks and practical books, suitable for beginners, as well as readers of a certain basis for learning