CSI 5v93: Machine Learning, Spring 2006
- Mon Jan 9 10:58:04 CST 2006
- Welcome to the course! The first assignment is posted.
This is a course in machine learning, a subfield of artificial intelligence. Machine learning is a very big, 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, or make inferences, from data. Further, we would like to use the learned models to make predictions about unknowns.
This course covers:
- introduction to machine learning
- supervised and unsupervised learning
- models for regression and classification, including linear methods, naive bayes, kernels, and support vector machines
- statistical and mathematical methods for learning
- model assessment
- recent research in the field
- experiments with the concepts learned
This list of topics is optimistic. Be prepared to invest the time necessary to understand the concepts, and to do the programming projects. My best advice is to attend the lectures, read the book, ask questions, and start projects early.
Lectures are from 11:00 AM to 11:50 AM in Rogers 210 on Mondays, Wednesdays, and Fridays.
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.
Here is an aggressive schedule of the material we will cover:
|Week||Dates||New topics||Reading||Lecture notes||Monday||Wednesday||Friday|
|1||Jan 9-13||Introduction, linear models||1, 2||Homework 1|
|2||Jan 16-20||MLK holiday|
|3||Jan 23-27||Linear regression methods||3|
|4||Jan 30-Feb 3||Homework 2|
|5||Feb 6-10||Linear classification methods||4|
|7||Feb 20-24||Support Vector Machines||4.5, 12.1-12.3|
|8||Feb 27-Mar 3||Homework 3|
|9||Mar 6-10||Bayesian learning||Mitchell 6||Midterm|
|Mar 13-17||Spring break|
|11||Mar 27-31||Unsupervised learning||14|
|13||Apr 10-14||ICPC||ICPC||Easter holiday|
|14||Apr 17-21||Student presentations||Easter holiday||Josh - HMMs||Sean - SVM probabilities|
|15||Apr 24-28||Student presentations||Greg - Decision trees||Noah - Boosting||Joe - Feature selection|
|16||May 1-5||Student presentations||Bharat - ?||Study days|
The final exam is on Tuesday, May 9th, between 9-11 AM. The latest university finals information is available here.
Textbooks & resources
Required text: we will be using The Elements of Statistical Learning: Data Mining, Inference, and Prediction by Trevor Hastie, Robert Tibshirani, and Jerome Friedman. You can purchase this book from the Baylor bookstore or amazon, among other places.
Further online resources:
- We will use Blackboard as a class discussion board. Feel free to post questions and responses there which do not violate the non-collaboration agreement.
- Andrew Moore has a number of nice tutorials on topics related to machine learning
- Tommi Jaakkola and MIT OpenCourseWare have provided a machine learning course with course materials available online
- KDD dataset repository -- has many popular machine-learning datasets
- Matlab tutorial
- LaTeX introduction, another LaTeX introduction, LaTeX reference
- Matrix reference manual
Grades will be assigned based on this breakdown:
- paper presentation: 15%
- projects: 40%
- midterm exam: 15%
- final exam: 30%
Here is a tentative grading scale:
A: 90-100, B+: 88-89, B: 80-87, C+: 78-79, C: 70-77, D: 60-69, F: 0-59
Some projects may be worth more than others. Exams are closed-book. The final will be comprehensive.
- Check this website every day for updates and announcements. We only meet three times a week, but I may post updates at any time. It is your responsibility to follow these updates by reading this website.
- All work in this course is strictly individual, unless the instructor explicitly states otherwise. While discussion of course material is encouraged, collaboration on any work for the course is not allowed. Collaboration includes (but is not limited to) discussing with anyone other than the professor any material that is specific to completing an assignment. You are encouraged to discuss the course material with the professor, preferably in office hours, and also by email.
- Baylor policy requires 75% class attendance from each student. Even "excused" absences are included in the overall absent count. If a student attends less than 75% of the classes, he or she will automatically fail the course.
- In order to facilitate keeping attendance, on the second class meeting I will ask you to choose a seat for the rest of the course. Please sit in your chosen seat for the remainder of the course.
- Projects which are late are not accepted. Exams are the only things which may be made up with prior arrangement (made at least one class before to the exam) or due to illness, with a note from a health care professional.
- Bring any grading correction requests to my attention within 2 weeks of receiving the grade or before the end of the semester, whichever comes first. After that, I will not adjust your grade. If you find any mistake in grading, please let me know.
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.
- Copying another student's work. Simply looking over someone else's source code is copying.
- Providing your work for another student to copy.
- Collaboration on any assignment, unless the work is explicitly given as collaborative work.
- Using notes or books during any exam.
- Giving another student answers during an exam.
- Reviewing a stolen copy of an exam.
- Studying tests or using assignments from previous semesters.
- Providing someone with tests or assignments from previous semesters.
- Taking an exam for someone else.
- Turning in someone else's work as your own work.
- Studying a copy of an exam prior to taking a make-up exam.
- Providing a copy of an exam to someone who is going to take a make-up exam.
- Giving test questions to students in another class.
- Reviewing previous copies of the instructor's tests without permission from the instructor.