Přehled studia |
Přehled oborů |
Všechny skupiny předmětů |
Všechny předměty |
Seznam rolí |
Vysvětlivky
Návod
Webová stránka:
https://cw.fel.cvut.cz/wiki/courses/BE5B33RPZ
Anotace:
The basic formulations of the statistical decision problem are presented. The necessary knowledge about the (statistical) relationship between observations and classes of objects is acquired by learning on the raining set. The course covers both well-established and advanced classifier learning methods, as Perceptron, AdaBoost, Support Vector Machines, and Neural Nets.
This course is also part of the inter-university programme prg.ai Minor. It pools the best of AI education in Prague to provide students with a deeper and broader insight into the field of artificial intelligence. More information is available at
https://prg.ai/minor.
Cíle studia:
To teach the student to formalize statistical decision
making problems, to use machine learning techniques and to
solve pattern recognition problems with the most popular
classifiers (SVM, AdaBoost, neural net, nearest neighbour).
Osnovy přednášek:
| 1. | | The pattern recognition problem. Overview of the Course. Basic notions. |
| 2. | | The Bayesian decision-making problem, i.e. minimization of expected loss. |
| 3. | | Non-bayesian decision problems. |
| 4. | | Parameter estimation. The maximum likelihood method. |
| 5. | | The nearest neighbour classifier. |
| 6. | | Linear classifiers. Perceptron learning. |
| 7. | | The Adaboost method. |
| 8. | | Learning as a quadratic optimization problem. SVM classifiers. |
| 9. | | Feed-forward neural nets. The backpropagation algorithm. |
| 10. | | Decision trees. |
| 11. | | Logistic regression. |
| 12. | | The EM (Expectation Maximization) algorithm. |
| 13. | | Sequential decision-making (Wald´s sequential test). |
| 14. | | Recap. |
Osnovy cvičení:
Students solve four or five pattern recognition problems, for instance a simplified version of OCR (optical character recognition), face detection or spam detection using either classical methods or trained classifiers.
| 1. | | Introduction to MATLAB and the STPR toolbox, a simple recognition experiment |
| 2. | | The Bayes recognition problem |
| 3. | | Non-bayesian problems I: the Neyman-Pearson problem. |
| 4. | | Non-bayesian problems II: The minimax problem. |
| 5. | | Maximum likelihood estimates. |
| 6. | | Non-parametric estimates, Parzen windows. |
| 7. | | Linear classifiers, the perceptron algorithm |
| 8. | | Adaboost |
| 9. | | Support Vector Machines I 10.Support Vector Machines II |
| 11. | | EM algoritmus I 12.EM algoritmus II |
| 13. | | Submission of reports. Discussion of results. |
| 14. | | Submission of reports. Discussion of results. |
Literatura:
| 1. | | Duda, Hart, Stork: Pattern Classification, 2001. |
| 2. | | Bishop: Pattern Recognition and Machine Learning, 2006. |
| 3. | | Schlesinger, Hlavac: Ten Lectures on Statistical and Structural Pattern Recognition, 2002. |
Požadavky:
Knowledge of linear algebra, mathematical analysis and
probability and statistics.
Poznámka:
Klíčová slova:
pattern recognition, statistical decision-making, machine learning, classification
Předmět je zahrnut do těchto studijních plánů:
| Stránka vytvořena 20.4.2024 07:54:16, semestry: Z,L/2023-4, Z/2024-5, připomínky k informační náplni zasílejte správci studijních plánů |
Návrh a realizace: I. Halaška (K336), J. Novák (K336) |