1
This course is a broad introduction to the field of Machine Learning. We will cover a number of classic and current machine learning algorithms, and show how they can be applied to a variety of real world problems.
From the course catalog:
Formerly CS 527A. The field of machine learning is concerned with the question of how to construct computer programs that automatically improve with experience. Recently, many successful machine learning applications have been developed, ranging from data-mining programs that learn to detect fraudulent credit card transactions, to information-filtering systems that learn users' reading preferences, to autonomous vehicles that learn to drive. There have also been important advances in the theory and algorithms that form the foundation of this field. This course will provide a broad introduction to the field of machine learning.
| Instructor: | Bill Smart, wds@cse.wustl.edu |
| Office Hours: | Lopata 516, by appointment |
| Stu Glaser, stuglaser@gmail.com | Hours: Sunday, 14:30-16:30, TA Grader Lounge | |
| Yunpeng Xu, xu_yunpeng@hotmail.com | Hours: Monday & Friday 15:00-16:00, TA Grader Lounge |
Another good book that covers a subset of the material in the class is "Machine Learning", Tom Mitchell, McGraw-Hill, 1997. This is a slightly older book, and doesn't cover some of the newer material in Alpaydin. However, it's still a good reference, especially if you can pick it up second-hand.
| Number | Topics | Assigned | Due | |||
| Homework 1 | Instance-based algorithms | January 30 | February 12, 23:59:59 | |||
| Homework 2 | Decision trees | February 13 | February 27, 19:15 | |||
| Homework 3 | Bayesian learning | March 4 | March 26, 16:59:59 | |||
| Homework 4 | Artificial neural networks and reinforcement learning | March 29 | April 16, 17:00 | |||
| Homework 5 | TBD | TBD | TBD |
There will be a number of homework assignments, worth a total of 70% of class grade. There will also be a final project, worth 30% of the total grade. Each of the homework assignments will have extra credit questions available. Grades for the class will be assigned as follows:
Score Grade 85+ A 75+ B 65+ C 55+ D 0+ F
The late policy for the class is 10% per day late, up to a maximum of three days. If you're more than three days late on an assignment, you get zero points for that assignment. If you have some valid reason for needing more time on an assignment, then you should contact me at least two days before the deadline to request an extension. Last-minute requests will only be met in exceptional circumstances.
Everything that you turn in for this class, and your answers on all of the quizzes and exams must be your own work, unless we explicitly tell you otherwise. If you willfully misrepresent someone else's work as your own, you are guilty of cheating. Cheating, in any form, will not be tolerated in this class.
If you are guilty of cheating on any assignment, quiz, exam, or project, you will be penalized the number of points that the assignment is worth. For example, if you cheat on an assignment worth 10% of the final grade, you will be receive -10% for that assignment. If you copy from someone else in the class both parties will be penalized, regardless of which direction the information flowed. Two or more instances of cheating in the course will be referred to the School of Engineering Discipline Committee, and will result in an F in the class.
We will follow the guidelines of the University Undergraduate Academic Integrity Policy, but we reserve the right to make the final determination of what constitutes cheating for this class. If you suspect that you may be entering an ambiguous situation, it is your responsibility to clarify it before the professor or TAs detect it. If in doubt, please ask.
| Page written by Bill Smart. |