Skip to navigation | Skip to main content | Skip to footer

This is an archived syllabus from 2013-2014

COMP61021 Modelling and Visualisation of High-Dimensional Data syllabus 2013-2014

COMP61021 Modelling and Visualisation of High-Dimensional Data

Level 6
Credits: 15
Enrolled students: 39

Course leader: Ke Chen

Additional staff: view all staff


  • Pre-Requisite (Compulsory): COMP61011

Assessment methods

  • 50% Written exam
  • 50% Coursework
Sem 1 P2 Lecture 2.19 Wed 09:00 - 09:00 -
Sem 1 P2 Lab 2.25 (a+b) Wed 13:00 - 13:00 -
Themes to which this unit belongs
  • Learning from Data


A major component of machine learning and data mining is dealing with the high dimensional data that arises. Typical examples include pixels from an image (millions of dimensions), medical data bases (perhaps hundreds of dimensions, often with missing values), video clips and speech signals (time series data of very high dimensions), and gene expression data (expression values of many thousands of genes). Dealing with high dimensional data is a key challenge for modern computer science.

In this course we will consider how to develop appropriate algorithms for modelling and visualizing these high dimensional data sets and gain insights into these algorithms from theoretical and empirical perspectives. We will demonstrate how essential algorithms are derived in a step-by-step way as well as how important algorithms can be applied through the use of examples and real world problems. We will cover approaches from machine learning, statistics and neural computation in this advanced machine learning and data mining course unit.


This course unit aims to introduce students to state-of-the-art approaches to dealing with high dimensional data based on dimensionality reduction and provides experience of research such as literature review and appraising research papers in modelling and visualization of high dimensional data. In particular, transferable knowledge/skills, essential to original researches, are highlighted in this course unit.


  • Introduction/Background
  • Mathematics Basics
  • Principal component analysis (PCA)
  • Linear discriminative analysis (LDA)
  • Self-organising map (SOM)
  • Multi-dimensional scaling (MDS)
  • Isometric feature mapping (ISOMAP)
  • Locally linear embedding (LLE)

Teaching methods


three hours per week (5 weeks)


three hours per week (5 weeks)

Feedback methods

In general, feedback is available for the assessed work.

For coursework, the feedback to individuals will be offered during on-site marking in the lab.

For exam, the general feedback to the whole class will be given in writing.

Study hours

Employability skills

  • Analytical skills
  • Group/team working
  • Oral communication
  • Problem solving
  • Research
  • Written communication

Learning outcomes

On successful completion of this unit, a student will be able to:

Learning outcomes are detailed on the COMP61021 course unit syllabus page on the School of Computer Science's website for current students.

Reading list

Introduction to machine learning Alpaydin, Ethem.0262028182; 9780262028189; 0262325748 (electronic bk.); 9780262325745 (electronic bk.)The MIT Press[2014]
Deep learning Goodfellow, Ian,0262035618 (hardcover : alk. paper); 9780262035613 (hardcover : alk. paper)MIT Press[2016]
Bayesian reasoning and machine learning Barber, David,0521518148 (hbk.) :; 9780521518147 (hbk.) :Cambridge University Press2012.
Mathematics for Machine LearningDeisenroth, Marc Peter ; Faisal, A. Aldo ; Ong, Cheng Soon9781108455145undefined2020-02-29

Additional notes

Course unit materials

Links to course unit teaching materials can be found on the School of Computer Science website for current students.