• <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 閱讀(327) | 評論 (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 閱讀(270) | 評論 (0)編輯 收藏

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

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

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

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

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

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

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

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


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

            僅列出標題
            共3頁: 1 2 3 
            国产高清美女一级a毛片久久w | 国产成人综合久久精品尤物| 色欲久久久天天天综合网| 日本人妻丰满熟妇久久久久久| 国产91色综合久久免费| 久久精品国产精品亚洲艾草网美妙| 性做久久久久久免费观看| 99国产欧美精品久久久蜜芽| 久久精品国产一区二区三区| 亚洲综合精品香蕉久久网| 精品久久久久一区二区三区| 久久精品日日躁夜夜躁欧美| 中文精品久久久久国产网址| 伊人久久久AV老熟妇色| 99国内精品久久久久久久| 午夜精品久久久久久毛片| 久久综合久久性久99毛片| 国产精品一区二区久久精品| 国产成人精品综合久久久久| 精品久久久久久无码中文字幕| 国内精品久久久久伊人av| 亚洲精品国产综合久久一线| 香蕉久久夜色精品国产小说| 精品人妻久久久久久888| 7777久久久国产精品消防器材 | 97久久精品人妻人人搡人人玩| 欧美性大战久久久久久| 国产日韩欧美久久| 99久久国产亚洲高清观看2024 | 久久精品一区二区三区AV| 久久综合伊人77777| 国产精品伊人久久伊人电影| 麻豆精品久久久一区二区| 久久久精品午夜免费不卡| 99精品久久精品一区二区| 久久精品www| 99久久精品无码一区二区毛片| 7国产欧美日韩综合天堂中文久久久久 | 亚洲天堂久久久| 国产精品久久久久久久久久影院| 久久无码人妻精品一区二区三区|