Libsvm

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.

网上的大部分BP实现曲线拟合都使用MATLAB库函数，这不利于读者理解BP神经网络的算法。本文用C源码实现MATLAB库函数.-BP to achieve most of the Internet curve fitting using MATLAB library function, this does not help readers understand the BP neural network algorithm. In this paper, the realization of C-source MATLAB library functions.

机器学习讲义机器学习很好的材料内容很全面-Machine Learning Machine Learning Materials Materials is very good all-round

人工智能运用广度优先算法来解决八数码问题,由初始状态到目标状态按层搜索-breadth priority use of artificial intelligence algorithms to solve eight digital issue, the initial state to the target state by layer Search

使用模拟退火思想解决图着色（GCP）问题，使用先看说明文件-??用??拟退 火??想 ???鐾 ??派???GCP ??问题 ????用先 ?

该算法采用另外一种策略，结合进化策略和遗传算法，达到优化的目地-The algorithm uses a different strategy, combining evolutionary strategy and genetic algorithm to optimize the purpose

遗传算法和模拟退火算法相结合的并行实现-genetic algorithms and simulated annealing algorithm combining the parallel implementation

一个径向网络算法程序!-a radial network algorithm!

遗传算法的讲义！- Heredity algorithm printed lecture!

S-ISOMAP is a manifold learning algorithm, which is a supervised variant of ISOMAP.