Unsupervised learning: Young-Eckart-Mirsky theorem and intro to PCA
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Covers the principles and methods of clustering in machine learning, including similarity measures, PCA projection, K-means, and initialization impact.
Explores decision-making under uncertainty, focusing on Kilian Schindler's posthumous PhD thesis on scalable stochastic optimization and scenario reduction.
