Lecture

Biological Subtyping in Psychiatry: Hope, Controversy, and A New Method

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 Principle: Feature Extraction and Similarity Measures

Covers clustering for feature extraction, similarity measures, outliers, and cluster shapes.

Unsupervised learning: Young-Eckart-Mirsky theorem and intro to PCA

Introduces the Young-Eckart-Mirsky theorem and PCA for unsupervised learning and data visualization.

Wastewater Treatment II

Delves into advanced wastewater treatment processes, including oxygen demand, phosphate removal, and biological nitrogen removal, addressing the challenges of micropollutants.

Clustering: Dimensionality Reduction

Explores clustering and dimensionality reduction techniques in finance to clean and simplify data.

Data Preprocessing: Handling Challenges

Delves into advanced data preprocessing techniques, covering categorical encoding, missing data handling, and unbalanced datasets, emphasizing performance metrics and classifier comparison.

Machine Learning Fundamentals

Covers the fundamental principles and methods of machine learning, including supervised and unsupervised learning techniques.

Sludge Dewatering in Wastewater Treatment

Explores sludge dewatering methods in wastewater treatment plants, emphasizing technology, cost efficiency, and safety measures.

K-means Clustering: Assignment and Update Steps

Explains the assignment and update steps in K-means clustering, loss function minimization, and distance metric effects.

Gaussian Mixture Model: EM final form

Explains the E-step and M-step calculations in the Gaussian Mixture Model, including the pseudocode of the EM algorithm.

Nearest Neighbor Rules: Part 2

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

Symbolic Representation of State Spaces

Delves into symbolic representation of state spaces using decision diagrams for high-level Petri nets, showcasing efficient encoding techniques and benchmark results.

Principal Component Analysis: Dimensionality Reduction

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

K-Means Clustering: Image Compression

Covers K-means algorithm for image compression and PCA for dimensionality reduction.

Classification: Introduction

Covers clustering, semi-supervised clustering, and binary classification formalization, along with various classification techniques.

Single cell RNA-sequencing: Methods and Applications

Explores single cell RNA-sequencing methods, applications, tissue studies, and data clustering.

Kernel K-means: Analysis and Applications

Explores Kernel K-means algorithm, its analysis, applications, and limitations in clustering.

Waste Management: Types, Quantities, and Collection

Explores waste types, quantities, collection, and transport, emphasizing the importance of efficient waste recovery and treatment.

Efficient Data Clustering

Covers efficient data exploitation through clustering methods and the optimization of market returns using asset clustering.

Topic Models: Latent Dirichlet Allocation

Covers topic models, focusing on Latent Dirichlet Allocation, clustering, GMMs, Dirichlet distribution, LDA learning, and applications in digital humanities.

Introduction to Clustering: Methods and Applications

Covers the fundamentals of clustering in unsupervised learning and its practical applications.