2017年09月_1.02^365的成长裂变

12月 11月 10月 09月

原创博客简介

简介好记性不如烂笔头，工作、学习和生活过程中的点点滴滴、关键知识点都需要记录，并不时拿出来阅读和总结，对过往知识的回顾和总结，为今后工作提供能量。本博客主要记录工作中解决的技术难题、日常系统性复习过程中的相关笔记等。互联网行业技术更新太快，很多技术每天都需要接触，经常进行系统性的学习、复习与总结，能够从更高的角度对整个技术栈有更好的掌握。博客中涉及到的系统性知识包括：C/C++、J

2017-09-20 13:44:18 4198

转载 [随笔] GuavaCache简介

前言在多线程高并发场景中往往是离不开cache的，需要根据不同的应用场景来需要选择不同的cache，比如分布式缓存如redis、memcached，还有本地（进程内）缓存如ehcache、GuavaCache。之前用spring cache的时候集成的是ehcache，但接触到GuavaCache之后，被它的简单、强大、及轻量级所吸引。它不需要配置文件，使用起来和ConcurrentHashM

2017-09-25 15:01:39 3691

原创 [机器学习实战] k-近邻算法

原理存在一个样本数据集合，也称作训练样本集，并且样本集中每个数据都存在标签，即我们知道样本集中每一数据与所属分类的对应关系。输入没有标签的新数据后，将新数据的每个特征与样本集中数据对应的特征进行比较，然后算法提取样本集中特征最相似数据（最近邻）的分类标签。一般来说，我们只选择样本数据集中前k各最相似的数据，这就是k-近邻算法中k的出处，通常k是不大于20的整数。最后，选择k个最相似数据中出现次

2017-09-20 13:20:48 3771

原创 [机器学习实战] 机器学习基础

1. 机器学习的主要任务：（分类、回归）有监督学习、（聚类、密度估计）无监督学习2. 如何选择合适算法：使用机器学习的目的；需要分析的数据是什么；——分类、回归、聚类还是密度估计，确定算法类型；特征选择，离散型还是连续型，是否有缺失，出现频率；3. 开发机器学习应用程序的步骤（1）收集数据（2）准备输入数据：规范格式（3）分析输入数据：查找异常值

2017-09-19 07:50:00 11220

原创 [深度学习PART I] 神经网络概述

1. 神经网络是什么神经网络一般分为生物神经网络和人工神经网络。生物神经网络指生物的大脑神经元，细胞，触点等组成的网络，用于产生生物的意识，帮助生物进行思考和行动。人工神经网络（ANN）是一种模仿动物神经网络行为特征，进行分布式并行信息处理的算法数学模型。这种网络依靠系统的复杂程度，通过调整内部大量节点之间的相互连接的关系，从而达到处理信息的目的。在计算机领域，我们所说的神经网络通常指的是人工

2017-09-12 09:45:56 11454

转载 [自然语言处理] LSA与pLSA（2）

EM求解在似然值L的表达式中存在对数内部的加运算，所以球pLSA最大似然解的问题没有闭式解，我们只能求助于EM算法，下面我们从最简单的启发式的角度推导出pLSA的求解过程。既然似然值L无法直接求解最大值，那么我们转而优化其下界F，并通过迭代不断的将此下界提高，那么最终得到的解即为L近似最大解，当然，此过程中寻求的下界F要求尽量紧确。因为：0<p(zk|di,wj)<1,∑Kk=1p(...

2017-09-10 20:54:33 4168

1. 引子Bag-of-Words 模型是NLP和IR领域中的一个基本假设。在这个模型中，一个文档(document)被表示为一组单词(word/term)的无序组合，而忽略了语法或者词序的部分。BOW在传统NLP领域取得了巨大的成功，在计算机视觉领域(Computer Vision)也开始崭露头角，但在实际应用过程中，它却有一些不可避免的缺陷，比如：稀疏性(Sparseness): 对于大词典，...

2017-09-10 20:54:29 11139 1

转载 [机器学习] 随机森林与GBDT

前言：决策树这种算法有着很多良好的特性，比如说训练时间复杂度较低，预测的过程比较快速，模型容易展示（容易将得到的决策树做成图片展示出来）等。但是同时，单决策树又有一些不好的地方，比如说容易over-fitting，虽然有一些方法，如剪枝可以减少这种情况，但是还是不够的。模型组合（比如说有Boosting，Bagging等）与决策树相关的算法比较多，这些算法最终的结果是生成N(可能会...

2017-09-10 20:54:26 3741

转载 [自然语言处理] 向前-向后算法(Baum-Welch算法)

学习问题在HMM模型中，已知隐藏状态的集合S，观察值的集合O，以及一个观察序列（o1,o2,...,on），求使得该观察序列出现的可能性最大的模型参数（包括初始状态概率矩阵π，状态转移矩阵A，发射矩阵B）。这正好就是EM算法要求解的问题：已知一系列的观察值X，在隐含变量Y未知的情况下求最佳参数θ*，使得：在中文词性标注里，根据为训练语料，我们观察到了一系列的词（对应EM中的X），如果每个词的词性（...

2017-09-10 20:54:23 6020 1

转载 [自然语言处理] 隐马尔可夫模型（HMM）攻略

隐马尔可夫模型 (Hidden Markov Model，HMM) 最初由 L. E. Baum 和其它一些学者发表在一系列的统计学论文中，随后在语言识别，自然语言处理以及生物信息等领域体现了很大的价值。平时，经常能接触到涉及 HMM 的相关文章，一直没有仔细研究过，都是蜻蜓点水，因此，想花一点时间梳理下，加深理解，在此特别感谢 52nlp 对 HMM 的详细介绍。　　考虑下面交通灯的例子，一个序...

2017-09-10 20:54:20 12329

原创 [LeetCode] 140: ZigZag Conversion

[Problem]The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA

2017-09-10 20:54:17 3647

原创 [LeetCode] 139: Word Search

[Problem]Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or

2017-09-10 20:54:14 3624

原创 [LeetCode] 138: Word Ladder II

[Problem]Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that:Only one letter can be changed at a timeEach intermediate word

2017-09-10 20:54:11 3723

原创 [LeetCode] 137: Word Ladder

[Problem]Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a timeEach intermediat

2017-09-10 20:54:08 3670

原创 [LeetCode] 136: Word Break II

[Problem]Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such possible sentences.For example, gi

2017-09-10 20:54:06 3706

原创 [LeetCode] 135: Word Break

[Problem]Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict =

2017-09-10 20:54:03 3642

原创 [LeetCode] 134: Wildcard Matching

[Problem]Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The matching shoul

2017-09-10 20:54:00 3613

原创 [LeetCode] 133: Gas Station

[Problem]There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from stati

2017-09-10 20:53:57 3658

原创 [LeetCode] 132: Copy List with Random Pointer

[Problem]A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.[Solution]/** * Defini

2017-09-10 20:53:55 3631

原创 [LeetCode] 131: Clone Graph

[Problem]Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separat

2017-09-10 20:53:52 3603

原创 [LeetCode] 130: Candy

[Problem]There are N children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected to the following requirements:Each child must have at

2017-09-10 20:53:49 3569

原创 [LeetCode] 129: Validate Binary Search Tree

[Problem]Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's

2017-09-10 20:53:46 3594

原创 [LeetCode] 128: Valid Sudoku

[Problem]Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially fill

2017-09-10 20:53:43 3590

原创 [LeetCode] 127: Valid Parentheses

[Problem]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

2017-09-10 20:53:41 3591

原创 [LeetCode] 126: Valid Palindrome

[Problem]Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" i

2017-09-10 20:53:38 3557

原创 [LeetCode] 125: Valid Number

[Problem]Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambi

2017-09-10 20:53:35 3588

原创 [LeetCode] 124: Unique Paths II

[Problem]Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in t

2017-09-10 20:53:32 3554

原创 [LeetCode] 123: Unique Paths

[Problem]A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to re

2017-09-10 20:53:29 3589

原创 [LeetCode] 122: Unique Binary Search Trees II

[Problem]Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below. 1

2017-09-10 20:53:26 3588

原创 [LeetCode] 121: Unique Binary Search Trees

[Problem]Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1

2017-09-10 20:53:23 3562

原创 [LeetCode] 120: Two Sum

[Problem]Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the tar

2017-09-10 20:53:20 3582

原创 [LeetCode] 119: Triangle

[Problem]Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4],

2017-09-10 20:53:18 3589

原创 [LeetCode] 118: Trapping Rain Water

[Problem]Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. For example, Given [0,1,0,2,1,0,

2017-09-10 20:53:15 3626

原创 [LeetCode] 117: Text Justification

[Problem]Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified. You should pack your words in a greedy appro

2017-09-10 20:53:12 3579

原创 [LeetCode] 116: Symmetric Tree

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

2017-09-10 20:53:09 3593

原创 [LeetCode] 115: Swap Nodes in Pairs

[Problem]Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant

2017-09-10 20:53:06 3580

原创 [LeetCode] 114: Surrounded Regions

[Problem]Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region .For example,X X X XX O O

2017-09-10 20:53:03 3629

原创 [LeetCode] 113: Sum Root to Leaf Numbers

[Problem]Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the to

2017-09-10 20:53:00 3568

原创 [LeetCode] 112: Sudoku Solver

[Problem]Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.A sudoku

2017-09-10 20:52:57 3633

原创 [LeetCode] 111: Substring with Concatenation of All Words

[Problem]You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once an

2017-09-10 20:52:55 3572