﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-a tutorial on computer science</title><link>http://www.cppblog.com/a542343910/</link><description /><language>zh-cn</language><lastBuildDate>Mon, 13 Apr 2026 09:42:37 GMT</lastBuildDate><pubDate>Mon, 13 Apr 2026 09:42:37 GMT</pubDate><ttl>60</ttl><item><title>stander random forest and ensemble of Extremely randomized trees</title><link>http://www.cppblog.com/a542343910/archive/2016/02/28/212901.html</link><dc:creator>bigrabbit</dc:creator><author>bigrabbit</author><pubDate>Sun, 28 Feb 2016 13:01:00 GMT</pubDate><guid>http://www.cppblog.com/a542343910/archive/2016/02/28/212901.html</guid><wfw:comment>http://www.cppblog.com/a542343910/comments/212901.html</wfw:comment><comments>http://www.cppblog.com/a542343910/archive/2016/02/28/212901.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/a542343910/comments/commentRss/212901.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/a542343910/services/trackbacks/212901.html</trackback:ping><description><![CDATA[stander random forest: &nbsp;random K features, enum all values as split, find best split.<br />
<br />
LINKS:https://en.wikipedia.org/wiki/Random_forest<br />
<br />
<br />
<div>Extremely randomized trees: random K features, random a split value, find best split.</div>
<div>ensemble Extremely randomized trees: use all data.</div>
<br />
LINKS:http://docs.opencv.org/2.4/modules/ml/doc/ertrees.html<br />
<br />
<ol simple"="" style="font-family: sans-serif; font-size: 16px; line-height: normal; background-color: #ffffff;">
     <li style="text-align: justify; line-height: 20.8px; margin-top: 1em; margin-bottom: 1em;">Extremely randomized trees don&#8217;t apply the bagging procedure to construct a set of the training samples for each tree. The same input training set is used to train all trees.</li>
     <li style="text-align: justify; line-height: 20.8px; margin-top: 1em; margin-bottom: 1em;">Extremely randomized trees pick a node split very extremely (both a variable index and variable splitting value are chosen randomly), whereas Random Forest finds the best split (optimal one by variable index and variable splitting value) among random subset of variables.<br />
     <br />
Extremely randomized trees用了所有的样本作为训练集；Extremely randomized trees随机选一个特征和一个值作为分割标准；<br />
     <br />
     <span style="font-family: verdana, 'courier new'; font-size: 14px; line-height: 21px;">LINKS:<span style="line-height: 20.8px; font-family: sans-serif; font-size: 16px;">http://scikit-learn.org/stable/modules/generated/sklearn.tree.ExtraTreeRegressor.html#sklearn.tree.ExtraTreeRegressor</span><br /></span><span style="color: #1d1f22; font-family: Helvetica, Arial, sans-serif; font-size: 14.4px; line-height: 21.6px;"><br /><span style="font-size: 14.4px; line-height: 21.6px;">This class implements a meta estimator that fits a number of randomized decision trees (a.k.a. extra-trees) on various sub-samples of the dataset and use averaging to improve the predictive accuracy and control over-fitting.<br /></span><br />Extra-trees differ from classic decision trees in the way they are built. When looking for the best split to separate the samples of a node into two groups, random splits are drawn for each of the&nbsp;</span><cite style="font-style: normal; color: #1d1f22; font-family: Helvetica, Arial, sans-serif; font-size: 14.4px; line-height: 21.6px;">max_features</cite><span style="color: #1d1f22; font-family: Helvetica, Arial, sans-serif; font-size: 14.4px; line-height: 21.6px;">&nbsp;randomly selected features and the best split among those is chosen. When&nbsp;</span><cite style="font-style: normal; color: #1d1f22; font-family: Helvetica, Arial, sans-serif; font-size: 14.4px; line-height: 21.6px;">max_features</cite><span style="color: #1d1f22; font-family: Helvetica, Arial, sans-serif; font-size: 14.4px; line-height: 21.6px;">&nbsp;is set 1, this amounts to building a totally random decision tree.<br /><br />extra-trees 的ensemble用了bagging，然后选取多个特征，每个特征随机选一个值作为分割标准建树。<br /><br />一种实现方法：<br />&nbsp; &nbsp; &nbsp; &nbsp;样本bagging, random n features &amp; random k values ，求最优，建树。&nbsp;<br /></span><br />
     </li>
</ol><img src ="http://www.cppblog.com/a542343910/aggbug/212901.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/a542343910/" target="_blank">bigrabbit</a> 2016-02-28 21:01 <a href="http://www.cppblog.com/a542343910/archive/2016/02/28/212901.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>cocos2d-iphone基础(1)</title><link>http://www.cppblog.com/a542343910/archive/2014/05/15/206980.html</link><dc:creator>bigrabbit</dc:creator><author>bigrabbit</author><pubDate>Thu, 15 May 2014 13:14:00 GMT</pubDate><guid>http://www.cppblog.com/a542343910/archive/2014/05/15/206980.html</guid><wfw:comment>http://www.cppblog.com/a542343910/comments/206980.html</wfw:comment><comments>http://www.cppblog.com/a542343910/archive/2014/05/15/206980.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/a542343910/comments/commentRss/206980.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/a542343910/services/trackbacks/206980.html</trackback:ping><description><![CDATA[主要类：<br />CCNode<br /><br />&nbsp;&nbsp;&nbsp;CCDirector<br />&nbsp;&nbsp;&nbsp;CCScene<br />&nbsp;&nbsp;&nbsp;CCLayer<br /><br /><br />定时更新：<br /><p>&nbsp;&nbsp;&nbsp;[[[CCDirector sharedDirector] scheduler] scheduleUpdateForTarget:self priority:0 paused:NO];</p>&nbsp;&nbsp;&nbsp;//[[[CCDirector sharedDirector] scheduler] unscheduleUpdateForTarget:self];<br /><br />接收输入：<br />&nbsp;&nbsp;&nbsp;v0.99<br /><p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;CCStandardTouchDelegate</p><p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;CCTargetedTouchDelegate<br /></p>&nbsp;&nbsp;&nbsp;v2.10<br /><p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;CCTouchOneByOneDelegate<br />        </p><p class="p1">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;CCTouchAllAtOnceDelegate<br /><br /></p><p class="p1"><span class="s1">&nbsp;&nbsp;&nbsp;[[[</span><span class="s2">CCDirector</span><span class="s1"> </span>sharedDirector<span class="s1">] </span>touchDispatcher<span class="s1">] </span>addTargetedDelegate<span class="s1">:</span><span class="s3">self</span><span class="s1"> </span>priority<span class="s1">:0&nbsp;</span>swallowsTouches<span class="s1">:</span><span class="s3">YES</span><span class="s1">];</span></p><p class="p1"><span class="s1">&nbsp;&nbsp;&nbsp;//[[[</span><span class="s2">CCDirector</span><span class="s1"> </span>sharedDirector<span class="s1">] </span>touchDispatcher<span class="s1">] </span>removeDelegate<span class="s1">:</span><span class="s3">self</span><span class="s1">];</span></p><p class="p1"><br />坐标系统：<br />&nbsp; &nbsp;position是设置相对于父亲节点的坐标<br />&nbsp; &nbsp;self.anchorPoint和self.position重合</p><p class="p1"><br />多层：<br />&nbsp; &nbsp;[cclayer.addchild cclayer];<br />&nbsp; &nbsp;一层叠一层</p><img src ="http://www.cppblog.com/a542343910/aggbug/206980.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/a542343910/" target="_blank">bigrabbit</a> 2014-05-15 21:14 <a href="http://www.cppblog.com/a542343910/archive/2014/05/15/206980.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>有向图强联通分量和无向图的边双联通分量</title><link>http://www.cppblog.com/a542343910/archive/2012/10/24/193817.html</link><dc:creator>bigrabbit</dc:creator><author>bigrabbit</author><pubDate>Wed, 24 Oct 2012 14:47:00 GMT</pubDate><guid>http://www.cppblog.com/a542343910/archive/2012/10/24/193817.html</guid><wfw:comment>http://www.cppblog.com/a542343910/comments/193817.html</wfw:comment><comments>http://www.cppblog.com/a542343910/archive/2012/10/24/193817.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/a542343910/comments/commentRss/193817.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/a542343910/services/trackbacks/193817.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.cppblog.com/a542343910/archive/2012/10/24/193817.html'>阅读全文</a><img src ="http://www.cppblog.com/a542343910/aggbug/193817.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/a542343910/" target="_blank">bigrabbit</a> 2012-10-24 22:47 <a href="http://www.cppblog.com/a542343910/archive/2012/10/24/193817.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>字符串循环同构</title><link>http://www.cppblog.com/a542343910/archive/2012/08/02/186037.html</link><dc:creator>bigrabbit</dc:creator><author>bigrabbit</author><pubDate>Thu, 02 Aug 2012 07:36:00 GMT</pubDate><guid>http://www.cppblog.com/a542343910/archive/2012/08/02/186037.html</guid><wfw:comment>http://www.cppblog.com/a542343910/comments/186037.html</wfw:comment><comments>http://www.cppblog.com/a542343910/archive/2012/08/02/186037.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/a542343910/comments/commentRss/186037.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/a542343910/services/trackbacks/186037.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.cppblog.com/a542343910/archive/2012/08/02/186037.html'>阅读全文</a><img src ="http://www.cppblog.com/a542343910/aggbug/186037.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/a542343910/" target="_blank">bigrabbit</a> 2012-08-02 15:36 <a href="http://www.cppblog.com/a542343910/archive/2012/08/02/186037.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>backup之关于图的双联通，割点，桥，有向图强连通等</title><link>http://www.cppblog.com/a542343910/archive/2012/07/31/185791.html</link><dc:creator>bigrabbit</dc:creator><author>bigrabbit</author><pubDate>Tue, 31 Jul 2012 14:36:00 GMT</pubDate><guid>http://www.cppblog.com/a542343910/archive/2012/07/31/185791.html</guid><wfw:comment>http://www.cppblog.com/a542343910/comments/185791.html</wfw:comment><comments>http://www.cppblog.com/a542343910/archive/2012/07/31/185791.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/a542343910/comments/commentRss/185791.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/a542343910/services/trackbacks/185791.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.cppblog.com/a542343910/archive/2012/07/31/185791.html'>阅读全文</a><img src ="http://www.cppblog.com/a542343910/aggbug/185791.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/a542343910/" target="_blank">bigrabbit</a> 2012-07-31 22:36 <a href="http://www.cppblog.com/a542343910/archive/2012/07/31/185791.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>back up之线段树当平衡树用</title><link>http://www.cppblog.com/a542343910/archive/2012/07/26/185160.html</link><dc:creator>bigrabbit</dc:creator><author>bigrabbit</author><pubDate>Thu, 26 Jul 2012 04:14:00 GMT</pubDate><guid>http://www.cppblog.com/a542343910/archive/2012/07/26/185160.html</guid><wfw:comment>http://www.cppblog.com/a542343910/comments/185160.html</wfw:comment><comments>http://www.cppblog.com/a542343910/archive/2012/07/26/185160.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/a542343910/comments/commentRss/185160.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/a542343910/services/trackbacks/185160.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.cppblog.com/a542343910/archive/2012/07/26/185160.html'>阅读全文</a><img src ="http://www.cppblog.com/a542343910/aggbug/185160.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/a542343910/" target="_blank">bigrabbit</a> 2012-07-26 12:14 <a href="http://www.cppblog.com/a542343910/archive/2012/07/26/185160.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>UVA 10801 Lift Hopping</title><link>http://www.cppblog.com/a542343910/archive/2012/07/22/184662.html</link><dc:creator>bigrabbit</dc:creator><author>bigrabbit</author><pubDate>Sun, 22 Jul 2012 15:43:00 GMT</pubDate><guid>http://www.cppblog.com/a542343910/archive/2012/07/22/184662.html</guid><wfw:comment>http://www.cppblog.com/a542343910/comments/184662.html</wfw:comment><comments>http://www.cppblog.com/a542343910/archive/2012/07/22/184662.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/a542343910/comments/commentRss/184662.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/a542343910/services/trackbacks/184662.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: UVA 10801 Lift Hopping&nbsp;&nbsp;<a href='http://www.cppblog.com/a542343910/archive/2012/07/22/184662.html'>阅读全文</a><img src ="http://www.cppblog.com/a542343910/aggbug/184662.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/a542343910/" target="_blank">bigrabbit</a> 2012-07-22 23:43 <a href="http://www.cppblog.com/a542343910/archive/2012/07/22/184662.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>uva10557 图的杂题</title><link>http://www.cppblog.com/a542343910/archive/2012/07/13/183116.html</link><dc:creator>bigrabbit</dc:creator><author>bigrabbit</author><pubDate>Fri, 13 Jul 2012 01:02:00 GMT</pubDate><guid>http://www.cppblog.com/a542343910/archive/2012/07/13/183116.html</guid><wfw:comment>http://www.cppblog.com/a542343910/comments/183116.html</wfw:comment><comments>http://www.cppblog.com/a542343910/archive/2012/07/13/183116.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/a542343910/comments/commentRss/183116.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/a542343910/services/trackbacks/183116.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.cppblog.com/a542343910/archive/2012/07/13/183116.html'>阅读全文</a><img src ="http://www.cppblog.com/a542343910/aggbug/183116.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/a542343910/" target="_blank">bigrabbit</a> 2012-07-13 09:02 <a href="http://www.cppblog.com/a542343910/archive/2012/07/13/183116.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>武大校赛总结</title><link>http://www.cppblog.com/a542343910/archive/2012/04/30/173247.html</link><dc:creator>bigrabbit</dc:creator><author>bigrabbit</author><pubDate>Mon, 30 Apr 2012 08:30:00 GMT</pubDate><guid>http://www.cppblog.com/a542343910/archive/2012/04/30/173247.html</guid><wfw:comment>http://www.cppblog.com/a542343910/comments/173247.html</wfw:comment><comments>http://www.cppblog.com/a542343910/archive/2012/04/30/173247.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/a542343910/comments/commentRss/173247.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/a542343910/services/trackbacks/173247.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.cppblog.com/a542343910/archive/2012/04/30/173247.html'>阅读全文</a><img src ="http://www.cppblog.com/a542343910/aggbug/173247.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/a542343910/" target="_blank">bigrabbit</a> 2012-04-30 16:30 <a href="http://www.cppblog.com/a542343910/archive/2012/04/30/173247.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>智商低。。。</title><link>http://www.cppblog.com/a542343910/archive/2012/04/22/172347.html</link><dc:creator>bigrabbit</dc:creator><author>bigrabbit</author><pubDate>Sun, 22 Apr 2012 09:23:00 GMT</pubDate><guid>http://www.cppblog.com/a542343910/archive/2012/04/22/172347.html</guid><wfw:comment>http://www.cppblog.com/a542343910/comments/172347.html</wfw:comment><comments>http://www.cppblog.com/a542343910/archive/2012/04/22/172347.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/a542343910/comments/commentRss/172347.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/a542343910/services/trackbacks/172347.html</trackback:ping><description><![CDATA[今天做了次CF，两个小时比赛时间。。用一小时水了两题之后，又用一个小时的龟速想了一个不知道什么玩意的玩意，比赛没A掉，比赛结束Ａ掉了。为什么要想那么久呢。。。。。。水题也要想那么久。。。。。小细节处理不好。。。。。<br />不过话说CF的题目不错，不像广大中文OJ的无脑题<br /><a href="http://codeforces.com/problemset/problem/180/E">http://codeforces.com/problemset/problem/180/E</a>&nbsp;<br />不贴代码了。<br /><br /><br /><img src ="http://www.cppblog.com/a542343910/aggbug/172347.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/a542343910/" target="_blank">bigrabbit</a> 2012-04-22 17:23 <a href="http://www.cppblog.com/a542343910/archive/2012/04/22/172347.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>