登录
首页 » matlab » svrmain

svrmain

于 2021-03-28 发布
0 191
下载积分: 1 下载次数: 1

代码说明:

说明:  svm预测教程,适合新手学习,2020版本(The SVM prediction tutorial, suitable for beginners learning, 2020 edition)

文件列表:

svrmain.m, 4859 , 2021-03-27

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论


0 个回复

  • signal
    此代码描述的是正弦函数的频谱图,其采样点不同,频谱图的差别(This code is a sine function described in the frequency spectrum, the sampling point is different from the difference spectrum)
    2007-10-31 10:55:53下载
    积分:1
  • Matlabsahiyongbaili
    matlab经典算法,大家有时间可以看看!! 自己也没时间看!(matlab classic algorithms, everyone has time to look at! ! Themselves did not have time to read!)
    2008-04-09 19:58:08下载
    积分:1
  • GetTRDoc
    mrca adaptive control
    2012-01-24 20:15:36下载
    积分:1
  • HTI-THOMSEN
    HTI介质模型THOMSEN参数计算,标注有明确的注释。(HTI medium model THOMSEN parameter calculation, marked with a clear note.)
    2016-03-09 14:35:28下载
    积分:1
  • baohedu
    专门用于石油工程中饱和度-单轴抗压强度曲线逼近作图,效果很好(Dedicated to petroleum engineering saturation- uniaxial compressive strength curve approximation mapping, good results)
    2010-05-06 15:02:01下载
    积分:1
  • matlab-Kmeans
    利用matlab实现kmeans聚类算法的简单实现代码(matlab kmens algrithom )
    2012-03-26 08:59:53下载
    积分:1
  • LT_matlab
    lt码的MATLAB实现,程序绝对正确,并且非常完善(lt code MATLAB implemention,program is absolutely correct and very well.)
    2021-04-11 16:38:57下载
    积分:1
  • PCA
    This function calculates the RND from a cross-section of put prices using the PCA method as described in O. Bondarenko. ``Recovering Risk-Neutral Densities: A New Nonparametric Approach, UIC working paper, September 2000. (This function calculates the RND from a cross-section of put prices using the PCA method as described in O. Bondarenko. ``Recovering Risk-Neutral Densities: A New Nonparametric Approach, UIC working paper, September 2000. )
    2010-05-19 03:53:59下载
    积分:1
  • FastICA_2.5
    独立成分分析方法Matlab实现的代码 以得出独立成分(Independent component analysis Matlab code implemented to derive independent component)
    2014-08-21 19:31:31下载
    积分:1
  • mincut
    An implementation of "A min cut algorithm" by Stoer and Wagner. In addition there is an option to find the minimal cut that does not separate a set of vertices. This is not a mincut-maxflow algorithm.
    2012-08-06 17:57:31下载
    积分:1
  • 696518资源总数
  • 104830会员总数
  • 42今日下载