OLD WEB PAGE of
CPSC 633-600 Machine Learning:
Spring 2006

Syllabus

I. General Information

Instructor:

Dr. Yoonsuck Choe
Email: choe(a)tamu.edu
Office: HRBB 322B
Phone: 845-5466
Office hours: 2:30-4pm, MW

TA:

Yingwei Yu
Email: yingweiy(a)cs.tamu.edu
Office: HRBB 322A
Phone: 845-5481
Office hours: TR 10:30-12:00

Prerequisite/Restrictions:

CPSC 420, 625, or consent of instructor.

Lectures:

MWF 12:40--1:30pm HRBB 113.

Introduction:

Machine learning is the study of self-modifying computer systems that can acquire new knowledge and improve their own performance; survey machine learning techniques, which include induction from examples, Bayesian learning, artificial neural networks, instance-based learning, genetic algorithms, reinforcement learning, unsupervised learning, and biologically motivated learning algorithms. Prerequisite: CPSC 420 or 625.

Goal:

The goal of this course is to

1. learn various problems and solution strategies in machine learning.
2. learn practical methodology for applying ML algorithms to problem domain of your choice.

Textbook:

• Tom Mitchell (1997) Machine Learning, McGraw-Hill. [Book home page]

Administrative Trivia:

1. Computer accounts: if you do not have a unix account, ask for one on the CS web page.
2. Programming languages permitted: C/C++, Java, or Matlab (or octave), and must be executable on CS unix hosts or any windows system in the departmental lab.

Topics to be covered:

See the Weekly Schedule section for more details. The content will closely reflect Mitchell (1997).

Grading:

1. 3 written + programming assignments, 18% each = 54%
2. Midterm and final exam, 15% each = 30%
3. Mini project 16%

Grading will be on the absolute scale. The cutoff for an `A' will be at most 90% of total score, 80% for a `B', 70% for a `C', and 60% for a `D'. However, these cutoffs might be lowered at the end of the semester to accomodate the actual distribution of grades.

Academic Integrity Statement:

AGGIE HONOR CODE: An Aggie does not lie, cheat, or steal or tolerate those who do.

Upon accepting admission to Texas A&M University, a student immediately assumes a commitment to uphold the Honor Code, to accept responsibility for learning, and to follow the philosophy and rules of the Honor System. Students will be required to state their commitment on examinations, research papers, and other academic work. Ignorance of the rules does not exclude any member of the TAMU community from the requirements or the processes of the Honor System.

For additional information please visit: http://www.tamu.edu/aggiehonor/

Local Course Policy:

• All work should be done individually and on your own unless otherwise allowed by the instructor.
• Discussion is only allowed immediately before, during, or immediately after the class, or during the instructor's office hours.
• If you find solutions to homeworks or programming assignments on the web (or in a book, etc.), you may (or may not) use it. Please check with the instructor.

Students with Disabilities:

The Americans with Disabilities Act (ADA) is a federal anti-discrimination statute that provides comprehensive civil rights protection for persons with disabilities. Among other things, this legislation requires that all students with disabilities be guaranteed a learning environment that provides for reasonable accommodation of their disabilities. If you believe you have a disability requiring an accommodation, please contact the Department of Student Life, Services for Students with Disabilities, in Cain Hall or call 845-1637.

Resources:

1. UCI Machine Learning Repository: datasets to test machine learning algorithms.
2. Research resources page
3. Ganeral reading list (u: p: ): includes short blurb about how to find, read, and critique others' work. This list is not the course reading list.

• Lecture notes (in PDF format): all notes will be uploaded in this directory.
• It is your responsibility to download, print, and bring the notes to the class. Notes will be available 24 hours before each class.
• See the 2006 Spring TAMU Calendar for breaks, etc. May 2 is the last class day (note that it is Tuesday).