PV021 Neural Networks

Faculty of Informatics
Spring 2014
Extent and Intensity
2/0/2. 4 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
doc. RNDr. Tomáš Brázdil, Ph.D. (lecturer)
doc. RNDr. Petr Novotný, Ph.D. (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: doc. RNDr. Tomáš Brázdil, Ph.D.
Supplier department: Department of Computer Science – Faculty of Informatics
Tue 10:00–11:50 G101
Recommended: knowledge corresponding to the courses MB102 and MB103.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
there are 36 fields of study the course is directly associated with, display
Course objectives
At the end of the course student will have a comprehensive knowledge of neural networks and related areas of machine learning. Will be able to independently learn and explain neural networks problems. Will be able to solve practical problems using neural networks techniques, both independently and as a part of a team. Will be able to critically interpret third party neural-networks based solutions.
  • Basics of machine learning and pattern recognition: classification and regression problems; cluster analysis; supervised and unsupervised learning; simple examples
  • Perceptron: biological motivation; geometry; perceptron learning rule; convergence
  • Linear models: least squares (pseudoinverse, gradient descent, Widrow-Hoff rule); connection with Bayes classifier; connection with maximum likelihood; regularization; bias-variance decomposition
  • Multilayer neural networks: multilayer perceptron; least squares; backpropagation
  • Practical considerations: basic data preparation; practical techniques for improving backpropagation; bias & variance tradeoff; overfitting; feature selection; applications
  • Recurrent networks: expressive and computational power of neural networks
  • Hopfield network: Hebb's rule; energy; capacity
  • Deep learning: restricted Boltzmann machines (sampling, maximum-likelihood learning, contrastive divergence learning); learning in deep neural networks
  • Clustering: density estimation; k-means clustering; self-organizing maps
  • Dimensionality reduction: PCA; ICA; connection with neural networks
  • Kernel methods: generalized linear models; radial basis function networks; support vector machines; kernel trick; kernel k-means; kernel PCA
  • Project: Software implementation of particular models and their simple applications.
  • ŠÍMA, Jiří and Roman NERUDA. Teoretické otázky neuronových sítí. Vyd. 1. Praha: Matfyzpress, 1996, 390 s. ISBN 80-85863-18-9. info
  • HAYKIN, Simon S. Neural networks and learning machines. 3rd ed. Upper Saddle River: Pearson, 2009, 934 s. ISBN 9780131293762. info
  • KOHONEN, Teuvo. Self-Organizing Maps. Berlin: Springer-Verlag, 1995, 392 pp. Springer Series in Information Sciences 30. ISBN 3-540-58600-8. info
Teaching methods
Theoretical lectures, group project
Assessment methods
Lectures, class discussion, group projects (4 to 6 people per project). Several midterm progress reports on the respective projects, one final project presentation plus oral examination.
Language of instruction
Further Comments
Study Materials
The course is taught annually.
Listed among pre-requisites of other courses
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2007, Spring 2009, Spring 2011, Spring 2012, Spring 2013, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, Autumn 2021, Autumn 2022, Autumn 2023, Autumn 2024.
  • Enrolment Statistics (Spring 2014, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2014/PV021