登录
首页 » matlab » PCA

PCA

于 2010-04-16 发布 文件大小:1KB
0 307
下载积分: 1 下载次数: 0

代码说明:

说明:  一个关于主成分分析的matlab演示,十分有用(A principal component analysis on matlab demo, very useful)

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

发表评论

0 个回复

  • shujufenxi
    某统计局欲了解第三产业总产出、中间消耗、增加值、劳动者报酬、生产税净额、固定资产折旧、营业盈余之间的关系,根据下面给出的数据建立相应的模型并进行分析,同时又因为变量数目过多影响对其的综合分析,要求对他们进行主成分分析;(Bureau of Statistics For a third of total industrial output, intermediate consumption, value added, workers compensation, production, net of tax, depreciation of fixed assets, the relationship between the operating surplus, in accordance with the following data given by the model and the corresponding analysis, at the same time, because too many variables affect the number of comprehensive analysis of its request for them to carry out principal component analysis )
    2009-06-21 15:32:44下载
    积分:1
  • makePly
    Writes a mesh to a ply file (text format) wich can be read by PlyView from Cyberware and Scanalyze from Stanford University. Both are available for free
    2012-04-28 02:42:12下载
    积分:1
  • phase_shift_deadtime
    phase_shift_deadtime.rar,功率电子领域matlab仿真文件,已经验证过,程序运行正常(phase_shift_deadtime.rar,Power electronics field matlab simulation file, has already been verified, the normal operating procedures)
    2013-08-26 22:36:08下载
    积分:1
  • Web-Hotel
    Web Hotel Using Solaris Containers
    2014-01-15 16:14:06下载
    积分:1
  • Clustering_Coefficient
    根据邻接矩阵计算网络的聚类系数。输入为邻接矩阵输出为整个网络的聚类系数(cluster coefficient)
    2021-04-19 15:18:51下载
    积分:1
  • de2_clock
    matlab source code for speaker recogntion
    2010-12-01 00:52:47下载
    积分:1
  • maxcost
    “基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法,其基本思路为:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条自V1至Vn的最短路;再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流量增至最大可能值;而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新确定,如此多次迭代,最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
    2010-12-22 17:27:32下载
    积分:1
  • Dcttransformdigitalimagewatermarigalgorithm
    基于dct变换的数字图像水印算法研究,系统研究分 析了经典的DCT变换域的数字水印算法 (Dct transform based digital image watermarking algorithm, the system analysis of the classical DCT transform domain watermarking algorithm)
    2010-05-24 21:24:43下载
    积分:1
  • project-no.1
    solving some example s about fuzzy logic by matlab. created code by amin zafarian postgraduate of electeronic
    2011-06-23 16:06:21下载
    积分:1
  • LCD
    Solar Charge Controller
    2013-08-01 05:50:24下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载