-
kmeans
K-means is a clustering algorithm
In the beginning we determine number of cluster K and we assume the centroid or center of these clusters. We can take any random objects as the initial centroids or the first K objects in sequence can also serve as the initial centroids.
There are two function for that the kMeanCluster and distMatrix
- 2010-03-10 13:41:13下载
- 积分:1
-
PID-controler.-matlab-code
PID controler/ matlab code
- 2012-05-16 00:28:06下载
- 积分:1
-
experiment_02
数字信号处理实验内容,编写能够实现fft的matlab程序,并与系统自带的fft相比较。在文件mysecond.m中注释部分给出多种fft实现方法及代码,未拆分成多个m文件(Digital signal processing experiment content, the preparation can be achieved fft matlab program, and compared with the system comes with the fft. The comment section file mysecond.m give multiple fft to achieve method and code into multiple m 未拆)
- 2013-02-04 13:17:00下载
- 积分:1
-
BuckConverter
Buck变换器的Matlab/Simulink仿真(Matlab/Simulink model for Buck DC-DC converter)
- 2012-07-31 17:12:34下载
- 积分:1
-
tsp_dp1
traveler sale person in dynamic programming
- 2011-10-24 03:59:34下载
- 积分:1
-
kmeans-plusPlus
K-means++算法实现,加强了初始聚类点的选取(careful seeding)(K-means++ algorithm to enhance the selection of the initial clustering points (careful seeding))
- 2010-10-07 11:05:53下载
- 积分:1
-
adaptive TVMM demo
说明: mahdi bela mahdi mah
- 2019-06-23 19:16:52下载
- 积分:1
-
ACO-TSP
利用蚁群算法解决旅行商问题,其中运用智能蚂蚁算法(Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem)
- 2009-04-09 09:34:09下载
- 积分:1
-
Jacobi
Jacobi矩阵一般是坐标变换时用的——这个坐标系的坐标依次对那个坐标系的坐标求偏导数即得Jacobi矩阵。积分时从直角坐标变到球坐标、极坐标肯定要在积分号里乘上Jacobi矩阵的行列式。
若其特征值全为正,则此Jacobi矩阵正定,即它的任何二次型都大于零。并且如果是对称Jacobi矩阵,还可以实相合于一个单位阵。是比较强的条件。矩阵A的特征值是这个关于x的方程的所有根
det(A-xI)=0(Jacobi)
- 2010-12-20 23:19:38下载
- 积分:1
-
Lyapunov
绘制混沌的李雅普诺夫曲线图,非常有用,可以下载,附混沌图程序(Chaos Lyapunov curve drawing, very useful, you can download, with a chaotic map program)
- 2020-07-01 09:20:07下载
- 积分:1