神经网络预测程序代码

两个人工智能小程序，解决八数码问题，使用A*算法-two small programs to solve eight digital, the use of A* algorithm

这个程序主要提高了神经网络，遗传算法，聚类等多种人工智能算法，采样c++编程，，很精简-This process mainly to improve the neural networks, genetic algorithms, clustering and many other artificial intelligence algorithms, sampling c++ Programmed, it is streamlined

很好的遗传算法值得一看-well worth looking at the genetic algorithm

Libsvm is a simple, easy-to-use, and efficient software for SVM classification and regression. It solves C-SVM classification, nu-SVM classification, one-class-SVM, epsilon-SVM regression, and nu-SVM regression. It also provides an automatic model selection tool for C-SVM classification. This document explains the use of libsvm.

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...

机器博弈机器搜索算法的研究，做acm与人工智能的可以参考下-Machine Game Machine search algorithm research, acm to do with artificial intelligence can refer to the next

本文采用红外光电传感器技术, 建立了一个基于神经网络的客流计数系统, 与传 统的仅利用光电传感器计数方法相比, 该方法提高了实时客流计数准确率。为了更好的分 类识别计数, 针对采集的连续的时空序列客流数据特点, 改进了已有的分割方法和针对客 流实际情况的特征提取方法。最后经过稀疏和密集客流模拟仿真测试, 结果表明, 本文所 提出的模型能够识别多人并排的情况, 误差率较低, 具有理论和实际意义。-RBF

经过改进的遗传算法的VC源代码。经测试算法有效可行。-improved genetic algorithms VC source. Testing Algorithm effective.

hide markov model(HMM) for matlab including initiate,train,and test three parts -hide markov model (HMM) for Matlab includi Vi initiate, train, and test three parts