-
Cluster
使用分解聚类算法在IRIS数据上进行聚类分析，IRIS数据是由鸢尾属植物的三种单独的花的测量结果所组成，模式类别数为3，特征维数是4，每类各有50个模式样本，总共有150个样本。(The use of decomposition in the IRIS data clustering algorithm on the cluster analysis, IRIS data are from the iris flower three separate components of the measurement results, models for category 3, 4 are characteristic dimension, of each type of each 50 model samples, a total of 150 samples.)
- 2009-03-07 20:09:21下载
- 积分：1
-
PsoConstrained_ELD
粒子群负荷分配粒子群负荷分配粒子群负荷分配粒子群负荷分配粒子群负荷分配粒子群负荷分配粒子群负荷分配粒子群负荷分配粒子群负荷分配粒子群负荷分配(PSO load distribution load distribution particle swarm particle swarm particle swarm load distribution load distribution load distribution particle swarm particle swarm particle swarm load distribution load distribution load distribution particle swarm particle swarm particle swarm load distribution load distribution)
- 2011-07-20 21:22:35下载
- 积分：1
-
34
说明： This is a matlab code and is a beneficial source code
- 2014-12-28 09:51:33下载
- 积分：1
-
4
说明： 用matlab实现的贝叶斯分类，对x进行了分类，其中可以自行的输入x看分类是否正确(with the matlab implemented Bayesian classification, a classification of x, which can see their own classification of the input x is correct or not)
- 2010-12-14 19:22:23下载
- 积分：1
-
9cengfenjie
说明： 小波分解的代码，并且计算出准周期，是一个入门级别的代码，仅供参考。(Wavelet decomposition of the code, and calculate the quasi-periodic, is an entry-level code, for reference purposes only.)
- 2008-09-25 16:34:12下载
- 积分：1
-
effet_raman
resolution de l equation NLSE avec l efet de Raman
- 2013-11-13 21:56:52下载
- 积分：1
-
13
说明： 探索分形奥秘,自然界与分形的关系，分形的由来(Explore the mysteries of fractal, the fractal nature and the relationship between the origin of fractal)
- 2010-12-15 16:36:26下载
- 积分：1
-
rl
说明： 瑞利随机数的生成，通过两个同方差的正态分布而求得，并求出其PDF和CDF(Rayleigh random numbers generated by two normal distribution with variance that obtained and solved its PDF and CDF)
- 2010-05-17 13:27:42下载
- 积分：1
-
Mathematics
本书描述了matlab的一些使用方法和对一些算法的简要介绍(This book describes some use matlab and a brief description of some algorithms)
- 2011-08-15 09:39:31下载
- 积分：1
-
Centrality-measures
文件包括：1.计算平均最短路径；2.计算每个顶点相邻节点的平均度；3.计算每个节点的邻近中心度；4.计算节点的介数（slow）；5.计算节点的介数（faster）；6.计算每条边的介数值；7.快速迪杰斯特拉算法；8.经典迪杰斯特拉算法。(1.the average shortest path in the graph 2.the average degree of neighboring nodes for every vertex 3.computes the closeness centrality for all vertices 4.node betweenness, (number of shortest paths definition) 5.a faster node betweenness algorithm 6.edge betweenness, (number of shortest paths definition) 7.simple Dijkstra, does not remember the path 8.Dijkstra which also returns the shortest paths.)
- 2021-04-23 19:38:47下载
- 积分：1
