-
ct
说明: n mathematics, a wavelet series is a representation of a square-integrable (real- or complex-valued) function by a certain orthonormal series generated by a wavelet. Nowadays, wavelet transformation is one of the most popular candidates of the time-frequency-transformations. This article provides a formal, mathematical definition of an orthonormal wavelet and of the integral wavelet transform
- 2014-02-25 16:46:02下载
- 积分:1
-
MATLAB_Programming_book_ppt
很好的matlab 教學電子檔,教導如何寫作matlab程式
此為ppt檔,分為20個章節(E-file matlab good teaching, teaching how to write this as a ppt file matlab program, divided into 20 chapters)
- 2010-11-22 18:18:55下载
- 积分:1
-
DS_SS
It will ask for input the bit stream then generate pseudorandom bit sequence, finally give output as direct sequence spread spectrum
- 2011-05-13 15:25:58下载
- 积分:1
-
lab7_Symbol_Timing_Synchronization
The Simulation Symbol Timing Synchronization using Matlab(The Simulation Symbol Timing Synchroniza tion using Matlab)
- 2007-03-03 17:49:48下载
- 积分:1
-
matlabaexcel
利用matlab将excel文件中的数据导入或导出,介绍相应函数的用法(Using matlab to excel file import or export data to introduce the usage of the corresponding function)
- 2011-08-05 16:25:33下载
- 积分:1
-
wavelet_pspace
Matlab_show wavelet and p_space calculation
- 2013-03-11 11:39:19下载
- 积分:1
-
afsa
由国内李晓磊博士提出的优化算法,具有跳出极值的优良特性。(an algorithm proposed by doctor Li Xiao Lei)
- 2010-12-14 11:36:45下载
- 积分:1
-
createTable
create table with java and gui matlab implementation
- 2013-02-23 21:47:13下载
- 积分:1
-
matlab-and-simulink
综合了matlab和simulink使用的方法和注意事项,一些文献的集合(Matlab and simulink combination of the methods used and precautions, a collection of some of the literature)
- 2011-01-23 10:44:06下载
- 积分: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