Mathematics for Data Science

This course is over.

Lectures and Tutorials (6 SWS/9 ECTS)

This course provides a coherent treatment of the mathematical tools and techniques from stochastics, linear algebra and numerical mathematics underlying today's machine learning and big data technologies. Topics include probability theory, descriptive and inductive statistics, Markov chains, eigenspace analysis, matrix factorization, and sampling.

Knowledge equivalent to an introductory course on discrete mathematics is required for this class.

Times  

Lectures:Tuesday, 17:00-18:30, P 712 (Sven Kosub)
Thursday, 13:30-15:00, G 309 (Sven Kosub)
Tutorials:Wednesday, 17:00-18:30, M 631 (Simon . Giebenhain @ uni.kn)
Written exam:Thursday, July 19, 2018, 13:30-15:00, G 309 (1st date)
October 2018 (2nd date)

Homework Assignments (login access)

Assignment sheets are made available on this webpage as a PDF-file (in English) every Friday. The editing time for each homework is about one week. It is due on the next Friday  at 12:00 (via email to the Teaching Assistant). The assignments are to be delivered in written form in English. The corrected and scored assignments will be returned in the next tutorial.

Content

The following topics are planned:

  • Descriptive statistics
  • Probability theory
  • Inductive statistics
  • Stochastic processes
  • Eigenspaces
  • Matrix factorization
  • Sampling

Lecture Notes (login access)

German (!) lecture notes are made available close in time to the lectures. The current version can be downloaded here. In case you have suggestions or comments (typos or any kind of errors) please send an email.

Literature

In-depth and background material of certain course aspects can be found in (the list will be constantly updated):

  • Avrim Blum, John Hopcroft, Ravindran Kannan. Foundations of Data Science. An online textbook draft, 2017.
  • Peter Grindrod. Mathematical Underpinnings of Analytics. Oxford University Press, Oxford, 2014.
  • Ankur Moitra. Algorithmic Aspects of Machine Learning. An online textbook draft, 2014.
  • Olle Häggström. Finite Markov Chains and Algorithmic Applications. Cambridge University Press, Cambridge, 2001.
  • Thomas Schickinger, Angelika Steger. Diskrete Strukturen. Band 2: Wahrscheinlichkeitstheorie und Statistik. Springer-Verlag, Berlin, 2002.