登录
首页 » matlab » lstm

lstm

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

代码说明:

  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 个回复

  • project
    数据挖掘,推荐系统,堆叠降噪自编码器,逻辑回归(Data mining, recommender systems, stack noise reduction, self coder, logic regression)
    2021-01-25 23:58:43下载
    积分:1
  • 004591
    杜里特尔分解法 c改进平方根法 c拉格朗日插值法 cpp牛顿迭代 cpp梯形法积分 cpp追赶法 c 杜里特尔分解法 c改进平方根法 c拉格(Duretel decomposition method c improved square root method c Lagrange interpolation method cpp Newton iteration cpp trapezoid method integral cpp catch-up method c Duretel decomposition method c improved square root method c Lagrangian method)
    2018-09-05 10:49:45下载
    积分:1
  • 587244
    matlab数值积分工具箱 nit toolbox(Matlab numerical integration toolbox nit toolbox)
    2020-09-04 10:08:05下载
    积分:1
  • MATLAB_SMOTE
    SMOTE插值算法,补全数据的不平衡性。(SMOTE interpolation algorithm to complete the imbalance of data.)
    2018-08-20 10:05:48下载
    积分:1
  • hierarchical-clustering
    这段代码是层次聚类的Matlab实现代码( This code is hierarchical clustering Matlab implementation code)
    2016-10-16 10:43:09下载
    积分: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
  • 三相四桥臂SVPWM控制及电机模型
    实现三相四桥臂永磁同步电机矢量控制,此方法有很多优点,与传统的三桥臂SVPWM相比,波形有明显改善 谐波减少(Three phase and four leg PMSM controller)
    2020-10-05 13:37:39下载
    积分:1
  • wcd_Science
    The 1053 problem of online system ACM of Hangzhou University of Electronic Science and Technology, solved by greedy method
    2018-11-21 02:24:10下载
    积分:1
  • OPTICS
    此为利用optics聚类方法剔除风电异常数据后,采用极限学习机验证的代码(optics data mining)
    2017-03-22 19:29:22下载
    积分: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
  • 696518资源总数
  • 104342会员总数
  • 47今日下载