来自于www2.cs.uregina.ca的c4.5源码

蚁群算法源代码，一个老外的例子-ant colony algorithm source code and an example of a foreigner

给语音加噪声的一个程序，可以给定需要加噪声的分贝数，程序会自动加载，选用的是随机白噪声。-Plus noise to the voice of a program, you can determine the needs to increase the number of decibels of noise, the program will automatically load, selected at random white noise.

这是一个国外的Hopfield神经网络，有实例，可修改！-Hopfield Networks

BP神经网络算法，可以调节隐层，输入输出等-BP neural network algorithm, can be adjusted hidden layer, input and output, etc.

粗糙集软件Rosetta，由挪威科技大学计算机与信息科学系和波兰华沙大学数学研究所合作开发的一个基于Rough集理论框架的表格逻辑数据分析工具包-Rough Set software, Rosetta, by the Norwegian University of Science and Technology, Department of Computer and Information Science, University of Warsaw, Poland Institute of Mathematics, co-developed a theoretical framework based on Rough Set the table logical data analysis tool pack

人工智能课件，好不容易从老师那里考的，觉得老师讲的还蛮不错的-AI courseware, finally, where the exam from the teacher felt that the teacher talked about quite a good

遗忘因子法递推算法用于估计数学模型的参数,精确度较高!-Forgetting factor recursive algorithm method used to estimate the parameters of the mathematical model, high accuracy!

人工智能实验§贝叶斯网络的因果推理关系§ 熟悉掌握Bayes定理，学习贝叶斯网络的因果推理-artificial intelligence experiments Bayesian network causal reasoning relations mastery Bayes Theorem, learning Bayesian network causal reasoning

神经网络中的SOM算法的C语言程序实现,可以对初学者了解神经网络有帮助.-SOM neural network algorithm in the C language program can be for beginners understand the neural network has to help.

改进遗传算法－郭涛算法做最优化问题很管用,算法的基本思想是 先任意产生n个随机数，然后从n个数里随机选择m个数，再有这m个 数合成一个新数，将这个新数同n个数中间适应值函数值的最差的比较， 如果好的话就取代最差的那个，如果它比最好的还要好的话，则把最好的 也取代。如果比最差的坏，则重新合成一个新数。依次循环下去。 程序的奇妙之处是GA_crossover()函数，产生的新数确实比较好，看看 那位大侠能改进一下，产生比这跟好的数。-improved genetic algorithm- Guo Tao done optimization algorithm is very effective, and the algorithm is the first basic idea arbitrary n generated random number and then the number li n m randomly selected number, and this number m of a new synthesis of the new middle with n number fitness function of the worst by comparison, if a good case to replace the worst, um, if it even than the best, then ruled the best have replaced. If worse than the worst, a de novo synthesis of new. Followed by the cycle continues. The magic of procedures is GA_crossover () function, the new really good to see heroes who can be improved upon, it generated more than a few with a good.