2024-2025 Korea University International Winter Campus
IWC426 – Introduction to Machine Learning
Ⅰ. Instructor
Professor Yeil Kwon
E-mail [Link]@[Link]
Home Institution Wichita State University
Class Time 13:30 pm - 16:25 pm
Class Format In-person
Office TBA
Office Hours By Appointment (in-person or online via Zoom)
Ⅱ. Textbook
Required Textbook None
Recommended Gareth James, Daniela Witten, Trevor Hastie, Robert Tibshirani:
Additional Readings An Intro. to Statistical Learning with Applications in R, Springer, 2013.
Ⅲ. Course Description and Objectives
This course provides an introduction to the fundamental methods and algorithms used in machine
learning, with a primary focus on supervised learning models with cross-validation techniques. Key
topics covered include: (1) Regression Models: Exploration of various regression models such as
ordinary least squares, ridge regression, and lasso, (2) Classification Techniques: a comprehensive
study of classification methods including logistic regression, Naïve Bayesian classifier, K-Nearest
Neighbors, Linear Discriminant Analysis, and its extension to Quadratic Discriminant Analysis, (3)
Tree-Based Models: traditional tree-based models for both regression and classification, along with
advanced tree ensemble methods like bagging and random forests, (4) Support Vector Machines
(SVM): An in-depth look into support vector classifier and SVM and their application in classification
tasks. If time permits, the course will also cover unsupervised learning techniques, including cluster
analysis and principal components analysis. Throughout the course, methods will be applied to
datasets of varying sizes and complexities.
[Remark] to succeed in this course, students should have a moderate understanding of statistics
and programming skills. Students are encouraged to bring their laptops to every class for hands-on
practice and application.
Upon completion of this course, students should be able to
1. Develop an appreciation for what is involved in learning models from data.
2. Understand a wide variety of learning algorithms.
3. Understand how to evaluate models generated from data.
4. Apply the algorithms to a real-world problem, optimize the models learned, and report on
the expected accuracy that can be achieved by applying the models.
Ⅳ. Grading
Regular attendance is mandatory for all lectures. Documented excuses for
Attendance
absence must be submitted before the scheduled class. In exceptional case,
(10%)
valid excuses supported by formal document will be considered after the class.
Assignment 1
Chapter 2 (due date: Thursday, Jan. 2)
(15%)
Assignment 2
Chapter 3 (due date: Monday, Jan. 6)
(20%)
Assignment 3
Chapter 5 (due date: Friday, Jan 10)
(20%)
Presentation
Team Project
(35%)
Attendance Surpassing 30% in absences will result in an automatic ‘F,’ irrespective of
Policy classwork and exam performance.
Letter Grade A+ A B+ B C+ C D+ D F
Score 95-100 90-94 85-89 80-84 75-79 70-74 65-69 60-64 0-59
Ⅴ. Class Outline
Date Topic Chap Remarks
Dec. 24 (Wed) Orientation / Introduction 1
Dec. 26 (Thu) Fundamental Concepts of Machine Learning 2
Dec. 27 (Fri) Simple & Multiple Linear Regression Model 3
Dec. 30 (Mon) Naïve Bayes / K-Nearest Neighbour 4
Dec. 31 (Tue) Logistic Regression / Linear & Quadratic Discriminant Analysis 4
Jan. 2 (Thu) Cross Validations & Bootstrap 5 Assignment1
Jan. 3 (Fri) Shrinkage Methods: Ridge Regression & Lasso 5
Jan. 4 (Sat) Tree-based Models: Regression & Classification Tree 6
Jan. 6 (Mon) Enhanced Trees: Bagging & Random Forest 6 Assignment2
Jan. 7 (Tue) Support Vector Machine 8
Jan. 8 (Wed) Unsupervised learning: Clustering, Principal Components 8
Jan. 9 (Thu) Presentations 1 9 Assignment3
Jan. 10 (Fri) Presentations 2 / Graduation 6