基于点轨迹的手势识别.鼠标右键点击开始记录鼠标轨迹,基于记录的轨迹,利用神经网络算法进行识别....

用于求解TSP的蚁群算法，C 语言 已经运行过-Basic Ant Colony Algorithm for TSP

Machine Learning Weka 数据变换，给Arff文件加载权值，变换为XRFF文件。-Machine Learning Weka data transformation to Arff file to load the right value, transform paper to XRFF.

一个可自我学习的人工智能小模型，可进行训练，也可进行提问。 希望对大家研究人工智能算法上有帮助！-A small self-learning artificial intelligence model for training, but also ask questions. We hope that research on artificial intelligence algorithms help!

PSO--粒子群优化算法程序在vc++.net 2003下可实现的-PSO Particle Swarm Optimization procedures vc++. Net 2003 can be achieved

一个bp神经元网络的c++实现，优化了算法，有可执行界面-A bp neural network c++ to achieve and optimize the algorithm, there is an executable interface

基本遗传算法 里面的函数可自行更换 适合初学者 容易理解-A function of the basic genetic algorithm which can be suitable for beginners is easy to understand on their own replacement

关于模糊模式识别的最新研究，很有用的资料。-fuzzy pattern recognition on the latest research and useful information.

cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.

隐马尔科夫模型工具箱，可以广泛应用于识别等领域-HMM Toolbox, can be widely applied in areas such as identification

遗传算法，生物技术，进化技术，主用用来求函数优化问题-Genetic algorithms, bio-technology, evolution of technology, the main use for the seek function optimization problems