<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Kenney Qin 的专栏]]></title><description><![CDATA[代码实现算法，努力实现梦想。]]></description><link>https://blog.youkuaiyun.com/OrthocenterChocolate</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; OrthocenterChocolate]]></copyright><item><title><![CDATA[学习排序Learning to Rank之RankNet]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/43203891</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/43203891</guid><author>OrthocenterChocolate</author><pubDate>Tue, 27 Jan 2015 22:13:40 +0800</pubDate><description><![CDATA[今天给大家介绍一个Learning to Rank系列算法中的一个：RankNet。Learning to Rank最常用的地方就是搜索引擎，它能从用户的搜索、点击数据中学习出搜索结果的排序函数，以改善当前的检索模型。]]></description><category></category></item><item><title><![CDATA[C++虚函数与虚函数表]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/40866639</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/40866639</guid><author>OrthocenterChocolate</author><pubDate>Thu, 06 Nov 2014 20:02:56 +0800</pubDate><description><![CDATA[C++有个玩意叫虚函数，]]></description><category></category></item><item><title><![CDATA[One Class SVM, SVDD（Support Vector Domain Description）]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/40592403</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/40592403</guid><author>OrthocenterChocolate</author><pubDate>Wed, 29 Oct 2014 20:42:44 +0800</pubDate><description><![CDATA[今天给大家介绍一下one class classification以及用SVDD（）]]></description><category></category></item><item><title><![CDATA[kmeans 聚类算法]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39610595</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39610595</guid><author>OrthocenterChocolate</author><pubDate>Wed, 15 Oct 2014 17:34:29 +0800</pubDate><description><![CDATA[这篇文章给大家介绍一个]]></description><category></category></item><item><title><![CDATA[聚类和分类的区别]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39967257</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39967257</guid><author>OrthocenterChocolate</author><pubDate>Fri, 10 Oct 2014 19:28:34 +0800</pubDate><description><![CDATA[相信有不少同学在刚接触聚类（Cl）和分类]]></description><category></category></item><item><title><![CDATA[PCA（Principal Component Analysis）主成分分析]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39401767</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39401767</guid><author>OrthocenterChocolate</author><pubDate>Mon, 29 Sep 2014 09:26:32 +0800</pubDate><description><![CDATA[今天给大家说说]]></description><category></category></item><item><title><![CDATA[频繁模式挖掘（Frequent Pattern Mining）]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39297365</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39297365</guid><author>OrthocenterChocolate</author><pubDate>Sun, 28 Sep 2014 09:45:57 +0800</pubDate><description><![CDATA[频繁模式挖掘（）]]></description><category></category></item><item><title><![CDATA[gradient descent 梯度下降算法]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39374939</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39374939</guid><author>OrthocenterChocolate</author><pubDate>Thu, 25 Sep 2014 23:04:58 +0800</pubDate><description><![CDATA[今天给大家介绍一个m]]></description><category></category></item><item><title><![CDATA[PageRank介绍]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39323247</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39323247</guid><author>OrthocenterChocolate</author><pubDate>Tue, 16 Sep 2014 21:04:06 +0800</pubDate><description><![CDATA[今天给大家来剖析一下PageRank~什么是]]></description><category></category></item><item><title><![CDATA[BP神经网络]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39274017</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/39274017</guid><author>OrthocenterChocolate</author><pubDate>Mon, 15 Sep 2014 12:55:02 +0800</pubDate><description><![CDATA[本文介绍机器学习里的BP神经网络算法，]]></description><category></category></item><item><title><![CDATA[Locality Sensitive Hashing ( LSH，局部敏感哈希 ) 详解]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38943491</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38943491</guid><author>OrthocenterChocolate</author><pubDate>Sat, 30 Aug 2014 12:54:26 +0800</pubDate><description><![CDATA[这篇文章想给大家介绍一个神奇的东东：LSH，它可以快速地找出海量数据中的相似数据。]]></description><category></category></item><item><title><![CDATA[推荐系统之矩阵分解]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38540871</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38540871</guid><author>OrthocenterChocolate</author><pubDate>Sat, 30 Aug 2014 12:45:24 +0800</pubDate><description><![CDATA[本文将给大家介绍一下如何利用矩阵分解来做推荐系统算法。]]></description><category></category></item><item><title><![CDATA[linux C++ 爬虫抓取网页]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38665937</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38665937</guid><author>OrthocenterChocolate</author><pubDate>Mon, 18 Aug 2014 20:50:36 +0800</pubDate><description><![CDATA[这是一个linux下C++写的抓取网页的代码]]></description><category></category></item><item><title><![CDATA[android中用线程更新UI，报错only the original thread that created a view hierarchy can touch its views]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38641223</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38641223</guid><author>OrthocenterChocolate</author><pubDate>Sun, 17 Aug 2014 19:07:01 +0800</pubDate><description><![CDATA[android开发中难免要更新UI，比如做一个时钟，]]></description><category></category></item><item><title><![CDATA[C++中实现类似java中接口的功能]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38639873</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38639873</guid><author>OrthocenterChocolate</author><pubDate>Sun, 17 Aug 2014 16:17:59 +0800</pubDate><description><![CDATA[用过Java的人对Java中的接口（interface）一定不陌生，就算没有自己写过接口，也多多少少用过，]]></description><category></category></item><item><title><![CDATA[C++ 字符串转数字 数字转字符串]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38639777</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38639777</guid><author>OrthocenterChocolate</author><pubDate>Sun, 17 Aug 2014 16:10:51 +0800</pubDate><description><![CDATA[C++中字符串转数字，数字转字符串的方法有很多，相信itoa，atoi的方式大家也很熟悉了~下面利用C++中的stringstream来实现字符串转数字、数字转字符串，这是我最喜欢的方式，别忘了#include 。
        字符串转数字：

int str2num(const string str){
    stringstream ss(str);
    int num;
  ]]></description><category></category></item><item><title><![CDATA[常用相似性、相关性度量指标]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38596633</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/38596633</guid><author>OrthocenterChocolate</author><pubDate>Fri, 15 Aug 2014 23:27:49 +0800</pubDate><description><![CDATA[本文将介绍一些数据挖掘、机器学习、信息检索等领域中常用的一些相似性、相关性指标]]></description><category></category></item><item><title><![CDATA[二叉树层次遍历如何判断当前结点是哪层的？]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/37612183</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/37612183</guid><author>OrthocenterChocolate</author><pubDate>Wed, 09 Jul 2014 22:15:32 +0800</pubDate><description><![CDATA[二叉树层次遍历就是按每层从左到右（一般是从左到右，若想从右到左也很简单）的次序遍历结点。下面给一个简单的例子：]]></description><category></category></item><item><title><![CDATA[C++ 大数加法]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/36664901</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/36664901</guid><author>OrthocenterChocolate</author><pubDate>Thu, 03 Jul 2014 16:01:50 +0800</pubDate><description><![CDATA[所谓大数加法就是说能够对超长位数的数字进行相加，比如一个100位数加一个90位数，为什么这会是一个问题呢？直接用int,long这些表示两个数，然后相加不行吗？肯定是不是滴~这些基本类型能处理的范围是有限的，因此如果你用一个int型变量来表示一个100位数，虽然不会报错，但是你将得不到正确的运行结果，因此数字被截断了，就好像你有一个书包，它能装10本书，你要用它来装100本书，肯定是装不下的，只能]]></description><category></category></item><item><title><![CDATA[C++ 判断一棵二叉树是否对称]]></title><link>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/36179617</link><guid>https://blog.youkuaiyun.com/OrthocenterChocolate/article/details/36179617</guid><author>OrthocenterChocolate</author><pubDate>Tue, 01 Jul 2014 12:01:37 +0800</pubDate><description><![CDATA[一棵二叉树对称，就是说它如果以根为轴，翻转过去一样，如下图所示，以虚线为轴，把左边翻转到右边，各顶点及顶点中的值均一一对应。]]></description><category></category></item></channel></rss>