jurusan-decision-tree

粒子群优化算法(PSO)是一种进化计算技术(evolutionary computation)，有Eberhart博士和kennedy博士发明。源于对鸟群捕食的行为研究 PSO同遗传算法类似，是一种基于叠代的优化工具。系统初始化为一组随机解，通过叠代搜寻最优值。但是并没有遗传算法用的交叉(crossover)以及变异(mutation)。而是粒子在解空间追随最优的粒子进行搜索。详细的步骤以后的章节介绍 同遗传算法比较，PSO的优势在于简单容易实现并且没有许多参数需要调整。目前已广泛应用于函数优化，神经网络训练，模糊系统控制以及其他遗传算法的应用领域(Particle Swarm Optimization (PSO) is an evolutionary computation technique (evolutionary computation), has Dr. Eberhart and Dr. kennedy invention. Deriving from the behavior of birds of prey PSO with genetic algorithm is similar to an iterative optimization-based tools. System initialization for a group of random solutions, through the iterative search for optimal values. But there is no cross-genetic algorithm used (crossover) and mutation (mutation). But the particles in the solution space of the particles to follow the optimal search. In detail the steps after the introduction sections compared with the genetic algorithm, PSO has the advantage of being simple and easy and did not realize many of the parameters need to be adjusted. Has been widely applied to function optimization, neural network training, fuzzy system control, as well as other genetic algorithm applications)

kmeans算法的描述，源代码实现，matlab上 的程序(kmeans)

一本介绍aml编程设计的书籍.比较基础,实用.(aml introduced a program designed books. Basis for comparison and practical.)

this file consists files witch can use aco for tsp

说明：  矩阵填充matrix completion的3种方法IHT,IST,NONCVX代码和demo(The matrix filled matrix completion methods IHT, IST, NONCVX code and demo)

the threshold obtained in maximum entropy is optimized with particle swarm optimization. the result is good

A*算法路径规划，程序中采用随机障碍物，通过躲避障碍物来完成路径的规划(A* algorithm; path planning)

可以用来求ADC的SNDR的m文件，需要ADC的输出作为txt文件输入(M files for SNDR that can be used for ADC)

这个主要是这对工业区预测编的程序，考虑的是GM（1,2）这种方式，如果是GM（1，n）可以改动一下就可以了。(This mainly Industrial Zone forecast compiled program, consider the GM (1,2) In this way, if the GM (1, n) can be changed and click on it.)

sorce code for imageprooceesin with matlab code