Entry requirements

120 credits with 25 credits in mathematics, including mathematical statistics, 45 credits in computer science and/or engineering, including Database Design I and a second course in computer programming. Algorithms and Data Structures I is recommended. Proficiency in English equivalent to the Swedish upper secondary course English 6.

Learning outcomes

On completion of the course the student shall be able to:

• explain different methods to extract processed information from large amounts of data, both in theory and in practical application
• use these methods with appropriate tools
• evaluate and compare the suitability of different methods
• make judgments with regard to relevant scientific, social and ethical aspects in the application of data mining
• solve data mining problems in a team.

Content

Introduction to data mining, its terminology and overview over various types of data (for example tables, text, graphs) and its properties, an overview of different methods to explore large amounts of data, data preprocessing (for example normalization, PCA), introduction to classification methods (for example k-NN, C4.5), introduction to clustering methods (for example k-means, single-link, DB-Scan, graph clustering algorithms), introduction to association analysis (for example a priori), handling of personal integrity in the area of data mining, validation.

The subjects are treated both theoretically and practically through laboratory sessions where selected methods are implemented and tested on typical amounts of data.

Instruction

Lectures, seminars, laboratory sessions and project. Guest lecture.

Assessment

Written examination and a project that is presented orally and in writing.

If there are special reasons for doing so, an examiner may make an exception from the method of assessment indicated and allow a student to be assessed by another method. An example of special reasons might be a certificate regarding special pedagogical support from the disability coordinator of the university.