晴天丶1-CSDN博客

转载反向传播法

　来源：http://www.cnblogs.com/charlotte77/p/5629865.html 　最近在看深度学习的东西，一开始看的吴恩达的UFLDL教程，有中文版就直接看了，后来发现有些地方总是不是很明确，又去看英文版，然后又找了些资料看，才发现，中文版的译者在翻译的时候会对省略的公式推导过程进行补充，但是补充的又是错的，难怪觉得有问题。反向传播法其实是神经网络的基础了，但是很...

2018-04-27 23:37:09 208

转载 Logistic回归总结

 Logistic回归总结作者：洞庭之子微博：洞庭之子-Bing （2013年11月） PDF下载地址：http://download.csdn.net/detail/lewsn2008/6547463 1.引言看了Stanford的Andrew Ng老师的机器学习公开课中关于Logisti...

2018-04-27 23:23:20 145

原创 leetcode 101. Symmetric Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 /

2017-11-28 22:21:42 132

原创 leetcode 38. Count and Say

The count-and-say sequence is the sequence of integers with the first five terms as following: 1. 1 2. 11 3. 21 4. 1211 5. 111221 1 is read off as “one 1” or 11. 11 is read o

2017-11-22 22:38:57 116

原创 leetcode 20. Valid Parentheses

Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. The brackets must close in the correct order, “()” and “()[]{}” are all valid but

2017-11-18 10:49:11 129

转载如何在GITHUB下载单个文件夹

使用SVN。比如MachineLearning的项目，我只想下载trainingDigits文件夹，它的URL为 https://github.com/apachecn/MachineLearning/tree/master/input/2.KNN/trainingDigits，把其中的/tree/master换为/trunk即可，即在命令行输入 svn checkout "https://g

2017-11-13 11:49:01 346

原创 leetcode 53. Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] has th

2017-11-09 10:45:43 131

原创 leetcode 11. Container With Most Water

Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lin

2017-11-04 11:14:20 117

原创 leetcode 27.Remove Element

Given an array and a value, remove all instances of that value in place and return the new length. 给定一个数列和一个值，将等于这个值的元素移除并返回最后的数列长度。思路我首先想到的办法是用一个index, i去遍历数组，若是不等于给定的值，就将另一个index, start所处的位置的值，等于i

2017-11-03 00:18:59 107

qq_37297529的博客