Nathalie Japkowicz
Office: STE 5-029
Phone: 562-5800 ext. 6693
E-mail: nat@site.uottawa.ca
Machine Learning is the area of Artificial Intelligence concerned with the problem of building computer programs that automatically improve with experience. The intent of this course is to present a broad introduction to the principles and paradigms underlying machine learning, including presentations of its main approaches, discussions of its major theoretical issues, and overviews of its most important research themes.
The course will consist of a mixture of regular lectures and student presentations. The regular lectures will cover descriptions and discussions of the major approaches to Machine Learning as well as of its major theoretical issues. The student presentations will focus on the most important themes we survey. These themes will mostly be approached through recent research articles from the Machine Learning literature.
Students will be evaluated on short written commentaries and oral presentations of research papers (20%), on a few homework assignments (30%), and on a final class project of the student's choice (50%). For the class project, students can propose their own topic or choose from a list of suggested topics which will be made available at the beginning of the term. Project proposals will be due in mid-semester. Group discussions are highly encouraged for the research paper commentaries and students will be allowed to submit their reviews in teams of 3 or 4. However, homework and projects must be submitted individually.
Students should have reasonable exposure to Artificial Intelligence and some programming experience in a high level language.
Additional References .
Research papers will be available from Conference Proceedings or Journals available from the Web.
(Links appear in the Syllabus table below, in the
Which
of the following Data Mining (DM) topics are most important for your work or
research? (Choose top 3) [113 voters] |
|
Scaling up DM algorithms for
huge data (46) |
|
Mining text (33) |
|
Automating data cleaning
(30) |
|
Dealing with unbalanced and
cost-sensitive data (29) |
|
Mining data streams (20) |
|
Mining links and networks
(19) |
|
Unified theory of DM (18) |
|
DM for biological problems
(16) |
|
DM with privacy (10) |
|
Mining images (8) |
|
DM for security applications
(6) |
|
Distributed (multi-agent) DM
(4) |
|
Other (21) |
|
Week |
Topics |
Readings |
Week 1: Jan 12 |
Introduction 1: Organizational Meeting Introduction 2: Overview of Machine Learning |
Texts: |
Week 2: Jan 19 |
Approach: Versions Space Learning Additional Slides on: inductive learning theory, version spaces, decision trees and neural nes Approach: Decision Tree Learning |
Texts: Texts: |
Week 3: Jan 26 |
Theoretical Issue: Experimental
Evaluation of Learning Algorithms I |
Texts: Theme: Text Mining
|
Week 4: Feb 2 |
Theoretical Issue: |
Texts: Theme: Evaluation of learning Systems |
Week 5: Feb 9 Homework 1 DUE on Monday |
Approach: Artificial Neural Networks
|
Texts: Witten & Frank, pp. 223-235 Theme: Cost-Sensitive Learning and Class Imbalances
|
Week
6: Feb
16 |
STUDY BREAK |
STUDY
BREAK |
Week 7: Feb 23 |
Approach: Bayesian
Learning |
Texts: Witten & Frank, Sections 4.2 and 6.7 Theme: Scaling up Data Mining
|
Week 8: March 2 |
Approach: Instance-Based
Learning |
Texts: Witten & Frank, Sections 4.7 and 6.4 Theme: Mining Data Streams |
|
|
|
Week 9: March 9 |
Approach: Rule Learning Theme: Data Cleaning |
Texts: Witten & Frank, Sections 4.4 and 6.2 Theme: Data Cleaning
|
Week 10: Mar 16 |
Approach:
Support Vector Machines |
Texts: Witten & Frank, Sections 4.6 and 6.3 Theme Papers: Your choice of 3 papers from this very nice bibliography (each presenter chooses a paper):
|
Week 11: Mar 23 |
Approach: Classifier Combination Theme: Mining Link and Network Data |
Texts: Witten & Frank, Section 7.5 Theme Papers: Mining Link and Network Data |
Week 12: Mar 30 |
Theoretical Issue: Computational
Learning Theory |
Texts: See Tom Mitchell’s book Theme Papers: Data Mining for Security Applications |
Week 13: Apr 6 |
Approach: Unsupervised Learning Approach: Genetic
Algorithms |
Texts: Witten & Frank, Sections 4.8 and 6.6. Texts: See Tom Mitchell’s book |