登录
首页 » matlab » lstm

lstm

于 2021-01-05 发布 文件大小:3KB
0 1976
下载积分: 1 下载次数: 60

代码说明:

  lstm比较火热,matlab2018B已经有相应的工具箱。(LSTM is relatively hot, matlab2018B already has the corresponding toolbox.)

文件列表:

lstm, 0 , 2017-04-08
lstm\LSTM_data_process.m, 1301 , 2017-04-08
lstm\LSTM_mian.m, 6052 , 2017-04-08
lstm\LSTM_updata_weight.m, 4542 , 2017-04-08

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

发表评论

0 个回复

  • Spark机器学习源码
    说明:  Spark 机器学习代码,有大量机器学习算法实例。(Spark machine learning code, there are a large number of machine learning algorithm examples.)
    2020-09-27 16:39:19下载
    积分:1
  • 多尺度小波分析 wave
    说明:  多尺度小波分析,用于分析时间多尺度周期。包括相应小波包及代码,可作全谱图,方差图,功率谱,全局谱,并附带相关置信区间(Multiscale wavelet analysis is used to analyze time multiscale period. Including the corresponding wavelet packet and code, it can make full spectrum, variance, power spectrum, global spectrum, with relevant confidence interval)
    2020-05-23 11:58:14下载
    积分:1
  • reatize
    An article about how in matlab of pso algorithm in the paper, so as to realize optimization to solve,,
    2017-05-13 03:55:42下载
    积分:1
  • asian
    运用二叉树对欧式看涨亚式期权的定价,详细说明(Use binary European call for Asian options pricing)
    2020-07-01 13:40:02下载
    积分:1
  • beibao
    背包问题,可以解决最短路径问题,或优化问题(Knapsack problem, the shortest path problem can be solved, or optimization problems)
    2011-11-25 12:16:03下载
    积分:1
  • bp用于故障实例
    详细介绍在matlab中怎么样设计bp神经网络的故障诊断(Detailed description of how to design gui interface in MATLAB?)
    2021-01-29 22:58:36下载
    积分:1
  • 1
    说明:  深入理解Spark核心技术书籍,书籍对spark进行了深入讲解,并对spark源码进行了剖析(In-depth understanding of Spark core technology books, books on Spark in-depth explanation, and analysis of spark source code)
    2019-08-07 18:05:31下载
    积分:1
  • SVR
    训练SVR模型做预测,可调整训练集和测试集比例及SVR参数,预测性能用MAP反映(The training SVR model can be used for prediction. The proportion of training set and test set and the parameters of SVR can be adjusted. The prediction performance can be reflected by MAP.)
    2021-03-29 09:39:10下载
    积分:1
  • Python-for-Finance-Second-Edition-master
    Python是一种面向对象、解释型计算机程序设计语言,其应用领域非常广泛,包括数据分析、自然语言处理、机器学习、科学计算以及推荐系统构建等。 本书用Python语言来讲解算法的分析和设计。本书主要关注经典的算法,但同时会为读者理解基本算法问题和解决问题打下很好的基础。(Python is an object-oriented, interpretive computer programming language. It has a wide range of applications, including data analysis, natural language processing, machine learning, scientific computing and recommendation system construction. This book uses Python language to explain the analysis and design of algorithms. This book focuses on classical algorithms, but at the same time it will lay a good foundation for readers to understand basic algorithms and solve problems. The book consists of 11 chapters. The tree, graph, counting problem, inductive recursion, traversal, decomposition and merging, greedy algorithm, complex dependency, Dijkstra algorithm, matching and cutting problem, difficult problem and its dilution are introduced. The book has exercises and reference materials at the end of each chapter, which provides readers with more convenience for self-examination and further stu)
    2018-11-24 15:20:49下载
    积分:1
  • new-DV-Hop-code
    改进DV-Hop定位算法 首先设置初始量,布置了一个范围为100×100m2的区域,其上随机分布100个传感器节点,其中有10个信标节点,节点的通信半径为30m。 第二步在正方形区域内产生均匀分布的随机拓扑,随机产生节点坐标并将其中十个选定为信标节点,其余九十个设为未知节点,然后画出节点分布图。 第三步通过最短路径法计算未知节点与每个信标节点的最小跳数。 第四步根据前面记录的其他信标节点的位置信息和相距跳数估算平均每跳的实际距离,用跳数估计距离的方法得出未知节点到信标节点的距离。 第五步用极大似然估计法求未知节点坐标 (Improved DV-Hop localization algorithm first set the initial amount, layout 100100m2 the area of ​ ​ a range of 100 sensor nodes randomly distributed on the 10 beacon node, the node communication radius of 30m. The second step in the square area to generate uniformly distributed random topology, random coordinates of the nodes and ten of the selected beacon node, the remaining 90 is set to unknown node, and then draw the node distribution diagram. The third step is to calculate the minimum number of hops of the unknown node and each beacon node through the shortest path method. The fourth step according to the location information of the other beacon nodes in the previous record and away from hops to estimate the average hop distance and hop count to estimate the distance to come to the distance of the unknown node to beacon nodes. The fifth step maximum likelihood estimation method and the unknown coordinates of the nodes)
    2020-10-12 22:27:31下载
    积分:1
  • 696524资源总数
  • 103771会员总数
  • 43今日下载