What goes before the CART? Introducing classification trees with Arbor and CODAP

IF 1.2 Q2 EDUCATION & EDUCATIONAL RESEARCH Teaching Statistics Pub Date : 2023-06-01 DOI:10.1111/test.12347
Tim Erickson, J. Engel
{"title":"What goes before the CART? Introducing classification trees with Arbor and CODAP","authors":"Tim Erickson, J. Engel","doi":"10.1111/test.12347","DOIUrl":null,"url":null,"abstract":"This volume is largely about nontraditional data; this paper is about a nontraditional visualization: classification trees. Using trees with data will be new to many students, so rather than beginning with a computer algorithm that produces optimal trees, we suggest that students first construct their own trees, one node at a time, to explore how they work, and how well. This build‐it‐yourself process is more transparent than using algorithms such as CART; we believe it will help students not only understand the fundamentals of trees, but also better understand tree‐building algorithms when they do encounter them. And because classification is an important task in machine learning, a good foundation in trees can prepare students to better understand that emerging and important field. We also describe a free online tool—Arbor—that students can use to do this, and note some implications for instruction.","PeriodicalId":43739,"journal":{"name":"Teaching Statistics","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Teaching Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1111/test.12347","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"EDUCATION & EDUCATIONAL RESEARCH","Score":null,"Total":0}
引用次数: 1

Abstract

This volume is largely about nontraditional data; this paper is about a nontraditional visualization: classification trees. Using trees with data will be new to many students, so rather than beginning with a computer algorithm that produces optimal trees, we suggest that students first construct their own trees, one node at a time, to explore how they work, and how well. This build‐it‐yourself process is more transparent than using algorithms such as CART; we believe it will help students not only understand the fundamentals of trees, but also better understand tree‐building algorithms when they do encounter them. And because classification is an important task in machine learning, a good foundation in trees can prepare students to better understand that emerging and important field. We also describe a free online tool—Arbor—that students can use to do this, and note some implications for instruction.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在CART之前是什么?用Arbor和CODAP介绍分类树
这本书主要是关于非传统数据的;本文是关于一个非传统的可视化:分类树。对许多学生来说,将树与数据结合使用是一件新鲜事,因此,我们建议学生首先构建自己的树,一次一个节点,以探索它们的工作方式和效果,而不是从生成最佳树的计算机算法开始。这种自己构建的过程比使用CART等算法更透明;我们相信,这不仅有助于学生理解树木的基本原理,而且有助于他们在遇到树木构建算法时更好地理解它们。由于分类是机器学习中的一项重要任务,良好的树木基础可以让学生更好地理解这个新兴的重要领域。我们还描述了一个免费的在线工具Arbor,学生可以使用它来完成这项工作,并注意到一些对教学的启示。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Teaching Statistics
Teaching Statistics EDUCATION & EDUCATIONAL RESEARCH-
CiteScore
2.10
自引率
25.00%
发文量
31
期刊最新文献
Community of teaching practice informed by the discipline and scholarship Visualizing statistical edutainment: What you see is what you get Authors' response to Michael Martin Media Covid misinformation due to confounding Reducing statistics anxiety and academic procrastination among Israeli students: A pilot program
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1