Module Identifier CS36110  
Academic Year 2007/2008  
Co-ordinator Dr Yonghuai Liu  
Semester Semester 1  
Other staff Professor Ross D King, Dr Yonghuai Liu, Dr Maria Liakata, Professor Mark H Lee, Dr Larissa Soldatova, Dr Simon M Garrett, Mr David J Smith  
Pre-Requisite CS26110 or equivalent.  
Course delivery Lecture   20 lectures  
Assessment TypeAssessment Length/DetailsProportion
Semester Exam2 Hours  100%
Supplementary Exam2 Hours Will take the same form, under the terms of the Department's policy.  100%
Further details  

Learning outcomes

On successful completion of this module, students will be able to:
1. Formalise and represent experience, using techniques like feature-value pairs;
2. Apply concept learning, decision making tree, artificial neural networks, Bayesian learning, genetic algorithms, and reinforcement learning to solve a range of simple problems in applications like customer attitude prediction, banking business, handwritten character recognition, medical diagnosis, artificial life, robot path optimization, etc.;
3. Compare and choose different learning algorithms for different applications;
4. Appreciate the range of applicability of intelligent learning concepts and techniques; ;
5. Explain the state of the art of intelligent learning concepts and techniques;

Brief description

This module builds on CS26110 and is application oriented. To this end, a small number of topics are studied in depth in order to give insight and understanding of the methods and issues involved in the state-of-the-art applications of the various learning techniques.


1. Introduction - 2 lectures

Possibility and necessity of learning, target function, components in a learning system, performance measurement of learning systems.

2. Concept learning - 3 lectures

This chapter will use concept learning to develop applications to predict whether students like this module or not: Generality ordering of hypotheses, FIND-S algorithm, version space, the LIST-THEN-ELIMINATE algorithm, inductive bias

3. Decision tree learning - 3 lectures

This chapter will use decision tree learning to develop applications about banking business: Entropy, best attribute, information gain, best tree, inductive bias, Occam's razor, over-fitting, reduced error pruning, rule post-pruning.

4. Artificial neural network - 3 lectures

This chapter will use artificial neural network learning to develop applications to recognize handwritten characters: Perceptron, linear separability, gradient decent, sigmoid function, back propagation algorithm, over-fitting.

5. Bayesian learning - 4 lectures

This chapter will use Bayesian learning to develop applications about medical diagnosis: Bayesian theory, maximum a posteriori hypothesis, maximum likelihood, probability density, normal distribution, minimum description length principle, Bayes optimal classifier, naive Bayes classifier.

6. Genetic algorithm - 3 lectures

This chapter will use genetic algorithms to develop applications about artificial life: Hypothesis representation, best hypothesis, genetic operators, fitness function, fitness proportionate selection, flocking behaviour, local control.
7. Reinforcement learning - 2 lectures

This chapter will use reinforcement learning to develop applications about robot path optimization: Reward, Markov decision process, utility function, Q-learning.

Reading Lists

** Recommended Text
S J Russell and P Norvig (1995) A I: A Modern Approach Prentice-Hall 0131038052
S. M. Weiss and C. A. Kulikowsky (1991) Computer Systems That Learn Morgan Kaufmann
T. Mitchell (1998) Machine Learning McGraw Hill


This module is at CQFW Level 6