-
Run
Simulation of simple Delay and sum beamforming with shading and everything controllable
- 2011-01-05 13:40:18下载
- 积分：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
-
M
字典树的基本功能是用来查询某个单词（前缀）在所有单词中出现次数的一种数据结构，它的插入和查询复杂度都为O(len),Len为单词（前缀）长度，但是它的空间复杂度却非常高，如果字符集是26个字母，那每个节点的度就有26个，典型的以空间换时间结构。(The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the words, which insertion and query complexity are O (len), Len is a word (prefix) length, but its space complexity is very high, if the character set is 26 letters, and that the degree of each node will have 26, the typical structure of space for time.)
- 2013-11-29 14:28:52下载
- 积分：1
-
Lagrang
数值分析中的Lagrang插值算法，用于曲线拟合的方法。(Lagrang interpolation)
- 2010-06-11 23:28:25下载
- 积分：1
-
feature_extraction
2DLDA PK LDA for feature extraction
- 2009-07-08 14:05:57下载
- 积分：1
-
[2.40]
电子工业出版社 《数字信号处理》第2版课后题MATLAB 2-40题(Electronic Industry Press Digital Signal Processing 2nd edition title after title MATLAB 2-40)
- 2014-12-08 17:06:19下载
- 积分：1
-
rcs
实现两个确定平面夹角的最佳衍射的角度确定(Determination of the optimum diffraction angle for two angles of plane determination)
- 2017-10-16 12:08:32下载
- 积分：1
-
GA_JSP
遗传算法解决jsp问题的matlab代码，输出种群内适应度均值和最优值图像，输出甘特图(Jsp genetic algorithm to solve the problem matlab code output within the population mean fitness and the best value of the image output Gantt)
- 2016-05-10 21:40:09下载
- 积分：1
-
kel14_ev1
In linguistic morphology, stemming is the process for reducing inflected (or sometimes derived) words to their stem, base or root form – generally a written word form. The stem need not be identical to the morphological root of the word it is usually sufficient that related words map to the same stem, even if this stem is not in itself a valid root. The algorithm has been a long-standing problem in computer science.
- 2009-11-18 01:26:21下载
- 积分：1
-
revideoadaptationforsmalldisplaybasedoncontentrec
new video adaption technique
- 2010-01-30 00:07:01下载
- 积分：1
