Decision Trees SJSU Computer Science Department决策树州立圣何塞大学计算机科学系.pptVIP

Decision Trees SJSU Computer Science Department决策树州立圣何塞大学计算机科学系.ppt

  1. 1、本文档共14页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
* * * * DECISION TREES Asher Moody, CS 157B Overview Definition Motivation Algorithms ID3 Example Entropy Information Gain Applications Conclusion Decision Tree Decision trees are a fundamental technique used in data mining. Decision trees are used for classification, clustering, feature selection, and prediction. Motivation Decision trees help accurate classify data Decision trees help understand the predictive nature of the data by recognizing patterns Decision trees depict the relationships between input data and target outputs Algorithms Decision trees algorithms are greedy so once test has been selected to partition the data other options will not be explored Popular Algorithms Computer Science: ID3, C4.5, and C5.0 Statistics: Classification and Regression Trees (CART) ID3 Algorithm Given: Examples(S); Target attribute (C); Attributes (R) Initialize Root Function ID3 (S,C,R) Create a Root node for the tree IF S = empty, return a single node with value Failure; IF S = C, return a single node C; IF R = empty, return a single node with most frequent target attribute (C); ELSE BEGIN… (next slide) ID3 (cont) BEGIN Let D be the attribute with largest Gain Radio (D, S) among attributes in R; Let {dj | j = 1, 2, …, n} be the values of attribute D; Let {Sj | j = 1, 2, …, n} be the subsets of S consisting respectively of records with value dj for attribute D; Return a tree with root labeled D arcs d1, d2, …, dn going respectively to the trees; For each branch in the tree IF S = empty, add a new branch with most frequent C; ELSE ID3 (S1, C, R – {D}), ID3 (S2, C, R – {D}), …, IDC(Sn, C, R – {D}) END ID3 Return Root Example 1 Example 2 Entropy Entropy gives us a measure of how uncertain we are about the data Maximum: The measure should be maximal if all the outcomes are equally likely (uncertainty is highest when all possible events are equiprobable). where Pi is the proportion of instances in the dataset that take the ith value of the target attribute Informat

您可能关注的文档

文档评论(0)

chenchena + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档