|
SGN-2806 Neural Computation, 5 cr |
Ari Visa
Lecture times and places | Target group recommended to | |
Implementation 1 |
|
Final exam, attendance at the classroom exercises and assignment.
Completion parts must belong to the same implementation
-
Learning outcomes: The student can list the mentioned learning rules. The student can describe them and is capable to apply them to train neural networks. The student is capable to list to analyse the lectured neural networks (MLP,SVM,SOM and recurrent networks). The student is capable to analyse the own problem and to select the most suitable, lectured neural network. The student has a certain capability to create new solutions based on the lectured material.
Content | Core content | Complementary knowledge | Specialist knowledge |
1. | Learning processes | ||
2. | Learning machines with a teacher | Multilayer Perceptrons Radial-Basis Function Networks Support Vector Machines Committee Machines | |
3. | Learning machines without a teacher | Principal Component Analysis with Neural Networks Self-Organizig Maps Boltzmann Machine | |
4. | Nonlinear dynamical systems | Temporal Processing Using Feed Forward Network Dynamically Driven Recurrent Network |
Exam and approx. 70% attendance at the exercises.
Numerical evaluation scale (1-5) will be used on the course
Type | Name | Author | ISBN | URL | Edition, availability, ... | Examination material | Language |
Book | "Neural Networks: a Comprehensive Foundation" | Haykin, S. | 2nd edition, Prentice-Hall Inc, 1999 | English |
Course | Mandatory/Advisable | Description |
MAT-31090 Matriisilaskenta 1 | Advisable | |
MAT-41120 Matemaattinen optimointiteoria 1 | Advisable |
Course | Corresponds course | Description |
|
|
Lectures in English or in Finnish.
Description | Methods of instruction | Implementation | |
Implementation 1 | The course concentrates on basic and some more advanced methods of neuro computing. |
Contact teaching: 0 % Distance learning: 0 % Self-directed learning: 0 % |