-
romberg_integration
Romberg integration algorithm: a method for integrating mathematic functions, in MATLAB.
- 2009-05-22 04:14:38下载
- 积分:1
-
shiyu
振动信号时域处理办法,包括低通、带通滤波和频域积分法(Time-domain vibration signal processing options, including low-pass, band-pass filtering and frequency-domain integral method)
- 2010-02-02 14:47:51下载
- 积分:1
-
chafen
MATLAB,用的是背景差分和实时背景更新(MATLAB, using background subtraction and real-time background update)
- 2015-03-17 16:25:59下载
- 积分:1
-
gas
用if else 语句编写的利用白化权函数计算变压器油中气体故障依据(Prepared with the if else statement using whitening weight function calculation based on transformer oil fault gases)
- 2010-09-21 15:29:01下载
- 积分:1
-
New-folder-(2)
record program to record sound in matlab
- 2014-09-01 23:10:52下载
- 积分:1
-
libsvm-predict
一个预测程序,用于SVM预测的,大家可以学习(it is a predict)
- 2016-11-20 15:47:15下载
- 积分:1
-
MATLAB_Graphics__Drawing_and_GUI
说明: 《MATLAB图形技术——绘图及图形用户接口》西北工业大学出版社,1999年版,周明等编著。介绍了matlab绘图方法和图形对象的特性及图形用户接口的设计技术。(MATLAB graphics- drawing and graphical user interface, Northwest Industry University Press, 1999 edition, Zhou Ming, eds. Introduced matlab drawing method and graphic object properties and the graphical user interface design.)
- 2010-04-19 16:35:31下载
- 积分:1
-
symmetricbandedCG
Conjugate gradient method
- 2011-06-05 01:50:48下载
- 积分:1
-
chap5
在网上找到的代码 在网上那个找到的系统辨识与自适应控制程序 大家分享(Online to find the code online that found in the system identification and adaptive control procedures to share)
- 2012-08-13 11:16:56下载
- 积分:1
-
NewK-means-clustering-algorithm
说明: 珍藏版,可实现,新K均值聚类算法,分为如下几个步骤:
一、初始化聚类中心
1、根据具体问题,凭经验从样本集中选出C个比较合适的样本作为初始聚类中心。
2、用前C个样本作为初始聚类中心。
3、将全部样本随机地分成C类,计算每类的样本均值,将样本均值作为初始聚类中心。
二、初始聚类
1、按就近原则将样本归入各聚类中心所代表的类中。
2、取一样本,将其归入与其最近的聚类中心的那一类中,重新计算样本均值,更新聚类中心。然后取下一样本,重复操作,直至所有样本归入相应类中。
三、判断聚类是否合理
采用误差平方和准则函数判断聚类是否合理,不合理则修改分类。循环进行判断、修改直至达到算法终止条件。(NewK-means clustering algorithm ,Divided into the following several steps:
A, initialize clustering center
1, according to the specific problems, from samples with experience selected C a more appropriate focus the sample as the initial clustering center.
2, with former C a sample as the initial clustering center.
3, will all samples randomly divided into C, calculate the sample mean, each the sample mean as the initial clustering center.
Second, initial clustering
1, according to the sample into the nearest principle clustering center represents the class.
2, as this, take the its recent as clustering center of that category, recount the sample mean, update clustering center. And then taking off, as this, repeated operation until all samples into the corresponding class.
Three, judge clustering is reasonable
Adopt error squares principles function cluster analysis.after clustering whether reasonable, no reasonable criterion revisio)
- 2011-04-06 20:45:56下载
- 积分:1