ANU Data Mining Group

Data Mining Course 2005

MATH3346


News:

Lecture and lab times and venues

Course coordinator Stephen Roberts

Prerequisits
We don't actually have formal prerequisites. We assume that participants have basic computing and mathematical skills with honours level expertise in either of these areas. Our intended audience are honours and graduate students in these areas. We intend to look at both mathematical (algorithm) and computing issues.

In the course we will analyse algorithms, do some coding and look at efficiency issues, and also do some hands on data analysis (data mining).

Lecturers

Course Assessments

The assessment for this year's course is as follows:

  1. Four assignments (one per course module) each worth 10%
  2. R programming hands-on worth 20%
  3. Paper presentation worth 20% (in weeks 12 and 13)
  4. Examination (take home or written) worth 20%
  5. The final course mark will be the sum of the assignments, presentation and exam marks.

Course Outline (draft)

  1. Welcome and introduction
    (Peter Christen)
    Lecture slides (4-up): Lect-0, PDF / Lect-0, PS.GZ

  2. Data mining overview, process, data issues, data quality, data preprocessing, data integration / linkage
    (Peter Christen)
    Lecture slides (4-up): Lect-1, PDF / Lect-1, PS.GZ     Lect-2, PDF / Lect-2, PS.GZ     Lect-3, PDF / Lect-3, PS.GZ     Lect-4, PDF / Lect-4, PS.GZ

  3. Introduction to data mining algorithms (from a machine learning point of view, incl. clustering)
    (Graham Williams)
    Lecture slides: Lect-5, PDF, 4-up     Lect-6, PDF, 4-up     Lect-7, PDF, 4-up     Lect-8, PDF, 4-up     Lect-9, PDF, 4-up     Lect-10, PDF, 4-up

  4. Algorithms for association rules
    (Markus Hegland)
    Lectures 1, PDF

  5. Predictive modelling
    (Stephen Roberts and Jochen Garcke)
    Lect-1 PDF, 4-up     Lect-2 PDF, 4-up     Lect-3 PDF, 4-up     Lect-4 PDF, 4-up     Lect-5 PDF, 4-up

Assignments

Labs / Tutorials


Last update: Peter Christen, 26 September 2005