Main page | Study Branches | Groups of Courses | All Courses | Roles | Explanatory Notes               Instructions

A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.

ANI-MLM Machine Learning Methods Extent of teaching: 2P+1C
Instructor: Friedjungová M., Vašata D. Completion: Z,ZK
Department: 18105 Credits: 5 Semester:

Annotation:
The course introduces students to machine learning methods applicable within their specializations in the follow-up Applied Informatics program. These principles and competencies are not part of the common undergraduate curriculum and are typically taught only in specializations focused on artificial intelligence. The aim is to understand the theoretical foundations and to gain practical experience in applying models suitable for regression and classification tasks within supervised learning, including kernel methods and neural networks. In unsupervised learning, students will become familiar primarily with clustering models and principal component analysis. The course also covers model evaluation techniques and fundamental methods for data preprocessing. Practical exercises involve data analysis and model implementation using the Python libraries pandas, scikit-learn, and PyTorch.

Lecture syllabus:
1. Introduction and basic concepts of machine learning - supervised learning, classification and regression tasks.
2. Decision trees, nearest neighbor method, normalization.
3. Linear and ridge regression.
4. Logistic regression.
5. Ensemble methods - random forests, AdaBoost.
6. Model evaluation (regression, classification - confusion matrix and derived metrics), cross validation, feature selection.
7. Unsupervised learning - clustering (agglomerative hierarchical, k-means).
8. Support vector machine (SVM) method for classification.
9. Principal Component Analysis (PCA).
10. (2) Introduction to neural networks - loss functions, back propagation, deep learning.
11. Convolutional neural networks, recurrent neural networks.
12. Modern neural network models - autoencoders, transformers, LLM.

Seminar syllabus:
1. Introduction, presentation of tools (pandas, sklearn)
2. Decision trees, nearest neighbor method, normalization
3. Linear and ridge regression
4. Logistic regression
5. Ensemble methods - random forests, AdaBoost.
6. Model evaluation (regression, classification - confusion matrix and derived metrics), cross validation, feature selection
7. Unsupervised learning - clustering (agglomerative hierarchical, k-means)
8. Support vector machine (SVM) method for classification
9. Principal Component Analysis (PCA)
10. Introduction to neural networks
11. Convolutional neural networks, recurrent neural networks
12. Modern neural network models - autoencoders, transformers

Literature:
1. Murphy K. P.: Machine Learning: A Probabilistic Perspective. MIT Press, 2012. ISBN 978-0-262-01802-9.
2. Goodfellow I., Bengio Y., Courville A.: Deep Learning. MIT Press, 2016. ISBN 978-0-262-03561-3.
3. Alpaydin E.: Introduction to Machine Learning. MIT Press, 2020. ISBN 978-0262043793.
4. Hastie T., Tibshirani R., Friedman J.: The Elements of Statistical Learning. Springer, 2009. ISBN 978-0-387-84857-0.
5. Deisenroth M. P.: Mathematics for Machine Learning. Cambridge University Press, 2020. ISBN 978-1108455145.

Requirements:
Basic knowledge of programming (Python).

Výukové materiály na courses

The course is also part of the following Study plans:
Study Plan Study Branch Role Recommended semester
NI-UI.2026 Artificial Intelligence VO 2
NI-PJ.2026 Programming Languages VO 2
QNI Unspecified Specialisation of Study V 2
NI-PSS.2026 Computer Systems and Networks PS 2
NI-PB.2026 Computer Security VO 2
ANI-SPOL Unspecified Specialisation of Study PP 2
ANI-VG Visual computing and Game design PP 2
ANI-WI Web Engineering PP 2
ANI-SI Software Engineering (in Czech) PP 2
ANI-MI Business Informatics PP 2
ANI-ES Embedded systems PP 2
ANI-SPOL Unspecified Specialisation of Study V 2
ANI-VG Visual computing and Game design V 2
ANI-WI Web Engineering V 2
ANI-SI Software Engineering (in Czech) V 2
ANI-MI Business Informatics V 2
ANI-ES Embedded systems V 2
NI-SPOL.2026 Unspecified Specialisation of Study VO 2
NI-TI.2026 Computer Science VO 2


Page updated 12. 11. 2026, semester: Z,L/2023-4, Z/2025-6, L/2024-5, L/2022-3, Z/2021-2, Z/2022-3, Z/2024-5, L/2026-7, L/2021-2, Z/2026-7, L/2025-6, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška