-
speech_mfcc
Speech melbank,energy sectrum,Computes and returns the mfcc coefficients for a speech signal
- 2009-03-21 06:08:27下载
- 积分:1
-
New-folder-(2)
computation TEC for ARECIBO
cc to drew L
- 2014-10-23 02:07:42下载
- 积分:1
-
ASM_wirecoupling
simulation in adaptive antenna
- 2010-06-17 00:50:01下载
- 积分:1
-
v2
长春应用化学研究所,嵌段共聚物,高分子,物理学(Changchun Institute of Applied Chemistry,Block copolymers,Macromolecule,physics)
- 2013-12-15 21:40:37下载
- 积分:1
-
CIC
matlab实现一个decimation为4的CIC滤波器(matlab implementation of a decimation filter for 4 of the CIC)
- 2009-03-25 09:59:28下载
- 积分:1
-
Load-frequency-control
control of frequency of load in matlab simulations
- 2013-09-08 15:35:22下载
- 积分:1
-
AFSA-CS-MP
严格按书上传统原子库的MP稀疏分解~~~~~~~~~~~~(In strict accordance with the traditional book MP sparse decomposition atomic library)
- 2013-12-28 10:33:15下载
- 积分:1
-
polarPlot
plotting pixels of images
- 2014-02-16 03:19:45下载
- 积分:1
-
Func_SphericalImage.m
projection du plan image à la sphère
- 2013-11-05 21:41:48下载
- 积分:1
-
knn1
K最邻近密度估计技术是一种分类方法,不是聚类方法。
不是最优方法,实践中比较流行。
通俗但不一定易懂的规则是:
1.计算待分类数据和不同类中每一个数据的距离(欧氏或马氏)。
2.选出最小的前K数据个距离,这里用到选择排序法。
3.对比这前K个距离,找出K个数据中包含最多的是那个类的数据,即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method.
It is not the best method, but it is popular in practice.
Popular but not necessarily understandable rule is:
1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov).
2. select the minimum distance from the previous K data, where the choice sorting method is used.
3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)
- 2017-08-09 21:06:38下载
- 积分:1