MATLAB代码的支持向量机的分类、回归工具箱

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)

JESS开发模式，人工智能开发架构-JESS development model, the development of artificial intelligence structure

双峰和多峰函数最大值的遗传算法求解 采用前向网络-Bimodal and multimodal function maximum use of the genetic algorithm to the network

输入一个任意大小的迷宫， 用栈求出一条走出迷宫的路径， 并显示在屏幕上。-importation of a maze of arbitrary size, with a stack get out of the maze of trails and on the screen.

7。《进化算法》，云庆夏编着 冶金工业出版社 2000年第一版 全书共分5章，分别为绪论、遗传算法、遗传规划、进化策略、进化规划。-7. "Evolutionary algorithm," Yun Qing Xia compile Metallurgical Industry Publishing House in 2000 the first edition of the book is divided into five chapters, each of the introduction, Genetic algorithms, genetic programming, evolutionary strategy, evolutionary programming.

用人工神经网络实现异或的功能。用反向传播算法（BP）来实现神经网络，正确率可以达到80% -using artificial neural network XOR functions. With back-propagation algorithm (BP) to achieve neural network, can achieve an accuracy rate of 80%

利用神经网络来解决异或问题，代码是VC的-The use of neural networks to solve the XOR problem, the code is the VC" s

人工智能神经网络算法的实现。注意可能由于实现方式不同而导致结果有点不一样，这是允许的。-Artificial neural network algorithm.

围绕粒子群的当前质心对粒子群重新初始化.这样，每个粒子在随后的迭代中将在新的位置带着粒子在上次搜索中获得的“运动惯性”（wvi）向Pi，Pg的方向前进，从而可以在粒子群的运动过程中获得新的位置，增加求得更优解的机会.随着迭代的继续，经过变异的粒子群又将趋向于同一点，当粒子群收敛到一定程度时又进行下一次变异，如此反复，直到迭代结束.-particle swarm around the center of mass of the current PSO reinitialization. Thus, Each particle in the next iteration will be in the new location with particles in the last search was the "inertia" (wvi ) Pi, Pg orientation, and thus can PSO course of the campaign was a new position, increase seek better solutions opportunities. With the continued iteration, after variation of PSO will tend to the same point. When PSO converge to a certain extent when the next variation, so repeatedly, until the end of iteration.

pre-fixSpan算法，该算法是C++语言实现的，主要用模板实现prefixspan的投影数据库架构及模式生长功能