SubjectsSubjects(version: 945)
Course, academic year 2023/2024
   Login via CAS
Nature Inspired Algorithms - NAIL115
Title: Přírodou inspirované algoritmy
Guaranteed by: Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
Faculty: Faculty of Mathematics and Physics
Actual: from 2021
Semester: summer
E-Credits: 5
Hours per week, examination: summer s.:2/2, C+Ex [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: not taught
Language: Czech, English
Teaching methods: full-time
Teaching methods: full-time
Guarantor: Mgr. Martin Pilát, Ph.D.
Incompatibility : NAIL119, NAIX115
Interchangeability : NAIL119, NAIX115
Is incompatible with: NAIX115
Is interchangeable with: NAIX115
Annotation -
Last update: doc. RNDr. Pavel Töpfer, CSc. (30.01.2018)
The goal of the lecture is to introduce the main nature-inspired algorithms (evolutionary algorithm, neural networks, …) and how they can be applied to solve problems in optimization and machine learning. In the seminar, some of the algorithms will be implemented and used to solve simple problems in the areas mentioned above.
Course completion requirements -
Last update: doc. RNDr. Pavel Töpfer, CSc. (30.01.2018)

In order to pass the course, the student must obtain the credit for the seminar and pass an exam. The credit is given for solving assignments from the seminar. The nature of study verification excludes the possibility of its repetition. The exam is oral with time for written preparation. The requirements correspond to the syllabus in the extent presented during the lectures. A part of the exam may be the design of an algorithm for a given problem.

Literature -
Last update: doc. RNDr. Pavel Töpfer, CSc. (30.01.2018)

Olarius S., Zomaya A. Y., Handbook of Bioinspired Algorithms and Applications, Chapman & Hall/CRC, 2005. ISBN: 978-1-584-88475-0

de Castro, L. N., Fundamentals of Natural Computing: Basic Concepts, Algorithms, and Applications, CRC Press, 2006. ISBN: 978-1-584-88643-3

Eiben, A.E and Smith, J.E.: Introduction to Evolutionary Computing, (2nd ed), Springer-Verlag, 2015. ISBN: 978-3-662-44874-8

Poli R., Langdon W. B., McPhee, N. F., A Field Guide to Genetic Programming. Lulu.com, 2008 ISBN: 978-1-409-20073-4

Bengio Y., Goodfellow I. J., Courville A., Deep Learning. MIT Press, 2016. ISBN: 978-0-262-03561-3

Syllabus -
Last update: doc. RNDr. Pavel Töpfer, CSc. (30.01.2018)
  • Biological inspiration in the design of algorithms and models

Evolutionary models

Neural models

  • Evolutionary algorithms

Simple genetic algorithm

Representation, genetic operators, fitness, selection

Evolutionary algorithms for continuous optimization

Neuro-evolution, algorithm NEAT

Genetic programming

  • Swarm algorithms

Ant Colony Optimization

Particle Swarm Optimization

  • Neural networks

Perceptron, multi-layered perceptron, back-propagation as a learning algorithm

Convolutional networks

RBF networks a Kohonen’s maps

  • Other nature inspired algorithms

Artificial Immune Systems

Cellular Automata

Artificial Life

  • Applications in optimization and machine learning

Continuous and combinatorial optimization

Multi-objective optimization

Supervised and unsupervised learning, reinforcement learning

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html