m (Removal of 25% limit for exam.)
(Opravenie datumov a miestnosti pre ZS 2019/2020)
Line 11: Line 11:
  
 
== News ==
 
== News ==
* Cvičenia 26.9. odpadávajú kvôli rektorskému voľnu.
+
''No news yet''
  
 
== Course schedule ==
 
== Course schedule ==
Line 22: Line 22:
 
|-
 
|-
 
|Lecture
 
|Lecture
|Thursday
+
|Wednesday
|11:30
+
|14:50
|M-X
+
|I-23
 
|[[Maria Markosova|Mária Markošová]],  [[Lubica Benuskova|Ľubica Beňušková]]
 
|[[Maria Markosova|Mária Markošová]],  [[Lubica Benuskova|Ľubica Beňušková]]
 
|-
 
|-
 
|Exercises
 
|Exercises
|Wednesday
+
|Thursday
|9:50
+
|14:50
 
|I-H3
 
|I-H3
 
|[[Juraj Holas|Juraj Holas]]
 
|[[Juraj Holas|Juraj Holas]]
Line 43: Line 43:
 
!References
 
!References
 
|-
 
|-
|27.09.
+
|25.09.
 
|What is artificial intelligence, properties and types of agents. Uninformed search - state space, uninformed search algorithms, DFS, BFS.
 
|What is artificial intelligence, properties and types of agents. Uninformed search - state space, uninformed search algorithms, DFS, BFS.
 
|R&N, ch.2-3.4
 
|R&N, ch.2-3.4
 
|-
 
|-
|04.10.
+
|02.10.
 
|Informed search, A* algorithm, heuristics and their properties.
 
|Informed search, A* algorithm, heuristics and their properties.
 
|R&N, ch.3.5-3.6
 
|R&N, ch.3.5-3.6
 
|-
 
|-
|11.10.
+
|9.10.
 
|Constraint satisfaction problem: definition, heuristics, methods of solving.  
 
|Constraint satisfaction problem: definition, heuristics, methods of solving.  
 
|R&N, ch.6
 
|R&N, ch.6
 
|-
 
|-
|18.10.
+
|16.10.
 
|Local search, looking for an optimum, hill climbing, genetic algorithm, simulated annealing etc.
 
|Local search, looking for an optimum, hill climbing, genetic algorithm, simulated annealing etc.
 
|R&N, ch.4.1
 
|R&N, ch.4.1
 
|-
 
|-
|25.10.
+
|23.10.
 
|Basics of game theory, MiniMax algorithm, Alpha-Beta pruning, ExpectiMiniMax.
 
|Basics of game theory, MiniMax algorithm, Alpha-Beta pruning, ExpectiMiniMax.
 
|R&N, ch.5
 
|R&N, ch.5
 
|-
 
|-
|08.11.
+
|6.11.
 
|Logical agents:  inference in logical knowledge base.
 
|Logical agents:  inference in logical knowledge base.
 
|R&N, ch.7
 
|R&N, ch.7
 
|-
 
|-
|15.11.
+
|13.11.
 
|Supervised learning: linear and non-linear regression, binary perceptron.
 
|Supervised learning: linear and non-linear regression, binary perceptron.
 
|R&N, ch.18.1-18.2, 18.6-18.6.3
 
|R&N, ch.18.1-18.2, 18.6-18.6.3
 
|-
 
|-
|22.11.
+
|20.11.
 
|Multi-layer perceptron, idea of error backpropagation.
 
|Multi-layer perceptron, idea of error backpropagation.
 
|R&N, ch.18.6.4-18.7.5
 
|R&N, ch.18.6.4-18.7.5
 
|-
 
|-
|29.11.
+
|27.11.
 
|Applications of multi-layer perceptron: sonar, NetTalk, ALVINN, LeNet
 
|Applications of multi-layer perceptron: sonar, NetTalk, ALVINN, LeNet
 
|
 
|
 
|-
 
|-
|06.12.
+
|4.12.
 
|Unsupervised learning: K-means clustering, KNN, Self-organizing map, Principal component analysis
 
|Unsupervised learning: K-means clustering, KNN, Self-organizing map, Principal component analysis
 
|R&N, ch.18.8-18.8.2
 
|R&N, ch.18.8-18.8.2
 
|-
 
|-
|13.12.
+
|11.12.
 
|Weight optimization of MLP using genetic algorithms, evolutionary robotics
 
|Weight optimization of MLP using genetic algorithms, evolutionary robotics
 
|
 
|
 
|-
 
|-
|20.12.
+
|18.12.
 
|Quo vadis AI? Problems and visions of future AI methods
 
|Quo vadis AI? Problems and visions of future AI methods
 
|R&N, ch. 26
 
|R&N, ch. 26
Line 105: Line 105:
 
* Project (15%)
 
* Project (15%)
 
* Final exam (50%)
 
* Final exam (50%)
You can gain 25% for exercises, 10% for tests and 15% for the project. You have to earn at least half from each of these. The final exam is worth 50% of the total mark. If you do not meet minimal condition from the semester, then you cannot pass the exam.
+
Throughout the semester, you can gain 25% for exercises, 10% for tests and 15% for the project. You have to earn at least half from each of these. If you do not meet minimal condition from the semester, then you cannot pass the exam. The final exam is worth 50% of the total mark.
  
 
'''Overall grading:''' A (100-91), B (90-81), C (80-71), D (70-61), E (60-51), Fx (50-0).
 
'''Overall grading:''' A (100-91), B (90-81), C (80-71), D (70-61), E (60-51), Fx (50-0).

Revision as of 11:08, 14 September 2019

Introduction to Artificial Intelligence 1-AIN-304

The course objectives are to provide the students with basic insight into artificial intelligence, that can further be extended in the master programmes. The course covers the basics of symbolic and nature-inspired methods of artificial intelligence. The theory is combined with practical exercises.

For exercises, project assignments, and lecture slides, please see LIST.

News

No news yet

Course schedule

Type Day Time Room Lecturer
Lecture Wednesday 14:50 I-23 Mária Markošová, Ľubica Beňušková
Exercises Thursday 14:50 I-H3 Juraj Holas


Lecture syllabus

Date Topic References
25.09. What is artificial intelligence, properties and types of agents. Uninformed search - state space, uninformed search algorithms, DFS, BFS. R&N, ch.2-3.4
02.10. Informed search, A* algorithm, heuristics and their properties. R&N, ch.3.5-3.6
9.10. Constraint satisfaction problem: definition, heuristics, methods of solving. R&N, ch.6
16.10. Local search, looking for an optimum, hill climbing, genetic algorithm, simulated annealing etc. R&N, ch.4.1
23.10. Basics of game theory, MiniMax algorithm, Alpha-Beta pruning, ExpectiMiniMax. R&N, ch.5
6.11. Logical agents: inference in logical knowledge base. R&N, ch.7
13.11. Supervised learning: linear and non-linear regression, binary perceptron. R&N, ch.18.1-18.2, 18.6-18.6.3
20.11. Multi-layer perceptron, idea of error backpropagation. R&N, ch.18.6.4-18.7.5
27.11. Applications of multi-layer perceptron: sonar, NetTalk, ALVINN, LeNet
4.12. Unsupervised learning: K-means clustering, KNN, Self-organizing map, Principal component analysis R&N, ch.18.8-18.8.2
11.12. Weight optimization of MLP using genetic algorithms, evolutionary robotics
18.12. Quo vadis AI? Problems and visions of future AI methods R&N, ch. 26

References

Course grading

The course grading consists of four parts:

  • Exercises (25%)
  • Short tests (10%)
  • Project (15%)
  • Final exam (50%)

Throughout the semester, you can gain 25% for exercises, 10% for tests and 15% for the project. You have to earn at least half from each of these. If you do not meet minimal condition from the semester, then you cannot pass the exam. The final exam is worth 50% of the total mark.

Overall grading: A (100-91), B (90-81), C (80-71), D (70-61), E (60-51), Fx (50-0).