犯错

数据挖掘是信息产业界近年来非常热门的研究方向，聚类分析是数据挖掘中的核心技术。本文对数据挖掘领域的聚类分析方法及代表算法进行分析，并从多个方面对这些算法性能进行比较，同时还对聚类分析在数据挖掘中的几个应用进行了阐述。-Data Mining is the IT industry is very popular in recent years the direction of the research, cluster analysis is data mining in the core technology. In this paper, the field of data mining methods and the representative of cluster analysis algorithm analysis, and from several aspects of these algorithms to compare the performance, but also on the cluster analysis of data mining in several applications are described.

Individual files are available in the following links: Bessjy -- Bessel functions Jn and Yn for real argument and integer or real order. Bessik -- Modified Bessel function In and Kn for real argument and integer or real order. CBessjy -- Bessel functions Jv and Yv for real or complex arguments and real order. CBessik -- Modified Bessel functions Iv and Kv for complex arguments and real order. -Individual files are available in the following links: Bessjy- Bessel functions Jn and Yn for real argument and integer or real order. Bessik- Modified Bessel function In and Kn for real argument and integer or real order. CBessjy- Bessel functions Jv and Yv for real or complex arguments and real order. CBessik- Modified Bessel functions Iv and Kv for complex arguments and real order.

vs.lib is a math library in C++ with a set of linear algebra and integrable / differentiable objects. vs.lib is a rapid-proto-typing tool which makes programming in numerical applications as easy as writing mathematical expressions.-vs.lib is a math library in C++ with a set of linear algebra and integrable/differentiable objects. vs.lib is a rapid-proto-typing tool which makes programming in numerical applications as easy as writing mathematical expressions.

fft.c code composer studio v 3.01 by steven

用C++语言实现神经网络的BP算法，对于从事神经网络及专家诊断系统的方面的朋友具有较强的参考借鉴意义。

学习VC的时候写的，求解有向图的最大流和最小截集。-learning to write when the solution is to map the maximum flow and minimum cut-set.

曲线拟合的好例子，推荐，我还没有测试过-A good example of curve fitting is recommended, I have not tested

基本算法为：先将1填入第一行中间位置；再依次将2-n方按如下规律填写：//1，填入上个数上一行的右边位置，如果没有上一行则转到最后一行，如果右边没有方格//则转到最左边的方格。2，如果要填的位置上已经有数，则转填到它上一个数的下边方格//3，对于第一行的最后一个数的下一个数应填在该数下边的空格处-basic algorithm : a first Enter the middle of the first line; Another will be followed by 2-n-law filled out as follows :// 1, the number entered on the right side on his position, if not in his will to the last line, if not right box// then transferred to the most left while the box. 2, to fill the position of several, in turn, to fill it on a number of subordinate box// 3, the first trip to the final a few under a few should fill in the blank space of a few top candidate Department

随机算法的c++源代码，程序结构清晰，便于理解-Stochastic Programming

这是一个线性判别算法的matlab 代码，里面有详细讲解的pdf文件，并且程序有具体实例的运行结果，很好理解哦