(30 intermediate revisions by 2 users not shown)
Riadok 8: Riadok 8:
 
<!--[https://sluzby.fmph.uniba.sk/infolist/sk/2-AIN-132_15.html Informačný list predmetu]-->
 
<!--[https://sluzby.fmph.uniba.sk/infolist/sk/2-AIN-132_15.html Informačný list predmetu]-->
  
<!--
+
 
 
== News ==
 
== News ==
 +
'''Exam:''' The list of questions is [http://dai.fmph.uniba.sk/courses/ICI/ci-exam-questions.pdf here]. You will choose three questions (pseudo)randomly.
 
<!--
 
<!--
'''Skúška:''' v AISe sú vypísané termíny (7., 9., 15., 20., 26.6), so začiatkom písomnej časti vždy o 8:30 v I-8. Môžete sa prihlasovať, maximálne 8 ľudí na termín. Odhlasovanie (prihlasovanie) je možné do 8:30 (18:30) v deň pred skúškou. Ťaháte si pseudonáhodne 3 otázky zo [http://dai.fmph.uniba.sk/courses/NN/ns-otazky.pdf zoznamu otázok].
+
;16. 9. 2018
 
+
;11. 9. 2018
+
 
: We start on Monday, 24th September.
 
: We start on Monday, 24th September.
 
<!-- [[#Archív noviniek|Archív noviniek…]] -->
 
<!-- [[#Archív noviniek|Archív noviniek…]] -->
Riadok 34: Riadok 33:
 
|-
 
|-
 
|Seminar
 
|Seminar
|Wednesday
+
|Thursday
 
|14:00 - 15:30
 
|14:00 - 15:30
 
|I-9
 
|I-9
|[[Igor Farkas|Igor Farkaš]] & [https://www.sav.sk/index.php?lang=en&doc=user-org-user&user_no=11408 Xenia Daniela Poslon]  
+
|[[Igor Farkas|Igor Farkaš]] & [[Endre Hamerlik]]  
 
|}
 
|}
  
Riadok 48: Riadok 47:
 
!References
 
!References
 
|-
 
|-
|24.09.
+
|23.09.
 
|What is computational intelligence, basic concepts, relation to artificial intelligence.  [http://dai.fmph.uniba.sk/courses/ICI/References/ci-def.4x.pdf slides]
 
|What is computational intelligence, basic concepts, relation to artificial intelligence.  [http://dai.fmph.uniba.sk/courses/ICI/References/ci-def.4x.pdf slides]
 
|Craenen & Eiben (2003); [https://en.wikipedia.org/wiki/Computational_intelligence wikipedia]; R&N (2010), chap.1; Sloman (2002)
 
|Craenen & Eiben (2003); [https://en.wikipedia.org/wiki/Computational_intelligence wikipedia]; R&N (2010), chap.1; Sloman (2002)
 
|-
 
|-
|01.10.
+
|30.09.
|Taxonomy of artificial agents, nature of environments. <!--[http://dai.fmph.uniba.sk/courses/ICI/References/ci-agents.4x.pdf slides]-->
+
|Taxonomy of artificial agents, nature of environments. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-agents.4x.pdf slides]
 
|R&N (2010), chap.2
 
|R&N (2010), chap.2
 
|-
 
|-
|08.10.
+
|07.10.
|Inductive learning via observations, decision trees. Model selection. <!--[http://dai.fmph.uniba.sk/courses/ICI/References/ci-learning.4x.pdf slides]-->
+
|Inductive learning via observations, decision trees. Model selection. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-learning.4x.pdf slides]
 
|R&N (2010), ch.18.1-3,18.6; Marsland (2009), ch.6.1-2, [http://www.r2d3.us/visual-intro-to-machine-learning-part-1/ visualization], [http://fiddle.jshell.net/92Jxj/show/light/ interactive demo]
 
|R&N (2010), ch.18.1-3,18.6; Marsland (2009), ch.6.1-2, [http://www.r2d3.us/visual-intro-to-machine-learning-part-1/ visualization], [http://fiddle.jshell.net/92Jxj/show/light/ interactive demo]
 
|-
 
|-
|15.10.
+
|14.10.
|Supervised learning in feedforward neural networks (perceptrons), pattern classification, function approximation. <!--[http://dai.fmph.uniba.sk/courses/ICI/References/ci-fwdnn.4x.pdf slides]-->
+
|Supervised learning in feedforward neural networks (perceptrons), pattern classification, function approximation. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-fwdnn.4x.pdf slides]  
 
|R&N (2010), ch.18.2; Marsland (2009), ch.2-3, Engelbrecht (2007), ch.2-3
 
|R&N (2010), ch.18.2; Marsland (2009), ch.2-3, Engelbrecht (2007), ch.2-3
 
|-
 
|-
|22.10.
+
|21.10.
|Unsupervised (self-organizing) neural networks: feature extraction, data visualization. <!--[http://dai.fmph.uniba.sk/courses/ICI/References/ci-unsup.4x.pdf slides]-->
+
|Unsupervised (self-organizing) neural networks: feature extraction, data visualization. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-unsup.4x.pdf slides]  
 
|Marsland (2009), ch.9-10, Engelbrecht (2007), ch.4
 
|Marsland (2009), ch.9-10, Engelbrecht (2007), ch.4
 
|-
 
|-
|29.10.
+
|28.10.
|No class
+
|Statistical learning, probabilistic models. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-prob.4x.pdf slides]
|fall break (the whole week)
+
|R&N (2010), ch.13,20.1-2; Marsland (2009), ch.8.1-2
 
|-
 
|-
|05.11.
+
|04.11.
 
|Interim summary (review)
 
|Interim summary (review)
|Wrdnesday: mid-term test
+
|Thursday: mid-term test
|-
+
|12.11.
+
|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
+
 
|-
 
|-
|19.11.
+
|11.11.
|Reinforcement learning I: basic principles and learning methods (TD-learning). Prediction problem. <!--[http://dai.fmph.uniba.sk/courses/ICI/References/ci-rl.4x.pdf slides]-->
+
|Reinforcement learning I: basic principles and learning methods (TD-learning). Prediction problem. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-rl.4x.pdf slides]
 
|R&N (2010), ch.21.1-2.  
 
|R&N (2010), ch.21.1-2.  
 
|-
 
|-
|26.11.
+
|18.11.
 
|Reinforcement learning II (Q, SARSA), actor-critic, control problem, RL for continuous domains.
 
|Reinforcement learning II (Q, SARSA), actor-critic, control problem, RL for continuous domains.
 
|R&N (2010), ch.21.3-5; Woergoetter & Porr (2008).
 
|R&N (2010), ch.21.3-5; Woergoetter & Porr (2008).
 
|-
 
|-
|03.11.
+
|25.11.
|Evolutionary computation: basic concepts, genetic algorithms. <!--[http://dai.fmph.uniba.sk/courses/ICI/References/ci-evol.4x.pdf slides]-->
+
|Evolutionary computation: basic concepts, genetic algorithms. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-evol.4x.pdf slides]
 
|Engelbrecht (2007), ch.8
 
|Engelbrecht (2007), ch.8
 
|-
 
|-
|10.12.
+
|03.12.
|Fuzzy systems, fuzzy logic and reasoning. <!--[http://dai.fmph.uniba.sk/courses/ICI/References/ci-fuzzy.4x.pdf slides]-->
+
|Fuzzy systems, fuzzy logic and reasoning. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-fuzzy.4x.pdf slides]
 
|Engelbrecht (2007), ch.20-21; Zadeh (2007)  
 
|Engelbrecht (2007), ch.20-21; Zadeh (2007)  
 
|}
 
|}
 +
Note: Dates refer to lectures, seminars will be on day+3 each week.
  
 
== References ==
 
== References ==
  
 
* Craenen B., Eiben A. (2003): [http://dai.fmph.uniba.sk/courses/ICI/craenen.ci.enc03.pdf Computational Intelligence]. In: Encyclopedia of Life Support Sciences, EOLSS Publishers Co.
 
* Craenen B., Eiben A. (2003): [http://dai.fmph.uniba.sk/courses/ICI/craenen.ci.enc03.pdf Computational Intelligence]. In: Encyclopedia of Life Support Sciences, EOLSS Publishers Co.
* Engelbrecht A. (2007). Computational Intelligence: An Introduction (2nd ed.), John Willey & Sons. Available in the faculty library.
+
* Engelbrecht A. (2007). [http://dai.fmph.uniba.sk/courses/ICI/engelbrecht.comp-intel-intro.07.pdf Computational Intelligence: An Introduction] (2nd ed.), John Willey & Sons.
 
* Russell S., Norwig P. (2010). [http://dai.fmph.uniba.sk/courses/ICI/References/russell-norvig.AI-modern-approach.3ed.2010.pdf Artificial Intelligence: A Modern Approach], (3rd ed.), Prentice Hall. Available in the faculty library.
 
* Russell S., Norwig P. (2010). [http://dai.fmph.uniba.sk/courses/ICI/References/russell-norvig.AI-modern-approach.3ed.2010.pdf Artificial Intelligence: A Modern Approach], (3rd ed.), Prentice Hall. Available in the faculty library.
 
* Marsland S. (2015). [http://dai.fmph.uniba.sk/courses/ICI/References/marsland.machine-learning.2ed.2015.pdf  Machine Learning: An Algorithmic Perspective], (2nd ed.), CRC Press.
 
* Marsland S. (2015). [http://dai.fmph.uniba.sk/courses/ICI/References/marsland.machine-learning.2ed.2015.pdf  Machine Learning: An Algorithmic Perspective], (2nd ed.), CRC Press.
Riadok 109: Riadok 105:
 
== Course grading ==
 
== Course grading ==
  
* Active participation during the seminar/exercise: 5 for lectures, 10 for exercises (max. 15 points)  
+
* Active participation during the seminar/exercise: 5 for lectures, 10 for exercises (max. 15 points).
* Written mid-term test (max. 10 points).
+
* Written mid-term test (max. 15 points).
* Final project: You will implement a small neural network, test it and write a short report  (max. 10 points).
+
* Final written-oral exam (max. 20 points, 4 questions). Minimum of 7 points required.
* Final written-oral exam (max. 15 points, 3 questions). Minimum of 5 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.
 
* <b>Overall grading:</b> A (50-46), B (45-41), C (40-36), D (35-31), E (30-26), Fx (25-0).
 
* <b>Overall grading:</b> A (50-46), B (45-41), C (40-36), D (35-31), E (30-26), Fx (25-0).

Verzia zo dňa a času 16:16, 9. december 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.


News

Exam: The list of questions is here. You will choose three questions (pseudo)randomly.


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. slides 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. slides Engelbrecht (2007), ch.8
03.12. Fuzzy systems, fuzzy logic and reasoning. slides 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).