CPSC 633-600 Machine Learning:
Spring 2014

Syllabus

NEWS: 4/21/14, 09:11AM (Mon)
  • [04/21/14] Old exam 2 uploaded.
  • ----------------------------------------
  • [04/16/14] Exam #2 info: Exam material will be from slide07, slide08, slide09, slide10, slide11, slidedl, slidebm, and deep learning tutorial (web_link; page 1 to page 64 only).
  • ----------------------------------------
  • [04/09/14] Homework 4 corrections uploaded.
  • ----------------------------------------
  • [04/06/14] Homework 4 announced. Due date 4/23 11:30am (in class). Submit to eCampus or in class (but not to both).
    • Submit code separately on eCampus.
    • Concatenate all source code files into a single file called homework4.c (for C, C++), homework4.java (for java), homework4.py (for python), homework4.m (for matlab/octave).
    • Code will be tested on MOSS.
  • ----------------------------------------
  • [03/17/14] Graphviz DOT example file: dt.dot, output (png).
  • [03/16/14] Homework 3 announced. Due date 3/31 11:30am (in class). Submit to eCampus or in class (but not to both).
    • Submit code separately on eCampus.
    • Concatenate all source code files into a single file called homework3.c (for C, C++), homework3.java (for java), homework3.py (for python), homework3.m (for matlab/octave).
    • Code will be tested on MOSS.
  • ----------------------------------------
  • [02/24/14] Midterm exam info: Materials from slide01--slide06 will be covered. You may bring one hand-written sheet of notes (US letter sized; both sides can be used; not to be printed or photocopied). Bring your ID. Seats will be randomly assigned. Arrive early if you can (11:20am).
  • [02/24/14] Old midterm exam
  • ----------------------------------------
  • [02/21/14] Generating random events
  • [02/19/14] Homework 2 announced. Due date 3/5 11:30am. Submit to eCampus or in class (but not to both).
  • [02/05/14] Homework 1 announced. Due date 2/17 11:59pm 2/18 8am. Submit to eCampus or to 322B (but not to both).
  • ----------------------------------------
  • [01/29/14] Perceptron demo
  • [01/22/14] Office hours posted.
  • [01/12/14] Course web page goes online.
  • ---------------------------------------------------------
  • For older announcements, see the archive
Read-Only Bulletin Board.: 2/21/14, 09:43AM (Fri)

Page last modified: 4/25/14, 08:31AM Friday.

General Information Resources Weekly Schedule Lecture Notes

I. General Information

Instructor:

Dr. Yoonsuck Choe
Email: choe(a)tamu.edu
Office: HRBB 322B
Phone: 845-5466
Office hours: MW 9:00am-10:30am.

TA:

Jaewook Yoo
Email: jwookyoo(a)neo.tamu.edu
Office: HRBB 322A
Phone: N/A
Office hours: TR 2:00pm-3:30pm

Prerequisite/Restrictions:

CPSC 420, 625, or consent of instructor.

Lectures:

MWF 11:30am–12:20pm, ETB 1020.

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:

Administrative details:

  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 other public systems in the departmental lab.

Topics to be covered:

See the Weekly Schedule section for more details. The content will closely reflect a combination of Alpaydin + Mitchell.

Grading:

  1. 4 assignments (including written and programming components), 15% each = 60%
  2. 2 exams (in class), 15% each = 30%
  3. Class participation 10% (repeated absences in the class will weigh most heavily [in the negative direction] in the determination of this score).
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://aggiehonor.tamu.edu/

Local Course Policy:

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

III. Weekly Schedule and Class Notes

Week
Date
Topic
Reading
Assignments
Notices and Dues
Notes
1 1/13 Introduction Alpaydin chap 1; Mitchell 1.1–1.2, 1.3–1.5     slide01.pdf
slide01b.pdf
1 1/15      
1 1/17      
2 1/20 Martin Luther King day No class    
2 1/22 Supervised Learning (general) Alpaydin chap 2; Mitchell 7.1–7.2, 7.4     slide02.pdf
2 1/24      
3 1/27      
3 1/29 Multilayer perceptrons Alpaydin chap 11; Mitchell chap 4     slide03.pdf
3 1/31      
4 2/3      
4 2/5   Homework 1 announced  
4 2/7      
5 2/10      
5 2/12 Reinforcement learning Alpaydin chap 18; Mitchell chap 13     slide04.pdf
5 2/14      
6 2/17   Homework 2 announced Homework 1 due
6 2/19 Advanced topics     slide04.pdf
6 2/21 Decision tree learning Alpaydin chap 9; Mitchell chap 3     slide05.pdf
7 2/24      
7 2/26      
7 2/28 Genetic Algorithms Mitchell chap 9     slide06.pdf
8 3/3      
8 3/5   Homework 3 announced Homework 2 due
8 3/7 Exam #1      
9 3/10 Spring break No class      
9 3/12 Spring break No class      
9 3/14 Spring break No class      
10 3/17 Genetic Algorithms: Advanced topics       slide07.pdf
10 3/19 Dimensionality reduction Alpaydin chap 6: 6.1–3, 6.7, 6.8     slide08.pdf
10 3/21      
11 3/24      
11 3/26 Local models Alpaydin chap 12     slide09.pdf
11 3/28      
12 3/31   Homework 4 announced Homework 3 due
12 4/2 Bayesian learning Mitchell chap 6     slide10.pdf
12 4/4      
13 4/7      
13 4/9       slide10.pdf
13 4/11 Kernel machines Alpaydin 13.1–13.5     slide11.pdf
14 4/14 Kernel machines Alpaydin 13.1–13.5     slide11.pdf
14 4/16 Deep learning Optional reading: Jürgen Schmidhuber's Deep Learning Page: [LINK]. Optional reading: Hinton's tutorial on deep belief networks     slidedl.pdf
slidebm.pdf
web_link;

14 4/18 Reading day No class    
15 4/21 Deep learning   Homework 4 due    
15 4/23 Exam review; Learning in biological vision Miikkulainen et al. (2005)   Homework 4 due web_link;
15 4/25 Exam #2        
16 4/28 Learning in biological vision Miikkulainen et al. (2005)     web_link;
164/29Redefined day (Tuesday): class meets! same as above   


$Id: index.php,v 1.4.1.7 2003/11/13 00:02:12 choe Exp choe $