-
BP神经网络的C语言实现 BP神经网络解决异或问题 canny源代码 HMM的C语言实现 isodata K...
BP神经网络的C语言实现 BP神经网络解决异或问题 canny源代码 HMM的C语言实现 isodata K-MEANS 车牌识别系统 矢量量化的C语言实现 -Neural Network C language BP neural network solution differences or problems canny source HMM C language isodata K-MEANS License Plate Recognition System Vector Quantization C Language
- 2022-07-14 13:33:47下载
- 积分:1
-
微软嗯
微软的基于HMM的人脸识别原代码, 非常经典的说-Microsoft HMM-based Face Recognition source, said the very classic
- 2022-03-23 00:16:28下载
- 积分:1
-
Mitchell's "machine learning> With the source book, very good
Mitchell的《机器学习〉随书源码,非常不错-Mitchell"s "machine learning> With the source book, very good
- 2022-05-08 07:35:42下载
- 积分:1
-
该程序是遗传算法的具体实现,通过该程序可以对遗传算法有更深入的了解。...
该程序是遗传算法的具体实现,通过该程序可以对遗传算法有更深入的了解。-The program is a concrete realization of genetic algorithm, through which the genetic algorithm program can have a deeper understanding.
- 2023-05-17 11:15:03下载
- 积分:1
-
- 2022-05-27 19:09:11下载
- 积分:1
-
Statistical learning theory is based on a more solid theoretical basis, in order...
统计学习理论是建立在一套较坚实的理论基础之上的,为解决有限样本学习问题提供了
一个统一的框架。它能将很多现有方法纳入其中,有望帮助解决许多原来难以解决的问题(比
如神经网络结构及参数选择问题);同时。在这一理论基础上发展了一种新的通用学习方法:
支持向量机(Support Vector Machine,SVM)。它己表现出很多优秀的性能,并已经成为当
今机器学习领域的研究热点。-Statistical learning theory is based on a more solid theoretical basis, in order to solve the learning problems of limited samples provides a unified framework. It will be incorporated into many existing methods, which could help solve many of the original difficult to resolve problems (such as neural network structure and parameters selection) the same time. Developed on the basis of this theory, a new universal learning methods: support vector machine (Support Vector Machine, SVM). It has been shown a lot of excellent performance and has become the hotspot of machine learning research in the field.
- 2022-03-02 21:50:04下载
- 积分:1
-
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.
- 2022-01-28 00:58:44下载
- 积分:1
-
有关优化的遗传算法
有关优化的遗传算法-the genetic algorithm optimization
- 2022-03-14 03:01:56下载
- 积分:1
-
用遗传算法进行排序
用遗传算法进行排序-genetic sequencing algorithms
- 2022-08-23 04:43:59下载
- 积分:1
-
人脸识别:利用奇异值分解和KL变换的投影,是很有价值的一篇文章...
人脸识别:利用奇异值分解和KL变换的投影,是很有价值的一篇文章-Face Recognition : The Singular Value Decomposition and KL transform projection, it is valuable to an article
- 2022-02-13 20:51:35下载
- 积分:1