Shares From Internet

1. Handling Categorical Data in Python
   • Categorical features may have a very large number of levels, known as high cardinality, (for example, cities or URLs), where most of the levels appear in a relatively small number of instances.
   • Many machine learning models, such as regression or SVM or …

Shares From Internet

1. What Kagglers are using for Text Classification
2. What Kagglers Are Using for Text Classification | Hacker News
3. 字词的向量表示法 | TensorFlow
4. Sutton & Barto Book: Reinforcement Learning: An Introduction
5. GitHub - sdmg15/Best-websites-a-programmer-should-visit: Some useful websites for programmers.
6. memory ram usage in linux bash echo …

summary of how to install nvidia drivers on ubuntu for deep learning.

Shares From Internet

1. 如何配置一台适用于深度学习的工作站？
2. 配置深度学习主机与环境（TensorFlow+1080Ti）：（四）基于Anaconda的TensorFlow安装
3. 不踩坑：Ubuntu下安装TensorFlow的最简单方法（无需手动安装CUDA和cuDNN 远程 …

Shares From Internet

1. AWS Activating TensorFlow
2. Comprehensive Python Cheatsheet
3. GAN by Example using Keras on Tensorflow Backend
4. How to Implement the Conv1DTranspose in keras?
5. Advanced-Deep-Learning-with-Keras
6. 人人都能看懂的LSTM
7. Step-by-step to LSTM: 解析LSTM神经网络设计原理
8. What's causing the vanishing gradient problem? Unstable gradients in deep neural …

题目大意 给定n个气球，每个气球有一个数字，用数组nums来表示n个气球上面的数字。如果气球i被打破，那么你会得到nums[left] * nums[i] * nums[right].这里left和right分别为气球i的左右两边的气球。打破所有的气球后把所有的数字相加，求解怎么打破这些气球使得最后得到的数字最大。

题目大意 给定长度为m和n的两个数组，数组里面数字为0到9.要求从这两个数组里面去k个数字构成的数字的最大值。k<=m+n。题目要求新的数字的顺序跟原来数组的数字顺序保持一致。

题目大意 给定一堆硬币和一个数字，求组成那个数字的最少硬币个数。如果币值没法构成给定数字，返回 -1

题目大意 给定一个整型数组，里面没有重复数字。求解所有可能的组合使得组合的和为给定的整数。

题目大意 给定一个数组，求能不能把数组分成两部分使得两个子数组的和相等