Přístupnostní navigace
E-application
Search Search Close
Course detail
FEKT-DPA-IMLAcad. year: 2021/2022
Complexity theory, genetic algorithms, genetic programming, graph theory, graph equivalence, inforamtion representation, neural networks, reinforcement learning, embeddings.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Offered to foreign students
Learning outcomes of the course unit
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Course curriculum
1. Information representation, introduction2. Complexity theory, selected examples of complexity3. Graph theory, analysis, factorization4. Theory of graphs, groups, availability, bipartite5. Graphs equivalence6. Information representation - machine learning7. Information representation - network types8. Information representation - linear regression9. Information representation - logistic regression, classification10. Information representation - feed forward neural network11, Information representation - recurrent neural network12. Information representation - reinforcement learning13. Information representation - NN with graphs and trees
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
Elearning
Classification of course in study plans
Seminar
Teacher / Lecturer