- 1、本文档共24页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
用R实现随机森林的分类与回归
第五届中国R语言会议 北京2012 李欣海
用R实现随机森林的分类与回归
Applications of Random Forest using R
Classification and Regression
李欣海
中科院动物所
邮件:lixh@//0.
主页:////.
博客:////.
微博:////. 第五届中国R语言会议 北京2012 李欣海
随机森林简介
Random Forest
////.
an-introduction-to-data-mining-for-marketing-and-business-intelligence/Random Forest is an ensemble classifier that
consists of many decision trees It outputs the class that is the mode of the classs
output by individual trees Breiman 2001 It deals with “small n large p”-problems, high-order
interactions, correlated predictor variables.
Breiman, L. 2001. Random forests. Machine Learning 45:5-32. Being cited 6500 times until 20123/25 第五届中国R语言会议 北京2012 李欣海
随机森林简介
History
////.
an-introduction-to-data-mining-for-marketing-and-business-intelligence/
The algorithm for inducing a random forest was developed by
Leo Breiman 2001 and Adele Cutler, and Random Forests is
their trademarkThe term came from random decision forests that was first
proposed by Tin Kam Ho of Bell Labs in 1995The method combines Breimans bagging idea and the
random selection of features, introduced independently by Ho
1995 and Amit and Geman 1997 in order to construct a
collection of decision trees with controlled variation.4/25 第五届中国R语言会议 北京2012 李欣海
随机森林简介
Tree models
y β + β x + β x + β x + ε
i 0 1 1i 2 2 i 3 3i i
Classification tree
Regression tree
Crawley 2007 The R Book p691 Crawley 2007 The R Book p6945/25 第五届中国R语言会议 北京2012 李欣海
随机森林简介
The statistical community uses irrelevant theory,
questionable conclusions?
David R. Cox Emanuel Parzen Bruce Hoadley
Brad Efron
NO YES6/25 第五届中国R语言会议 北京2012 李欣海
随机森林简介
Ensemble classifiers
////.
Tree models are simple, often produce noisy bushy or weak
stunted classifiers Bagging Breiman, 1996: Fit many large trees to bootstrap-
resampled versions of the training data, and classify by majority vote Boosting Freund Shapire, 1996: Fit many large or small trees to
reweighted versions of the training data. Classify
您可能关注的文档
最近下载
- 《2023年甘肃省职业院校技能大赛职业英语技能赛项职业英语能力测试模块试题口语决赛样题》.pdf
- 建筑工程建筑面积计算规范GBT50353-2022[13].pdf
- JB/T 9628-1999 汽轮机叶片 磁粉探伤方法.pdf
- 0i-TF PLUS车床操作说明书.pdf
- 陈传明管理学笔记1.马工程——总论.pdf
- 06J925-2 压型钢板、夹芯板屋面及墙体建筑构造(二).docx VIP
- 《高速公路基础设施数字化建设数据标准》.pdf VIP
- 计算机组装与维护 知识点整理.pdf VIP
- 《员工满意度研究国内外文献综述》3900字.docx VIP
- 勤俭节约主题班会 主题班会.ppt VIP
文档评论(0)