m (adding hyperlink)
Line 68: Line 68:
 
|-
 
|-
 
|28.10.
 
|28.10.
|Statistical learning, probabilistic models. <!--[http://dai.fmph.uniba.sk/courses/ICI/References/ci-prob.4x.pdf slides]-->
+
|Statistical learning, probabilistic models. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-prob.4x.pdf slides]
 
|R&N (2010), ch.13,20.1-2; Marsland (2009), ch.8.1-2
 
|R&N (2010), ch.13,20.1-2; Marsland (2009), ch.8.1-2
 
|-
 
|-

Revision as of 10:56, 4 November 2019

Introduction to Computational Intelligence 2-IKV-115

The course objectives are to make the students familiar with basic principles of various computational methods of data processing that can commonly be called computational intelligence (CI). This includes mainly bottom-up approaches to solutions of (hard) problems based on various heuristics (soft computing), rather than exact approaches of traditional artificial intelligence based on logic (hard computing). Examples of CI are nature-inspired methods (artificial neural networks, evolutionary algorithms, fuzzy systems), as well as probabilistic methods and reinforcement learning. After the course the students will be able to conceptually understand the important terms and algorithms of CI, and choose appropriate method(s) for a given task. The theoretical lectures are combined with the seminar where the important concepts will be discussed and practical examples will be shown.


Course schedule

Type Day Time Room Lecturer
Lecture Monday 9:00 - 10:30 I-9 Igor Farkaš
Seminar Thursday 14:00 - 15:30 I-9 Igor Farkaš & Endre Hamerlik


Syllabus

Date Topic References
23.09. What is computational intelligence, basic concepts, relation to artificial intelligence. slides Craenen & Eiben (2003); wikipedia; R&N (2010), chap.1; Sloman (2002)
30.09. Taxonomy of artificial agents, nature of environments. slides R&N (2010), chap.2
07.10. Inductive learning via observations, decision trees. Model selection. slides R&N (2010), ch.18.1-3,18.6; Marsland (2009), ch.6.1-2, visualization, interactive demo
14.10. Supervised learning in feedforward neural networks (perceptrons), pattern classification, function approximation. slides R&N (2010), ch.18.2; Marsland (2009), ch.2-3, Engelbrecht (2007), ch.2-3
21.10. Unsupervised (self-organizing) neural networks: feature extraction, data visualization. slides Marsland (2009), ch.9-10, Engelbrecht (2007), ch.4
28.10. Statistical learning, probabilistic models. slides R&N (2010), ch.13,20.1-2; Marsland (2009), ch.8.1-2
04.11. Interim summary (review) Thursday: mid-term test
11.11. Reinforcement learning I: basic principles and learning methods (TD-learning). Prediction problem. R&N (2010), ch.21.1-2.
18.11. Reinforcement learning II (Q, SARSA), actor-critic, control problem, RL for continuous domains. R&N (2010), ch.21.3-5; Woergoetter & Porr (2008).
25.11. Evolutionary computation: basic concepts, genetic algorithms. Engelbrecht (2007), ch.8
03.12. Fuzzy systems, fuzzy logic and reasoning. Engelbrecht (2007), ch.20-21; Zadeh (2007)

Note: Dates refer to lectures, seminars will be on day+3 each week.

References

Course grading

  • Active participation during the seminar/exercise: 5 for lectures, 10 for exercises (max. 15 points).
  • Written mid-term test (max. 15 points).
  • Final written-oral exam (max. 20 points, 4 questions). Minimum of 7 points required.
  • Optional: small final project (max. 5 points) = implementation of a small neural network (using an existing Python library) and writing a short report. Note: even without this, the student can still get maximum points if s/he has performed very actively.
  • Overall grading: A (50-46), B (45-41), C (40-36), D (35-31), E (30-26), Fx (25-0).