0


将袋装和随机子空间相结合,创造出更好的合奏效果

Combining Bagging and Random Subspaces to Create Better Ensembles
课程网址: http://videolectures.net/ida07_panov_cbars/  
主讲教师: Panče Panov
开课单位: 约瑟夫·斯特凡学院
开课时间: 2007-10-08
课程语种: 英语
中文简介:
随机森林是构建合奏的最佳表现方法之一。他们从两个方面获得力量:使用训练数据的随机子样本(如在装袋中)和随机化算法用于学习基本级别分类器(决策树)。基础级算法在树构造的每个步骤中随机选择特征的子集,并在这些中选择最佳。我们建议使用套袋和随机子空间中使用的概念组合来实现类似的效果。后者在开始时随机选择特征的子集并使用基本级算法的确定性版本(因此有点类似于算法的随机化版本)。我们的实验结果表明,所提出的方法具有与随机森林相当的性能,并且具有适用于任何基本级算法的附加优点,而无需随机化后者。
课程简介: Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in bagging) and randomizing the algorithm for learning base-level classifiers (decision trees). The base-level algorithm randomly selects a subset of the features at each step of tree construction and chooses the best among these. We propose to use a combination of concepts used in bagging and random subspaces to achieve a similar effect. The latter randomly select a subset of the features at the start and use a deterministic version of the base-level algorithm (and is thus somewhat similar to the randomized version of the algorithm). The results of our experiments show that the proposed approach has a comparable performance to that of random forests, with the added advantage of being applicable to any base-level algorithm without the need to randomize the latter.
关 键 词: 随机森林; 决策树; 基础级算法
课程来源: 视频讲座网
最后编审: 2020-07-25:csy
阅读次数: 47