<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hechenghai]]></title><description><![CDATA[现在已经不走技术路线了，可能没法回答大家的问题了，抱歉！]]></description><link>https://blog.youkuaiyun.com/hechenghai</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hechenghai]]></copyright><item><title><![CDATA[Mahout线性回归算法源码分析（1）--实战]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/50402176</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/50402176</guid><author>hechenghai</author><pubDate>Fri, 25 Dec 2015 11:36:13 +0800</pubDate><description><![CDATA[转载地址：http://blog.youkuaiyun.com/fansy1990/article/details/23766523






版本：mahout0.9

Mahout里面使用逻辑回归（logistic regression）的主要两个类是org.apache.mahout.classifier.sgd.TrainLogistic、org.apache.mahout.cla]]></description><category></category></item><item><title><![CDATA[使用mahout下的朴素贝叶斯分类器对新闻分类]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/50351718</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/50351718</guid><author>hechenghai</author><pubDate>Fri, 18 Dec 2015 14:48:37 +0800</pubDate><description><![CDATA[转载地址：http://www.letiantian.me/2014-10-22-mahout-naive-bayes-newsgroups/








mahout版本是0.9；hadoop版本是1.2.1。

下载数据集20
 newsgroups dataset，解压后得到20news-bydate目录：
$ cp -R 20news-bydate/*/* 2]]></description><category></category></item><item><title><![CDATA[应用scikit-learn做文本分类]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/50292813</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/50292813</guid><author>hechenghai</author><pubDate>Mon, 14 Dec 2015 11:46:17 +0800</pubDate><description><![CDATA[转载地址：http://blog.youkuaiyun.com/abcjennifer/article/details/23615947






文本挖掘的paper没找到统一的benchmark，只好自己跑程序，走过路过的前辈如果知道20newsgroups或者其它好用的公共数据集的分类（最好要所有类分类结果，全部或取部分特征无所谓）麻烦留言告知下现在的benchmark，万谢！

嗯]]></description><category></category></item><item><title><![CDATA[[LeetCode]Decode Ways]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/50223549</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/50223549</guid><author>hechenghai</author><pubDate>Tue, 08 Dec 2015 20:20:34 +0800</pubDate><description><![CDATA[Decode Ways
My Submissions

Question


Total Accepted: 55371 Total
 Submissions: 330911 Difficulty: Medium




A message containing letters from A-Z is
 being encoded to numbers using the]]></description><category></category></item><item><title><![CDATA[[LeetCode]Largest Rectangle in Histogram]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/50193705</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/50193705</guid><author>hechenghai</author><pubDate>Sun, 06 Dec 2015 11:27:35 +0800</pubDate><description><![CDATA[Largest Rectangle in Histogram
My Submissions

Question


Total Accepted: 49964 Total
 Submissions: 215334 Difficulty: Hard






Given n non-negative integers representing the histogram]]></description><category></category></item><item><title><![CDATA[[LeetCode]Search in Rotated Sorted Array II]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/50150187</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/50150187</guid><author>hechenghai</author><pubDate>Wed, 02 Dec 2015 19:22:20 +0800</pubDate><description><![CDATA[Search in Rotated Sorted Array II
My Submissions

Question


Total Accepted: 50992 Total
 Submissions: 162671 Difficulty: Medium




Follow up for "Search in Rotated Sorted Array":
What i]]></description><category></category></item><item><title><![CDATA[Unique Paths]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/50063587</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/50063587</guid><author>hechenghai</author><pubDate>Thu, 26 Nov 2015 23:39:07 +0800</pubDate><description><![CDATA[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 reach the ]]></description><category></category></item><item><title><![CDATA[LeetCode问题 pow(x,n)]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49964361</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49964361</guid><author>hechenghai</author><pubDate>Sat, 21 Nov 2015 14:39:04 +0800</pubDate><description><![CDATA[转载地址：http://blog.youkuaiyun.com/fengbingyang/article/details/12236121


实现浮点类型的幂运算，函数原型为:

double pow(double x, int n)

下面介绍一下解决该问题的几种方法以及要注意的地方：

1)最直观容易想到的方法就是用递归方法求n个x的乘积，注意考虑n的正负号，时间复杂度为O(n)
]]></description><category></category></item><item><title><![CDATA[Jump Game II]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49883763</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49883763</guid><author>hechenghai</author><pubDate>Tue, 17 Nov 2015 10:15:27 +0800</pubDate><description><![CDATA[Jump Game II
My Submissions

Question


Total Accepted: 52353 Total
 Submissions: 213392 Difficulty: Hard




Given an array of non-negative integers, you are initially positioned at the f]]></description><category></category></item><item><title><![CDATA[[LeetCode]Wildcard Matching]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49836623</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49836623</guid><author>hechenghai</author><pubDate>Sat, 14 Nov 2015 16:26:15 +0800</pubDate><description><![CDATA[转载地址：http://www.cnblogs.com/felixfang/p/3708999.html


开篇


通常的匹配分为两类，一种是正则表达式匹配，pattern包含一些关键字，比如'*'的用法是紧跟在pattern的某个字符后，表示这个字符可以出现任意多次(包括0次)。

另一种是通配符匹配，我们在操作系统里搜索文件的时候，用的就是这种匹配。比如 "*.pdf"，']]></description><category></category></item><item><title><![CDATA[[LeetCode]First Missing Positive]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49757527</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49757527</guid><author>hechenghai</author><pubDate>Tue, 10 Nov 2015 11:41:29 +0800</pubDate><description><![CDATA[First Missing Positive
My Submissions

Question


Total Accepted: 51712 Total
 Submissions: 224707 Difficulty: Hard




Given an unsorted integer array, find the first missing positive int]]></description><category></category></item><item><title><![CDATA[聚类算法总结]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49738391</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49738391</guid><author>hechenghai</author><pubDate>Mon, 09 Nov 2015 14:45:10 +0800</pubDate><description><![CDATA[转自：http://blog.chinaunix.net/uid-10289334-id-3758310.html
（本文转自网上，具体出处忘了是哪里的，好像是上海一位女士在网上的博文，此处转载，用以备查，请原作者见谅）

聚类算法总结：
---------------------------------------------------------
聚类算法的种类：


基于划]]></description><category></category></item><item><title><![CDATA[Exception in thread "main" java.lang.NullPointerException         at java.lang.ProcessBuilder.start(]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49735489</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49735489</guid><author>hechenghai</author><pubDate>Mon, 09 Nov 2015 10:30:01 +0800</pubDate><description><![CDATA[log4j:WARN No appenders could be found for logger (org.apache.hadoop.util.Shell).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#]]></description><category></category></item><item><title><![CDATA[eclipse无法删除集群上的数据]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49684609</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49684609</guid><author>hechenghai</author><pubDate>Fri, 06 Nov 2015 16:23:32 +0800</pubDate><description><![CDATA[eclipse连接远程Hadoop集群开发时报错Exception in thread “main” org.apache.hadoop.security.AccessControlException: Permission denied: user=d, access=WRITE, inode=”data”:zxg:supergroup:rwxr-xr-xat org.apache.hadoop.]]></description><category></category></item><item><title><![CDATA[eclipse无法删除集群上的数据]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49684537</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49684537</guid><author>hechenghai</author><pubDate>Fri, 06 Nov 2015 16:17:57 +0800</pubDate><description><![CDATA[修改系统管理员名字

　　为了使Eclipse能正常对Hadoop集群的HDFS上的文件能进行修改和删除，所以修改你工作时所用的Win7系统管理员名字，默认一般为"Administrator"，把它修改为"kerry"(我的集群普通用户名)，此用户名与Hadoop集群普通用户一致。为了不至于为权限苦恼，我们可以修改Win7上系统管理员的姓名，这样就避免出现该用户在Hadoop集群上没有权限等都]]></description><category></category></item><item><title><![CDATA[ubuntu在vmware中静态(固定)IP地址的设置方法]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49684515</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49684515</guid><author>hechenghai</author><pubDate>Fri, 06 Nov 2015 16:17:11 +0800</pubDate><description><![CDATA[在虚拟机下运行操作系统，尤其是Linux系统已经是非常常见的做法，本人就是在Wmware中安装了Ubuntu，问题是每次启动ubuntu，VMWare都会为ubuntu分配一个动态IP，在做ssh操作或者ip共享操作时简直就是一场噩梦，每次都要在虚拟机中ubuntu查看IP后再连接，很不方便，所以设置成静态ip就方便许多。
一、环境




宿主系统


Windows 7
]]></description><category></category></item><item><title><![CDATA[[LeetCode] Search Insert Position]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49669381</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49669381</guid><author>hechenghai</author><pubDate>Thu, 05 Nov 2015 23:05:19 +0800</pubDate><description><![CDATA[Search Insert Position
My Submissions

Question


Total Accepted: 79962 Total
 Submissions: 222866 Difficulty: Medium




Given a sorted array and a target value, return the index if the t]]></description><category></category></item><item><title><![CDATA[让linux Sort 按照 ASCII 顺序排序]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49637481</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49637481</guid><author>hechenghai</author><pubDate>Wed, 04 Nov 2015 14:27:51 +0800</pubDate><description><![CDATA[1. cat test.txt
c
b
x
d
A
E
f
a
S
u
t
T
S
s

2. sort test.txt
a
A
b
c
d
E
f
s
S
S
t
T
u
x

3. export LC_ALL=C
4. sort test.txt
A
E
S
S
T
a
b
c
d
f
s
t
u
]]></description><category></category></item><item><title><![CDATA[hadoop2提交到Yarn： Mapreduce执行过程reduce分析3]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49621607</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49621607</guid><author>hechenghai</author><pubDate>Tue, 03 Nov 2015 20:47:45 +0800</pubDate><description><![CDATA[转载地址：http://www.aboutyun.com/thread-9375-1-1.html


问题导读：
1.Reduce类主要有哪三个步骤？
2.Reduce的Copy都包含什么过程？
3.Sort主要做了哪些工作？






4.4 Reduce类4.4.1
 Reduce介绍

整完了Map，接下来就是Reduce了。YarnChild.main(]]></description><category></category></item><item><title><![CDATA[hadoop2提交到Yarn： Mapreduce执行过程分析2]]></title><link>https://blog.youkuaiyun.com/hechenghai/article/details/49621593</link><guid>https://blog.youkuaiyun.com/hechenghai/article/details/49621593</guid><author>hechenghai</author><pubDate>Tue, 03 Nov 2015 20:46:07 +0800</pubDate><description><![CDATA[转载地址：http://www.aboutyun.com/forum.php?mod=viewthread&tid=9370&highlight=hadoop2%CC%E1%BD%BB%B5%BDYarn


问题导读：
1.hadoop哪些数据类型，是如何与Java数据类型对应的？
2.ApplicationMaster什么时候启动？
3.YarnChild进程什么时候产生？
4.]]></description><category></category></item></channel></rss>