lstm

变结构的IMM算法---自适应模型集转换的IMM算法(AGIMM)(Variable structure IMM algorithm--- Adaptive Model Set conversion IMM algorithm (AGIMM))

设计一个校园导游咨询程序,为来访的客人提供学校最短路径信息查询服务(Design a campus tour guide consultation program to provide the shortest path information inquiry service for visitors)

通过包围盒法和K-D树法实现电云数据的邻域收索，邻域值可以自动设置(Point cloud data by bounding boxes and K-D tree search method income neighborhood, neighborhood values can be automatically set)

聚类评价指标的各种说明，非常详细，请仔细阅读。(Cluster evaluation indicators of various descriptions, very detailed.)

一种神经网络算法：极限学习机（ELM)，包括分类和回归，仿真验证无误，适合初学者练习(A data mining algorithm: limit learning machine (ELM), including classification and regression, simulation verification is unmistakable, suitable for beginners to practice)

说明：  通过PYTHON编写的爬虫程序，爬取Geoq的人口密度数据(The population density data of Geoq is crawled by a crawler program written in PYTHON)

计算嵌入维和时间延迟，为混沌时间序列的最大李雅普诺指数计算铺垫(Computational embedding and time delay)

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)

用 Floyd 算法求任意两点间的最短路径及最短路长. D0 是图的邻接矩阵(Floyd algorithm used for any shortest path between two points and the most long-short-circuit. D0 is the graph adjacency matrix)

地震记录合成及处理，包括地震子波卷积，速度分析(Seismic Record Synthesis and Processing)