EECS 474
Algorithms for Data Science
Fundamental techniques and mathematical methods for designing and analyzing algorithms used in data science and machine learning. Topics include randomized algorithms (sketching), streaming algorithms (frequent items), dimensionality reduction (Johnson-Lindenstrauss embeddings), matrix approximation (randomized singular value decomposition), optimization (stochastic gradient descent, Newton's method), and graph algorithms (spectral clustering).
Topics
- randomized algorithms (sketching)
- streaming algorithms (frequent items)
- dimensionality reduction (Johnson-Lindenstrauss embeddings)
- matrix approximation (randomized singular value decomposition)
- optimization (stochastic gradient descent
- Newton's method)
- and graph algorithms (spectral clustering)
Topics explicitly listed in official catalogue description
Prerequisites & course information
EECS 376 or a proof-based math course. (BS). May not be repeated for credit.
Sources
Catalogue variants
- Algorithms for Data Science · 4 · College of Engineering catalogue
- Algorithms for Data Science · Graduate credit