-
决策树与集成算法
决策树与集成算法,用来分类已知数据种类,希望对编程有帮助(Decision tree and ensemble algorithm are used to classify known data types.)
- 2018-09-09 17:38:01下载
- 积分:1
-
算法与数据结构(python版)(北大内部教材)
算法与数据结构,python版本的,北大内部教材(Algorithms and Data Structures, Python Version, Peking University Internal Textbook)
- 2019-04-11 16:59:53下载
- 积分:1
-
KPCA故障检测
基于KPCA的故障诊断matlab代码。包括t^2统计量和q统计量(Fault Diagnosis Matlab Code Based on KPCA)
- 2021-04-12 11:18:57下载
- 积分: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
-
BIC确定GMM聚类簇数
说明: 通过贝叶斯信息准则确定高斯混合聚类方法的聚类簇数(Determining the Cluster Number of GMM Clusters by BIC)
- 2021-03-26 19:19:13下载
- 积分:1
-
AlgorithmsByPython-master
说明: 一些常见算法实现和牛客网以及leetcode刷题(Some Common Algorithms Implementing and Title Brushing)
- 2018-12-24 16:03:44下载
- 积分:1
-
Archive
说明: PCA 数据降维 PTYTHON 数据分析/挖掘(PCA dimensionality reduction data mining/analysis)
- 2020-06-21 15:40:02下载
- 积分:1
-
vdvnt
卡尔曼滤波器的经典著作,由其本人所写,许多好的IDEA!希望对各位设计滤波器有所启发!()
- 2018-07-06 14:33:59下载
- 积分:1
-
Dijkstra
用Python实现dijkstra算法。使用python 语言在网络图中实现Dijkstra 算法,返回从源点出
发到每个结点的最短距离、路径,并打印出该路由(源点)的forwarding table,(dijkstra algorithm in Python)
- 2018-01-03 22:33:37下载
- 积分: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