介绍了在LabView环境下的神经网络算法

weka机器学习系统（本站可下载）的拓展，简化了从关系数据库中提取数据-weka machine learning system (download site), the development of a simplified relational database from which to extract data

C++实现神经网路的bp算法，初学者可以参考下 BP algorithm of neural network s achievement based on c++, maybe it is useful to a new learner-C++ Realization of bp neural network algorithm, beginners can refer to under the BP algorithm of neural network s achievement based on c++, Maybe it is useful to a new learner

日本V01机器人运动学算法，包括正反运动学源程序及头文件的定义-Japan V01 robot kinematics algorithm, including the pros and kinematic source and header files to the definition

一个不错的自适应滤波演示程序,包括固定带通滤波器和可变带通滤波器的演示.-a good demonstration of adaptive filtering procedures, including band-pass filter fixed and variable bandpass filter demonstration.

遗传基因算法源代码(资料)，C++源代码，是研究遗传算法的入门程序。-genetic algorithm source code (information), C source code, is to study the genetic algorithm entry procedures.

-连续动态环境的XCS问题的测试版本：真实的多路复用器实验：XCS是在动态环境中探索的，对基本概念有不同程度的改变。参考文献：H.H.Dam，H.A.Abbass，C.J.Lokan。进化在线数据挖掘是一种动态环境下的研究。2005被《斯普林格计算智能研究丛书》中的一章所接受H.H.D.am，H.a.Abbass，C.J.Lokan。要真实！具有连续值输入的XCS。IW LCS 2005。学习分类系统国际研讨会。华盛顿特区，2005年6月。

FP-GROWTH算法的源代码(JAVA)-FP-Growth code and algrithem

用遗传算法实现任务分配优化的源程序。-genetic algorithm optimization task allocation of the source.

K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K－均值聚类的的时间复杂度是n*k*m，其中n为样本数，k为类别数，m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类，寻找最优，列举一遍约66.7天，分成3类，则要约3500万年。针对算法局部最优的缺点，本人正在编制模拟退火程序进行改进。希望及早奉给大家，倾听高手教诲。-K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.

蚁群算法解决0-1背包问题,是一个比较小的程序，运行过，没有问题的。-the solving method of zero to one backage with ACO.It is a small programe for the zero to one problem.