Markus Schweighofer - Aktuelle Lehrveranstaltungen
WS 2025/2026 Linear Algebra in Data Science
9 ECTS credits, 4V+2Ü+P (P stands for programming projects in Julia) Materials Target audience: Students of all disciplines
who like to do computer programming,
who either know already or are not afraid to learn a tiny bit of linear algebra and machine learning
who want to experience some basic mathematical techniques for extracting information from data.
The topics can be adapted to the participants' interests. Any suggestions are very welcome! A priori possible topics could be a set having a non-empty intersection with the following:
vectors, norm, distance, angles and matrices
clustering
matrix multiplication
singular value decomposition
Fourier and wavelet transforms
sparsity and compressive sensing
tensor decompositions
deep neural networks
learning from graph eigenvalues: sparse cuts in graphs, page ranking
Applications such as image compression and video decomposition could serve as running examples. Here are for example three videos that have been created with a few lines of Julia code
by a standard singular value decomposition (which is a technique that applies in a similar way to most kinds of data). The videos show a "rough + details" decomposition where the rough (data-compressed) part is shown in the upper video and the details are shown in the lower video: