-
svm
支持向量机python实现算法，回归、分类、预测(surpport vector machion)
- 2021-04-01 14:29:08下载
- 积分：1
-
tsne_python
说明： T-SNE高维数据降维特征提取，用于python3(T-SNE demensinal,python)
- 2021-01-27 21:48:41下载
- 积分：1
-
xmlprocess
xml解析方法封装，便于直接解析xml中的value值(python for xml file parser)
- 2018-08-08 21:46:38下载
- 积分：1
-
手写体字符识别
简单的手写体字符识别，利用了k近邻和支持向量机算法(Simple handwritten character recognition, using the k nearest neighbor and support vector machine algorithm)
- 2017-11-24 11:23:02下载
- 积分：1
-
机器学习实战（高清 中文版）
说明： 机器学习实战（高清 中文版）
作者： Peter
本书通过精心排的实例切入日常工作任务摒弃学术化语言利用高效可复用的Python 代码阐释如何处理统计数据进行数据分析及可视化。读者可从中学到一些核心的机器学习算法并将其运用于某些策略性任务中如分类、预测及推荐等。本书适合机器学习相关研究人员及互联网从业人员学习参考。(Machine learning combat (HD Chinese version)
Author: Peter
This book cuts into everyday tasks through elaborate examples. Abandoning academic language uses efficient and reusable Python code to illustrate how to process statistics for data analysis and visualization. Readers can learn some core machine learning algorithms and apply them to certain strategic tasks such as classification, prediction, and recommendation. This book is suitable for machine learning related researchers and Internet practitioners to learn reference.)
- 2019-05-19 03:06:57下载
- 积分：1
-
nongyao1
说明： 无人机根据环境变化进行实时路径规划 深度强化学习(Deep reinforcement learning for UAV path planning)
- 2021-02-09 08:56:56下载
- 积分：1
-
局部搜索图着色
说明： 图着色局部搜索,图着色问题（Graph Coloring Problem, GCP） 又称着色问题，是最著名的NP-完全问题之一。道路着色问题（Road Coloring Problem）是图论中最著名的猜想之一。
数学定义：给定一个无向图G=（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory.
Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)
- 2021-04-01 16:49:10下载
- 积分：1
-
GA
说明： python遗传算法求解背包问题,后者由1978年由Merkel和Hellman提出。其运行依赖DEAP
(python genetic algorithm knapsack problem, which in 1978 proposed by Merkel and Hellman. Its operation depend DEAP)
- 2015-06-16 10:00:41下载
- 积分：1
-
rsa11111
讲讲自己学习RSA中的实践过程，已经对RSA熟悉的看家就不用在此浪费时间了。(the study process of RSA.)
- 2005-05-12 14:41:02下载
- 积分：1
-
ptt_beauty_infinite_scroll-master
ptt_beauty_infinite_scroll-masterptt表特版自動爬蟲(ptt_beauty_infinite_scroll-master)
- 2020-06-23 12:20:01下载
- 积分：1
