University Homepage School Homepage School Contacts School Search

Informatics 2B: Lecture Schedule

Semester 2

• Tuesday 16.10-17.00 Hugh Robson Building LT HR
• Thursday 16.10-17.00 Hugh Robson Building LT HR
• Friday 16.10-17.00 Hugh Robson Building LT HR

Lectures start in Week 1, i.e., the week starting 14 January 2013.

Notes and slides are linked from this page. Slides are given both as "full" (one slide per page, easier to view on a screen) and as "multi" (typically 4 or 6 per page, saves on paper if printed).

Note and tutorial packs: please collect a complete set of notes and tutorial exercises from the ITO before the start of the course. You will need to present your matriculation card for this (and so will not be able to collect on behalf of others). Each student is entitled to one pack free of charge.

1. Tue, Iain: Introduction to learning and data. (Chapter 1; slides-full,  slides-multi; Matlab, Python)
2. Thu, KK: Introduction to Algorithms. (notes,  slides-full,  slides-multi, Search.java. )
3. Fri, KK: Asymptotic Notation. (notes,  slides-full,  slides-multi.)
4. Tue, Iain: Similarity and recommender systems. (Chapter 2; slides-full,  slides-multi)
5. Thu, KK: Asymptotic Notation and Algorithms. (no notes,  slides-full,  slides-multi.)
6. Fri, KK: Sequential Data Structures. (notes,  slides-full,  slides-multi.)
7. Tue, KK: Hashing. (notes,  slides-full,  slides-multi.)
8. Thu, Iain: Collaborative counting, Clustering. (Chapter 3; slides-full,  slides-multi; data, Matlab, Python)
9. Fri, Iain: Classification and nearest neighbours. (Chapter 4; slides-full,  slides-multi)
10. Tue, Iain: Introduction to statistical pattern recognition. (Chapter 5; slides-full,  slides-multi)
11. Thu, KK: AVL trees. (notes,  slides-full,  slides-multi)
12. Fri, Iain: Naive Bayes classification. (Chapter 6; slides-full,  slides-multi)
13. Tue, Iain: Text classification using Naive Bayes. (Chapter 7; slides-full,  slides-multi) (Iain got one lecture ahead of dates in notes here).
14. Thu, KK: Priority Queues and Heaps (notes,  slides-full,  slides-multi)
15. Fri, KK: MergeSort and Divide-and-Conquer (notes,  slides-full,  slides-multi.)
    
    18-22 Feb, Innovative Learning Week, no lectures or tutorials
    
    
16. Tue, Iain: Gaussians. (Chapter 8; slides-full,  slides-multi)
17. Thu, KK: HeapSort and QuickSort. (notes,  slides-full,  slides-multi.)
18. Fri, Iain: Classification with Gaussians. (Chapter 9; slides-full,  slides-multi)
19. Tue, Iain: Discriminant functions. (Chapter 10; slides-full,  slides-multi)
20. Thu, KK: Graphs I. (notes,  slides-full.)
21. Fri, Iain: Review: Gaussians and Linear discriminants. (slides-full,  slides-multi)
22. Tue, Iain: Single-layer neural networks 1. (Chapter 10 and Chapter 11; slides-full,  slides-multi) (Iain's lectures match dates in notes again from today).
23. Thu, KK: Graphs II (notes,  slides-full.)
24. Fri, Iain: Single layer neural networks 2. (Chapter 11; slides-full,  slides-multi)
25. Tue, Iain: Multi-layer neural networks 1. (Chapter 12; slides-full,  slides-multi)
26. Thu, KK: Large-scale Indexing and Sorting. (notes,  slides-full,  slides-multi.)
27. Fri, Iain: Multi-layer neural networks 2. (Chapter 12; slides-full,  slides-multi)
28. Tue, Iain: Review and conclusion of learning thread. (slides-full,  slides-multi)
29. Thu, KK: Ranking Queries for the WWW. (notes,  slides-full,  slides-multi.)
30. Fri, KK: Overview lecture, discussion and guide to revision.