-
一个比较好用的中文分词模块,是车东等人开发的,比较有名,java语言实现...
一个比较好用的中文分词模块,是车东等人开发的,比较有名,java语言实现-a better quality of the Chinese word module, East cars were developed, more famous, java language!
- 2022-03-10 03:53:00下载
- 积分:1
-
经典的SOM人工神经网络例子源码,经测试可用,可作入门学习用...
经典的SOM人工神经网络例子源码,经测试可用,可作入门学习用-SOM classic examples of artificial neural network source code
- 2022-02-13 09:37:43下载
- 积分:1
-
数据挖掘中频繁项集挖掘算法,改进了apriori算法,性能提高很多...
数据挖掘中频繁项集挖掘算法,改进了apriori算法,性能提高很多-Data Mining frequent itemsets mining algorithm, improved apriori algorithm, improve the performance of many
- 2022-09-24 13:50:02下载
- 积分:1
-
基于遗传算法的排课系统,可以实现多种课程的排列
基于遗传算法的排课系统,可以实现多种课程的排列-based on genetic algorithm Course Scheduling System, can achieve a wide variety of courses with the
- 2023-01-28 02:55:03下载
- 积分:1
-
这是一本详细介绍遗传算法理论,及其在工程方面应用的书籍,书中包含许多实例,实在是不可多得的经典之书...
这是一本详细介绍遗传算法理论,及其在工程方面应用的书籍,书中包含许多实例,实在是不可多得的经典之书-This is a detailed theory of genetic algorithm and its applications in engineering books, the book contains many examples, it is rare classic book
- 2022-08-17 20:12:47下载
- 积分:1
-
人工智能之八数码难题程序
人工智能之八数码难题程序-8 digital artificial intelligence problems procedures
- 2022-03-13 08:31:55下载
- 积分:1
-
CPN算法的matlab实现,CPN人工神经网络
CPN算法的matlab实现,CPN人工神经网络-Matlab algorithm of network,The artificial neural network, network
- 2022-05-21 00:01:13下载
- 积分:1
-
介绍了神经 网络中的BPN算法的C语言实现.
介绍了神经 网络中的BPN算法的C语言实现.-Introduce a neural network BPN algorithm C language.
- 2022-08-07 15:15:25下载
- 积分:1
-
程序用C语言实现了贝叶斯在数据挖掘中分类和预测中的应用,通过程序可以很好的进行分类和预测。...
程序用C语言实现了贝叶斯在数据挖掘中分类和预测中的应用,通过程序可以很好的进行分类和预测。-This program use C language to realize the application of bayes in data mining and forecasting,you can use this program to make a good classification and forecasting
- 2022-03-12 15:16:54下载
- 积分: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