SluitenHelpPrint
Switch to English
Cursus: INFOMDM
INFOMDM
Data mining
Cursus informatieRooster
CursuscodeINFOMDM
Studiepunten (ECTS)7,5
Categorie / NiveauM (M (Master))
CursustypeCursorisch onderwijs
VoertaalEngels
Aangeboden doorFaculteit Betawetenschappen; Graduate School of Natural Sciences; Graduate School of Natural Sciences;
Contactpersoondr. A.J. Feelders
Telefoon+31 30 2533176
E-mailA.J.Feelders@uu.nl
Docenten
Contactpersoon van de cursus
dr. A.J. Feelders
Overige cursussen docent
Docent
dr. A.J. Feelders
Overige cursussen docent
Blok
1-GS  (06-09-2021 t/m 12-11-2021)
Aanvangsblok
1-GS
TimeslotD: D (WO-middag, WO-namiddag, Vrijdag)
Onderwijsvorm
Voltijd
Cursusinschrijving geopendvanaf 31-05-2021 t/m 27-06-2021
AanmeldingsprocedureOsiris Student
Inschrijven via OSIRISJa
Inschrijven voor bijvakkersJa
VoorinschrijvingNee
Na-inschrijvingJa
Na-inschrijving geopendvanaf 23-08-2021 t/m 20-09-2021
WachtlijstJa
Plaatsingsprocedureadministratie onderwijsinstituut
Cursusdoelen

After this course the student knows how several well-known data mining algorithms work, how and when they can be applied, and how the resulting models and patterns should be interpreted.
Furthermore, the student understands general problems of data-analysis, such as overfitting, the curse of dimensionality, and model selection.
Finally, the student gains practical experience with the programming and application of data mining algorithms through practical assignments.

Assessment
The course is graded through a written exam, two practical assignments and homework exercises.

With grades P1 and P2 for the practical assignments, grade E for the written exam, and grade H for the homework exercises, the final grade F is computed as follows:

F = 0.5 * E + 0.3 * P1 + 0.2 * P2 + 0.1 * H.

To pass the course, it is required that each practical assignment has grade at least 6 and the grade for the written exam is at least 5. There are 4 homework exercise sets. Ten percent of the average grade H of these four sets counts as a bonus. There is no minimum requirement for the homework exercises.

  • F is rounded to the nearest tenth of a point if F >= 6.0.
  • F is rounded to the nearest whole point if F < 6.0.
  • The maximum final grade is 10.
Participation in the repair test requires that the original final grade is 4 or 5, or AANV.

Prerequisites
It is required that the student has:
  1. Knowledge of algorithms and data structures, at the level of the bachelor course INFODS Datastructuren.
  2. Successfully completed a serious programming course, such as the bachelor course INFOIMP Imperatief Programmeren
    Experience with using packages in R or Python is not sufficient.
  3. Knowledge of probability and statistics, at the level of INFOB3OMI Onderzoeksmethoden voor Informatica.
  4. Knowledge of linear algebra (such as treated in the bachelor course  INFOGR Graphics).
Inhoud

This course is aimed at students of the Computing Science (COSC) master program.

Topics covered include (content can vary somewhat from year to year):

  • Classification Tree Algorithms, Bagging and Random Forests
  • Graphical Models (including Bayesian Networks)
  • Frequent Pattern Mining
  • Text Mining
  • Social Network Mining
Course form
Lectures and Computer Lab.

Literature
Selected book chapters, articles, and lecture notes.
Competenties
-
Ingangseisen
Je moet voldoen aan de volgende eisen
  • Toelatingsbeschikking voor de master toegekend
Voorkennis
This course is aimed at students of the Computing Science (COSC) master program.
It is assumed that the student has:

(1) Knowledge of algorithms and data structures, at the level of the bachelor course "Datastructuren".
(2) Successfully completed a serious programming course, such as the bachelor course "Imperatief Programmeren".
(3) Knowledge of probability and statistics, at the level of "Onderzoeksmethoden voor Informatica".
Voorkennis kan worden opgedaan met
(4) Knowledge of linear algebra (such as treated in the bachelor course Graphics
Verplicht materiaal
-
Aanbevolen materiaal
Software
R for Windows (beschikbaar in MyWorkPlace)
Werkvormen
Hoorcollege

Werkcollege

Toetsen
Eindresultaat
Weging100
Minimum cijfer-

SluitenHelpPrint
Switch to English