CSI 5325: Introduction to Machine Learning, Spring 2018

Objectives

This is a course in machine learning, which is a broad, interesting, and fast-growing field. The central problem we address in this class is how to use the computer to make models which can learn, make inferences, or improve its behavior, based on observations about the world. Further, we would like to use the learned models to make predictions about unknowns.

Machine learning is related to artificial intelligence, but also uses a lot of computer science, statistics, logic, probability, information theory, geometry, linear algebra, calculus, optimization theory, etc. It would be good to brush up on these topics if they're rusty.

Practical information

Lectures are from 09:30 to 10:45 in Cashion C315 on Tuesdays and Thursdays.

My office hours are listed on my home page. I am glad to talk to students during and outside of office hours. If you can't come to my office hour, please email me to make an appointment at another time.

Assignments

Semester project

Here are guidelines on the semester project.

Two important updates (2018-04-03):

Schedule

Here is a schedule of the topics we will cover, which is subject to change. Chapters are from the course textbook, Learning from Data. I'll primarily be using lecture slides from Magdon-Ismail.

The midterm exam will be in class Tuesday, February 27th.

The final exam will be on May 7 at 9:00 AM. For the latest university finals information, check here.

Textbooks & resources

This semester we will follow a newer book, Learning From Data by Abu-Mostafa, Magdon-Ismail, and Lin. The textbook has several electronic chapters available for free to those who have the physical textbook. To obtain them, you will need the login information, which are username 'bookreaders', with password being the first word on page 27 of the book.

We may also be reading from some papers in the research literature.

Other texts (I may draw some material from these):

Further online resources:

Grading

Grades will be assigned based on this breakdown:

Here is a tentative grading scale:
F < 60 ≤ D- < 62 ≤ D < 67 ≤ D+ < 70 ≤ C- < 72 ≤ C < 78 ≤ C+ < 80 ≤ B- < 82 ≤ B < 88 ≤ B+ < 90 ≤ A- < 92 ≤ A

Some projects may be worth more than others. Exams are closed-book. The final will be comprehensive.

Policies

Academic honesty

I take academic honesty very seriously.

Many studies, including one by Sheilah Maramark and Mindi Barth Maline have suggested that "some students cheat because of ignorance, uncertainty, or confusion regarding what behaviors constitute dishonesty" (Maramark and Maline, Issues in Education: Academic Dishonesty Among College Students, U.S. Department of Education, Office of Research, August 1993, page 5). In an effort to reduce misunderstandings in this course, a minimal list of activities that will be considered cheating have been listed below.


Copyright © 2018 Greg Hamerly, with some content taken from a syllabus by Jeff Donahoo.
Computer Science Department
Baylor University

valid html and css