登录
首页 » matlab » LMS111

LMS111

于 2009-02-27 发布 文件大小:25KB
0 260
下载积分: 1 下载次数: 56

代码说明:

  应用LMS算法,用Matlab编程实现线性预测.(Application of LMS algorithm, using Matlab Programming Linear Prediction.)

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

发表评论

0 个回复

  • Kmean
    K-means Fuzzy Clustering file
    2009-10-15 16:03:17下载
    积分:1
  • ExploratoryDataAnalysiswithMATLAB
    用MATLAB进行探索数据分析,理论和应用同时介绍,并在书中列出不少MATLAB实现的例子(Exploratory Data Analysis with MATLAB, introduce exploratory data analysis methods and algorithms)
    2010-03-11 12:56:57下载
    积分:1
  • strong-tracking-filter
    清华大学周东华教授提出的强跟踪滤波器,有效改善突发干扰下的跟踪能力。(Strong tracking filter supposed by Pro. ZHOU Dong-hua, which enhanced the tracking ability during sudden disturb.)
    2020-12-11 11:39:19下载
    积分:1
  • sinusMatlab
    the graphs where you can find how the function looks like - sinus
    2013-11-30 17:37:59下载
    积分:1
  • ANN-lab
    Artificial Neural Networks Exercise in Matlab
    2015-12-08 23:31:51下载
    积分:1
  • linear-category
    本程序主要是对线性判别函数分类器进行实现。(Linear discriminant function classifier achieved.)
    2010-07-21 15:48:05下载
    积分:1
  • 1094
    Continuous Ant Colony Optimization
    2014-10-31 23:42:06下载
    积分:1
  • baoganghoubanchang
    宝钢厚板厂物流分流技术,分流清晰,有仿真,可以借鉴。(park transfer model,universial)
    2011-12-14 16:15:15下载
    积分:1
  • K-meanCluster
    How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments. (How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.)
    2007-11-15 01:49:03下载
    积分:1
  • kmean
    k mean clustering in matlab
    2010-01-19 18:07:09下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载