登录
首页 » matlab » lstm

lstm

于 2021-01-05 发布 文件大小:3KB
0 2174
下载积分: 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 个回复

  • Hive
    bigdata hive use for hadoop
    2018-04-01 16:13:56下载
    积分:1
  • 金属融化问题
    南开大学  金属融化问题  辛运帏老师  C++实现  含测试样例
    2022-05-17 21:26:23下载
    积分: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
  • IABC_KMC_test_on_Iris_wine_glass
    基于人工蚁群的的改进Kmeans,进行了改进,效果较好(Based on the improvement of artificial ant colony, Kmeans have been improved and the effect is better)
    2017-05-20 20:24:27下载
    积分:1
  • c# k-mean 挖掘算法算法
    本文件封装好K-MEANS算法,只需要调用函数就可以使用
    2022-01-23 10:52:22下载
    积分:1
  • gm1n
    多变量灰色模型(Multivariable Grey Model,MGM)MGM(1,n)是研究复杂灰色系统的典型模型,其形式是n元一阶常微分方程组,是单点GM(1,1)模型在多点情况的扩展。(Multivariable grey model MGM (1, n) is a typical model for studying complex grey system. Its form is n n first order ordinary differential equations. It is the expansion of single point GM (1,1) model in multi-point case.)
    2021-04-29 12:28:43下载
    积分:1
  • ZookeeperClient
    说明:  zookper节点搭建、持久节点、临时节点创建以及动态上下线(Construction of Zookper Node and Dynamic Up and Down)
    2020-06-20 10:00:01下载
    积分:1
  • Cat
    Shu-ChuanChu受到猫日常行为动作的启发,于2006年提出了猫群算法。猫群算法的最大特征表现为在进化过程中能够同时进行局部搜索和全局搜索,具有很好的收敛速度(Shu- ChuanChu inspired by cats everyday actions, cat swarm algorithm is proposed in 2006. Cat swarm algorithm of the biggest characteristic is in the process of evolution can carry on the global search and local search at the same time, has the very good convergence )
    2013-08-14 21:53:12下载
    积分: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
  • FNN与PCA和KPCA结合
    一种特征提取方法:结合主元分析(PCA)和核主元分析(KPCA)的前馈神经网络(FNN)(A feature extraction method: the feedforward neural network (FNN) combined with principal component analysis (PCA) and kernel principal component analysis (KPCA))
    2020-09-18 10:27:53下载
    积分:1
  • 696519资源总数
  • 104213会员总数
  • 24今日下载