Workshop: Machine Learning in Python - Session 2
Machine聽Learning in Python - Decision Trees & Data Acquisition
翱惫别谤惫颈别飞:听Decision trees model sequential decision-making and can be used for both classification and regression tasks. This workshop will introduce you to this type of machine learning model in a hands-on way: you will train a decision tree on a given dataset. We will discuss the pros and cons of decision trees, and see how using a random forest (a collection of decision trees) helps to address some of their shortcomings.
Learning Goal(s): By the end of the workshop, participants will be able to:
- Describe with a diagram what a decision tree is.
- Describe the advantages and disadvantages of decision trees as a machine learning algorithm.
- Train a decision tree on a given data set for use in classification tasks, following guidance from instructors.
- Describe the data acquisition process in machine learning and its ethical considerations
Prereqs:聽Participants should already have some familiarity with Python programming fundamentals, e.g. loops, conditional execution, importing modules, and calling functions. Furthermore, participants should ideally have attended the first lesson in the 鈥淔undamentals of Machine Learning in Python鈥 series, or they should already have some background on the general machine learning pipeline.
Approach: Our approach is primarily student-centered. Students will work in pairs and small groups on worksheets and Jupyter notebooks, interspersed with brief lecture and instructor-led live-coding segments.
Supporting Resources:聽We will refer to many of the materials used previously in our series 鈥淐omputing Workshop鈥
顿别濒颈惫别谤补产濒别蝉:听Our resources will be made available via our web site.
Resources required:聽Participants should have access to a laptop computer. Python should be already installed with Anaconda.
Location:聽HYBRID. The聽,听room 325, and via Zoom.
滨苍蝉迟谤耻肠迟辞谤:听, Faculty Lecturer in Computer Science at 平特五不中. Eric Mayhew, Computer Science professor at Dawson College.
Registration: