-
fwdproj
An Algorithm for defining hand gestures
- 2013-03-25 13:57:15下载
- 积分:1
-
震合成记录的正演模拟程序
本程序是地震合成记录的正演模拟程序,包括实现三层地质模型(This program is being synthetic seismograms modeling program, including the realization of three geological model)
- 2014-12-22 10:53:14下载
- 积分:1
-
Prediction
混沌时间序列预测神经网络一步预测神经网络多步预测(chaotic time series predictionMain_RBF_MultiStepPred.m)
- 2013-11-26 16:30:22下载
- 积分:1
-
VCA_compress
高光谱图像的顶点成分分析,在没有先验知识背景下,提取图像中的端元(Hyperspectral Image vertex component analysis, in the absence of a priori knowledge of background, the extracted image Endmember)
- 2008-06-13 13:26:12下载
- 积分:1
-
jisuanqi
说明: 具有加、减、乘、除、sin、cos、ln、log等功能的计算器界面(With addition, subtraction, multiplication, division, sin, cos, ln, log and other functions of the calculator interface)
- 2011-04-07 22:20:26下载
- 积分:1
-
nonlineareq
function g=nonlineareq(x)
Here is an example of nonlinear system that can be solved by using
the Matlab command "fsolve" written in the file called "solution.m"
(see quasi-Newton or Levenberg-Marquardt methods).
g(1)=x(1)-4*x(1)*x(1)-x(1)*x(2)
g(2)=2*x(2)-x(2)*x(2)+3*x(1)*x(2)
- 2012-03-27 03:28:25下载
- 积分:1
-
25811214svm_v251
LibSVM工具箱,在matlab环境下实现,完整的与VC接口!更多访问个人主页:http://huangbo929.blog.edu.cn(LibSVM toolbox in Matlab environment achieved, and the integrity of the VC interface! More personal visit Home : http://huangbo929.blog.edu.cn)
- 2007-04-27 13:03:44下载
- 积分:1
-
hw3
pattern classification homework 3
- 2010-02-09 08:06:55下载
- 积分:1
-
huishe
灰色预测,用于短期预测,所需数据少,实用,简单(Grey Forecasting)
- 2013-01-20 23:46:27下载
- 积分: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