-
基于熵函数的语音端点检测方法.rar格式为vip
基于熵函数的语音端点检测方法.rar格式为vip-voice endpoint detection methods. Rar format vip
- 2023-04-29 16:20:03下载
- 积分:1
-
basic framework BP neural network, suitable for beginners to grasp the compositi...
基本的BP神经网络框架,比较适用于初学者快速掌握神经网络的构成。-basic framework BP neural network, suitable for beginners to grasp the composition of neural networks.
- 2022-01-26 07:28:38下载
- 积分:1
-
关联规则中的频繁项集生成算法genmax,可在linux和windows下编译运行,可能不太容易看懂。...
关联规则中的频繁项集生成算法genmax,可在linux和windows下编译运行,可能不太容易看懂。-association rules of frequent item sets genmax generation algorithm, and the Linux compiler running under windows, it may not be easy to understand.
- 2022-01-25 17:12:14下载
- 积分:1
-
聚类分析简介,是个课件,希望对大家有帮助。
聚类分析简介,是个课件,希望对大家有帮助。-Introduction Cluster analysis is a courseware, we want to help.
- 2022-02-16 03:42:06下载
- 积分:1
-
SVM是一种优秀的分类算法,常用于用于回归分析和分类,而matlab语言的libSVM则为广大使用matlab进行设计的人员提供很好的帮助。...
SVM是一种优秀的分类算法,常用于用于回归分析和分类,而matlab语言的libSVM则为广大使用matlab进行设计的人员提供很好的帮助。-libSVM for regression classification
- 2022-08-07 04:28:38下载
- 积分:1
-
用C++语言开发的神经网络,很好用的。
使用C语言实现神经网络算法,针对BP神经网络的特点进行设计和开发,具有比较好的性能-use c language to develop neural network,good to use.
- 2022-07-11 03:48:03下载
- 积分:1
-
RBF实现神经网络预测程序,压缩包,不用解压缩密码!
RBF实现神经网络预测程序,压缩包,不用解压缩密码!-Realize RBF neural network prediction program, compressed packet, do not extract the password!
- 2023-09-02 20:10:03下载
- 积分:1
-
该进化算法的实现基于VC++6.0的开发平台,主要是用算子改进进化策略算法。...
该进化算法的实现基于VC++6.0的开发平台,主要是用算子改进进化策略算法。-The evolutionary algorithm based on VC++ 6.0 development platform, the main operator is used to improve the evolutionary strategy algorithm.
- 2022-11-05 07:20:03下载
- 积分:1
-
AIML的实现,AIML是机器人语言中比较适用的原型,希望大家喜欢...
AIML的实现,AIML是机器人语言中比较适用的原型,希望大家喜欢-AIML realization, AIML robot language is more applicable to the prototype, I hope everyone likes
- 2022-03-10 20:05:50下载
- 积分: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