Fall 2018 - CMPT 419 D100

Special Topics in Artificial Intelligence (3)

Machine Learning

Class Number: 8414

Delivery Method: In Person

Overview

  • Course Times + Location:

    Sep 4 – Dec 3, 2018: Mon, Wed, 4:30–5:50 p.m.
    Burnaby

  • Exam Times + Location:

    Dec 8, 2018
    Sat, 7:00–10:00 p.m.
    Burnaby

Description

CALENDAR DESCRIPTION:

Current topics in artificial intelligence depending on faculty and student interest.

COURSE DETAILS:

Machine Learning is the study of computer algorithms that improve automatically through experience. Machine learning algorithms play an important role in industrial applications and commercial data analysis. The goal of this course is to present students with both the theoretical justification for, and practical application of, machine learning algorithms. Students in the course will gain hands-on experience with major machine learning tools and their applications to real-world data sets. This course will cover techniques in supervised and unsupervised learning, neural networks / deep learning, the graphical model formalism, and algorithms for combining models. This course is intended for graduate students who are interested in machine learning or who conduct research in fields which use machine learning, such as computer vision, natural language processing, data mining, bioinformatics, and robotics. No previous knowledge of pattern recognition or machine learning concepts is assumed, but students are expected to have, or obtain, background knowledge in mathematics and statistics. A very strong mathematics background will be required for this course. It is strongly recommended that students have completed all CS major math requirements: MATH 151, 152, 240, MACM 316, STAT 270 with an A average. It is also recommended that students have taken some of MATH 251, 252, 254, 308, 309.

Topics

  • Graphical models: directed and undirected graphs
  • Inference algorithms: junction tree, belief propagation, variational inference, Markov Chain Monte Carlo, Gibbs sampling
  • Temporal models and algorithms: hidden Markov Models, Kalman filtering, particle filtering
  • Classification: nearest neighbour, support vector machines, decision trees, naive Bayes, Fisher's linear discriminant
  • Regression: linear regression, logistic regression, regularization
  • Unsupervised learning: spectral clustering, kmeans
  • Expectation-maximization
  • Kernel density estimation
  • Boosting
  • Deep learning

Grading

NOTES:

The course grade will be based on homework assignments, a project, and exams.

Materials

MATERIALS + SUPPLIES:

  1. The Elements of Statistical Learning, Trevor Hastie, Robert Tibshirani, and Jerome Friedman, Springer-Verlag, 2009, 9780387848570
  2. Machine Learning, Tom Mitchell, McGraw Hill, 1997, 9780070428072
  3. Pattern Classification (2nd ed.), Richard O. Duda, Peter E. Hart, and David G. Stork, Wiley Interscience, 2000, 9780471056690
  4. All of Statistics, Larry Wasserman, Springer, 2010, 9781441923226

REQUIRED READING:

  • Pattern Recognition and Machine Learning
  • Christopher M. Bishop
  • Springer
  • 2006

ISBN: 9780387310732

Registrar Notes:

SFU’s Academic Integrity web site http://students.sfu.ca/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating.  Check out the site for more information and videos that help explain the issues in plain English.

Each student is responsible for his or her conduct as it affects the University community.  Academic dishonesty, in whatever form, is ultimately destructive of the values of the University. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the University. http://www.sfu.ca/policies/gazette/student/s10-01.html

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS