Lecture

Introduction to Machine Learning

Graph Chat

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.

Related lectures (64)

Clustering & Density Estimation

Covers dimensionality reduction, clustering, and density estimation techniques, including PCA, K-means, GMM, and Mean Shift.

Unsupervised Learning: Clustering Methods

Covers unsupervised learning focusing on clustering methods and the challenges faced in clustering algorithms like K-means and DBSCAN.

Advanced Machine Learning: Fundamentals and Applications

Covers the fundamentals of advanced machine learning, emphasizing practical applications through interactive exercises and projects.

K-Means Clustering: Basics and Applications

Introduces K-Means Clustering, a simple yet effective algorithm for grouping data points into clusters.

Principal Component Analysis: Dimensionality Reduction

Covers Principal Component Analysis for dimensionality reduction, exploring its applications, limitations, and importance of choosing the right components.

Introduction to Machine Learning

Covers the basics of machine learning for physicists and chemists, focusing on image classification and dataset labeling.

Unsupervised Learning: Clustering and Dimension Reduction

Covers unsupervised learning, clustering, and dimension reduction techniques.

Unsupervised Learning: Clustering Methods

Explores unsupervised learning through clustering methods like K-means and DBSCAN, addressing challenges and applications.

Machine Learning Fundamentals: Structure Discovery, Classification, Regression

Covers fundamental machine learning concepts including Structure Discovery, Classification, and Regression.

Dimensionality Reduction: PCA & t-SNE

Explores PCA and t-SNE for reducing dimensions and visualizing high-dimensional data effectively.

Introduction to Machine Learning: Supervised Learning

Introduces supervised learning, covering classification, regression, model optimization, overfitting, and kernel methods.

Quantum Chemistry Applications

Explores quantum chemistry applications, emphasizing the role of electron density in predicting chemical properties and addressing challenges in catalyst design, solar energy conversion, and drug synthesis.

Unsupervised Machine Learning: Clustering Basics

Introduces unsupervised machine learning clustering techniques like K-means, Gaussian Mixture Models, and DBSCAN, explaining their algorithms and applications.

Machine Learning Review

Covers a review of machine learning concepts, including supervised learning, classification vs regression, linear models, kernel functions, support vector machines, dimensionality reduction, deep generative models, and cross-validation.

Machine Learning Basics

Introduces the basics of machine learning, covering supervised and unsupervised learning, linear regression, and data understanding.

Clusters and Communities

Explores clustering, community detection, K-means, GMM, modularity, and the Louvain method.

Gradient Descent and Linear Regression

Covers stochastic gradient descent, linear regression, regularization, supervised learning, and the iterative nature of gradient descent.

Image Representation Insights

Explores the evolution of image representation, challenges in supervised learning, benefits of self-supervised learning, and recent advancements in SSL.

Binary Classification by Regression: Decision Functions and Cost Functions

Explores binary classification by regression, decision functions, and various cost functions.

Clustering: k-means

Explains k-means clustering, assigning data points to clusters based on proximity and minimizing squared distances within clusters.