A Recommendation on How to Teach K-Means in Introductory Analytics Courses

M. Thulasidas
{"title":"A Recommendation on How to Teach K-Means in Introductory Analytics Courses","authors":"M. Thulasidas","doi":"10.1109/TALE54877.2022.00016","DOIUrl":null,"url":null,"abstract":"We teach K-Means clustering in introductory data analytics courses because it is one of the simplest and most widely used unsupervised machine learning algorithms. However, one drawback of this algorithm is that it does not offer a clear method to determine the appropriate number of clusters; it does not have a built-in mechanism for K selection. What is usually taught as the solution for the K Selection problem is the so-called elbow method, where we look at the incremental changes in some quality metric (usually, the sum of squared errors, SSE), trying to find a sudden change. In addition to SSE, we can find many other metrics and methods in the literature. In this paper, we survey several of them, and conclude that the Variance Ratio Criterion (VRC) is an appropriate metric we should consider teaching for K Selection. From a pedagogical perspective, VRC has desirable mathematical properties, which help emphasize the statistical underpinnings of the algorithm, thereby reinforcing the students’ understanding through experiential learning. We also list the key concepts targeted by the VRC approach and provide ideas for assignments.","PeriodicalId":369501,"journal":{"name":"2022 IEEE International Conference on Teaching, Assessment and Learning for Engineering (TALE)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Teaching, Assessment and Learning for Engineering (TALE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TALE54877.2022.00016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We teach K-Means clustering in introductory data analytics courses because it is one of the simplest and most widely used unsupervised machine learning algorithms. However, one drawback of this algorithm is that it does not offer a clear method to determine the appropriate number of clusters; it does not have a built-in mechanism for K selection. What is usually taught as the solution for the K Selection problem is the so-called elbow method, where we look at the incremental changes in some quality metric (usually, the sum of squared errors, SSE), trying to find a sudden change. In addition to SSE, we can find many other metrics and methods in the literature. In this paper, we survey several of them, and conclude that the Variance Ratio Criterion (VRC) is an appropriate metric we should consider teaching for K Selection. From a pedagogical perspective, VRC has desirable mathematical properties, which help emphasize the statistical underpinnings of the algorithm, thereby reinforcing the students’ understanding through experiential learning. We also list the key concepts targeted by the VRC approach and provide ideas for assignments.
关于如何在分析学入门课程中教授K-Means的建议
我们在数据分析入门课程中教授K-Means聚类,因为它是最简单和最广泛使用的无监督机器学习算法之一。然而,该算法的一个缺点是它没有提供一个明确的方法来确定适当的簇数;它没有一个内置的K选择机制。通常教授的K选择问题的解决方案是所谓的肘部方法,我们在某些质量度量(通常是平方误差和SSE)中观察增量变化,试图找到突然变化。除了SSE,我们还可以在文献中找到许多其他指标和方法。在本文中,我们调查了其中的几个,并得出结论,方差比准则(VRC)是一个合适的度量,我们应该考虑K选择教学。从教学的角度来看,VRC具有理想的数学特性,有助于强调算法的统计基础,从而通过体验式学习加强学生的理解。我们还列出了VRC方法所针对的关键概念,并为作业提供了思路。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信