资源列表
pink.mat
- 为大家提供了粉色噪声产生方法的一段matlab程序-to provide you with a pink noise of a Matlab procedures
hopfield_net
- 对于含有噪声的的数字图像模式“1、2、3、4”，使用“hopfield”神经网络，进行联想、识别，以去除噪声的影响。-for containing noise of the digital image model "1,2,3,4", "hopfield" neural network, Lenovo, identification, in order to remove noise impact.
weka-3-4-4
- 由java开发的软件包，里面有人工智能所用的很多东东，包括神经网络，支持向量机，决策树等分类和回归分析方法，集成化软件哦！-by java development package, which has artificial intelligence used by many of the Eastern, including neural networks, support vector machines, such as decision tree classification and reg
Maxfpminer1
- 本程序实现通过构造一棵前缀树实现 最大模式频繁项集挖掘算法.应用fp树增长算法实现.-the program by constructing a prefix tree to achieve the greatest model Frequent Mining algorithms. Application fp growth tree algorithm.
chameleon
- 变色龙层次聚类算法，利用动态模型的层次聚类算法-chameleon hierarchical clustering algorithm, using a dynamic model of hierarchical clustering algorithm
cure
- 层次聚类算法中的cure算法，它利用代表点来达到聚类目的-hierarchical clustering algorithm cure the algorithm, which uses representatives point to achieve clustering purpose
树木分类专家系统
- 这是一个基于WEB的树木分类专家系统asp源代码,对于初学者特别有帮助!-This is a Web-based expert system for classification trees asp source code, especially for beginners help!
二叉树操作&图的遍历操作
- 二叉树操作&图的遍历操作， 完全按照里面的文挡用VC所完成的程序， 有详细的说明-binary tree traversal operation of the plan operations, in full accordance with the text inside the block with VC performed by the procedure is described in detail in
compress_folders
- 哈夫曼压缩程序，实现了文件加读取，对文本文件的压缩率与rar差不多，读学习c/c++的朋友非常有用-huffman compression program, which realizes folder access and compressing rate is the same to rar when compressing text file
matrix_js
- 矩阵计算，包括了矩阵的加减乘除，还可以实现对角化，对一次解方程组非常有帮助-computing in matrixs,It Includes the plus and multiply and so on,It can realize the diagonalize,that will be very helpfull for one result equation
行列式运算
- 行列式计算，基本的行列式的运算都实现了而且可以任意阶运算，不过阶数太高会影响速度-determinant calculation, the basic determinant of the computing is achieved can be arbitrary order operation, but the order will affect the speed is too high
binary
- 利用遗传算法求最小值，程序中求得是表达式x1*x1+x2*x2+x3*x3再-2~2上的最小值，以及对应的x值，算法中使用二进制编码，交叉采用不同交叉和优势交叉，变异也分两种，不用变异和优势变异-using genetic algorithms for the minimum, procedures to seek expressions x1 x1 x2 * * * x2 x3 x3 another 2 ~ 2 on the minimum, and the corresponding val