• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            a tutorial on computer science

              C++博客 :: 首頁 :: 新隨筆 :: 聯系 :: 聚合  :: 管理 ::
              21 隨筆 :: 0 文章 :: 17 評論 :: 0 Trackbacks

            #

            stander random forest:  random K features, enum all values as split, find best split.

            LINKS:https://en.wikipedia.org/wiki/Random_forest


            Extremely randomized trees: random K features, random a split value, find best split.
            ensemble Extremely randomized trees: use all data.

            LINKS:http://docs.opencv.org/2.4/modules/ml/doc/ertrees.html

            1. Extremely randomized trees don’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.
            2. 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.

              Extremely randomized trees用了所有的樣本作為訓練集;Extremely randomized trees隨機選一個特征和一個值作為分割標準;

              LINKS:http://scikit-learn.org/stable/modules/generated/sklearn.tree.ExtraTreeRegressor.html#sklearn.tree.ExtraTreeRegressor

              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.

              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 
              max_features randomly selected features and the best split among those is chosen. When max_features is set 1, this amounts to building a totally random decision tree.

              extra-trees 的ensemble用了bagging,然后選取多個特征,每個特征隨機選一個值作為分割標準建樹。

              一種實現方法:
                     樣本bagging, random n features & random k values ,求最優,建樹。 

            posted @ 2016-02-28 21:01 bigrabbit 閱讀(338) | 評論 (0)編輯 收藏

            主要類:
            CCNode

               CCDirector
               CCScene
               CCLayer


            定時更新:

               [[[CCDirector sharedDirector] scheduler] scheduleUpdateForTarget:self priority:0 paused:NO];

               //[[[CCDirector sharedDirector] scheduler] unscheduleUpdateForTarget:self];

            接收輸入:
               v0.99

                  CCStandardTouchDelegate

                  CCTargetedTouchDelegate

               v2.10

                  CCTouchOneByOneDelegate

                  CCTouchAllAtOnceDelegate

               [[[CCDirector sharedDirector] touchDispatcher] addTargetedDelegate:self priority:0 swallowsTouches:YES];

               //[[[CCDirector sharedDirector] touchDispatcher] removeDelegate:self];


            坐標系統:
               position是設置相對于父親節點的坐標
               self.anchorPoint和self.position重合


            多層:
               [cclayer.addchild cclayer];
               一層疊一層

            posted @ 2014-05-15 21:14 bigrabbit 閱讀(282) | 評論 (0)編輯 收藏

                 摘要:   閱讀全文
            posted @ 2012-10-24 22:47 bigrabbit 閱讀(535) | 評論 (0)編輯 收藏

                 摘要:   閱讀全文
            posted @ 2012-08-02 15:36 bigrabbit 閱讀(986) | 評論 (0)編輯 收藏

                 摘要:   閱讀全文
            posted @ 2012-07-31 22:36 bigrabbit 閱讀(668) | 評論 (0)編輯 收藏

                 摘要:   閱讀全文
            posted @ 2012-07-26 12:14 bigrabbit 閱讀(201) | 評論 (0)編輯 收藏

                 摘要: UVA 10801 Lift Hopping  閱讀全文
            posted @ 2012-07-22 23:43 bigrabbit 閱讀(1163) | 評論 (0)編輯 收藏

                 摘要:   閱讀全文
            posted @ 2012-07-13 09:02 bigrabbit 閱讀(1134) | 評論 (0)編輯 收藏

                 摘要:   閱讀全文
            posted @ 2012-04-30 16:30 bigrabbit 閱讀(444) | 評論 (1)編輯 收藏

            今天做了次CF,兩個小時比賽時間。。用一小時水了兩題之后,又用一個小時的龜速想了一個不知道什么玩意的玩意,比賽沒A掉,比賽結束A掉了。為什么要想那么久呢。。。。。。水題也要想那么久。。。。。小細節處理不好。。。。。
            不過話說CF的題目不錯,不像廣大中文OJ的無腦題
            http://codeforces.com/problemset/problem/180/E 
            不貼代碼了。


            posted @ 2012-04-22 17:23 bigrabbit 閱讀(329) | 評論 (0)編輯 收藏

            僅列出標題
            共3頁: 1 2 3 
            国内精品伊人久久久久777| 欧洲精品久久久av无码电影| 久久精品人成免费| 99久久婷婷国产一区二区| 久久综合一区二区无码| 一级a性色生活片久久无少妇一级婬片免费放 | 99久久无码一区人妻a黑| 欧美久久精品一级c片片| 一级a性色生活片久久无少妇一级婬片免费放 | 94久久国产乱子伦精品免费| 精品久久久久久亚洲精品| 性高湖久久久久久久久AAAAA| 999久久久免费精品国产| 久久精品人人槡人妻人人玩AV| 久久久久亚洲AV综合波多野结衣| 91视频国产91久久久| 国产亚洲精品自在久久| 久久精品成人免费看| AAA级久久久精品无码片| 国产欧美久久一区二区| 99re久久精品国产首页2020| 国产精品一区二区久久国产| 国产成人精品免费久久久久| 日日噜噜夜夜狠狠久久丁香五月| 久久免费的精品国产V∧| 91精品国产高清91久久久久久| 久久精品无码午夜福利理论片| 久久er国产精品免费观看2| A级毛片无码久久精品免费| 91精品国产91久久久久久| 国产精品99久久久久久宅男小说| 狠狠综合久久综合88亚洲| 日本久久久精品中文字幕| 伊人久久大香线蕉AV色婷婷色| 中文字幕成人精品久久不卡| 狠狠色丁香婷婷久久综合五月| 久久九九有精品国产23百花影院| 亚洲欧美日韩精品久久亚洲区 | 777午夜精品久久av蜜臀| 久久电影网一区| 亚洲精品乱码久久久久久自慰|