Course detail
Machine Learning
FEKT-LSTUAcad. year: 2019/2020
The field of machine learning is concerned with the question of how to construct computer programs that automatically improve with experience. The goal of the subject is to present the key algorithms and theory that form the core of machine learning. Machine learning is mathematical-logical base in many fields including artificial intelligence, pattern recognition or data mining. The main attention is given on classification and optimization tasks.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Learning outcomes of the course unit
- design own solution of a classification task
- pre-process data, including feature selection
- estimate quality of selected model
- justify rightness of suggested solution
- design own solution of optimization task
- select appropriate search heuristic for given problem
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Examination: 80 points
Course curriculum
2. Statistics in machine learning.
3. Basics of information theory.
4. Decision trees.
5. Instance based learning.
6. Loss functions.
7. Model performance estimation.
8. Pre-processing.
9. Bayesian learning.
10. Genetic algorithms.
11. Linear regression. Discriminant analysis. Support vector machines.
12. Meta learning.
13. Unsupervised learning.
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended reading
Classification of course in study plans
Type of course unit
Lecture
Teacher / Lecturer
Syllabus
Training and testing data. Solution space. Learning and searching.
Natural and human learning. Problem representation language. Learning algorithms with numerical and symbolic inputs.
Methods of decision-tree induction. Presence of noise, incomplete description of examples.
Tree-to-rules transformation, generation of rules.
Perceptrons. Logical neural networks.
Kohonen maps.
Genetic algorithms, genetic programming. Comparision with biological systems.
Pattern recognition. Generalization. Nearest-neghbor method (k-NN).
Instance-based learning (IBL algorithms).
Bayesian classifiers.
Reinforcement learning.
Description and demonstration of applications.
Exercise in computer lab
Teacher / Lecturer
Syllabus
Introduction to decision trees and program See5 for decision trees induction.
Practical training on program See5.
Introduction to genetic algorithms. GA toolbox for Matlab.
Practical use of GA.
Introduction to IBL methods for text recognition.
Work on individual projects.
Individual work.
Individual work.
Commitment of individual work.
Presentation of individual work.
Evaluation.