Lecture

Decision Trees: Induction and Pruning

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)

Learning Sparse Features: Overfitting in Neural Networks

Discusses how learning sparse features can lead to overfitting in neural networks despite empirical evidence of generalization.

Graph Neural Network Architectures: A Comparative Study

Explores the choice of graph neural network architectures, evaluating model complexity and performance based on data statistics.

Regression Trees and Ensemble Methods in Machine Learning

Discusses regression trees, ensemble methods, and their applications in predicting used car prices and stock returns.

Quantifying Information: Probability, Entropy, and Constraints

Explores quantifying information based on probability, entropy, and constraints in communication systems.

Supervised Learning: k-NN and Decision Trees

Introduces supervised learning with k-NN and decision trees, covering techniques, examples, and ensemble methods.

Kinetic Isotope Effects and Linear Free Energy Relationships

Explores kinetic isotope effects and Linear Free Energy Relationships, introducing machine learning methods for chemistry applications.

Document Classification

Explores document classification methods, including Naïve Bayes and word embeddings.

Texture Analysis: Statistical and Structural Approaches

Discusses texture analysis in images, focusing on statistical and structural properties, segmentation techniques, and machine learning applications for texture classification.

Ensemble Methods: Random Forest

Explores random forests as a powerful ensemble method for classification, discussing bagging, stacking, boosting, and sampling strategies.

Nearest Neighbor Rules: Part 2

Explores the Nearest Neighbor Rules, k-NN algorithm challenges, Bayes classifier, and k-means algorithm for clustering.

Linear Models for Classification: Multi-Class Extensions

Covers linear models for multi-class classification, focusing on logistic regression and evaluation metrics.

Gaussian Mixture Models: Data Classification

Explores denoising signals with Gaussian mixture models and EM algorithm, EMG signal analysis, and image segmentation using Markovian models.

Linear Models and Overfitting

Explores linear models, overfitting, and the importance of feature expansion and adding more data to reduce overfitting.

Principal Component Analysis: Dimensionality Reduction

Explores Principal Component Analysis for dimensionality reduction and unsupervised feature selection.

Machine Learning Basics

Introduces the basics of machine learning, covering supervised classification, decision boundaries, and polynomial curve fitting.

Machine Learning Fundamentals

Introduces machine learning basics, performance metrics, optimization techniques, and model evaluation.

Data Representations and Processing

Discusses overfitting, model selection, cross-validation, regularization, data representations, and handling imbalanced data in machine learning.

Nonlinear ML Algorithms

Introduces nonlinear ML algorithms, covering nearest neighbor, k-NN, polynomial curve fitting, model complexity, overfitting, and regularization.

Mutual Information: Continued

Explores mutual information for quantifying statistical dependence between variables and inferring probability distributions from data.

Perception: Data-Driven Approaches

Explores perception in deep learning for autonomous vehicles, covering image classification, optimization methods, and the role of representation in machine learning.