Lecture

Nearest Neighbor Rules: Part 2

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)

Gaussian Naive Bayes & K-NN

Covers Gaussian Naive Bayes, K-nearest neighbors, and hyperparameter tuning in machine learning.

Unsupervised Learning: Clustering & Dimensionality Reduction

Introduces unsupervised learning through clustering with K-means and dimensionality reduction using PCA, along with practical examples.

Machine Learning Fundamentals

Introduces fundamental machine learning concepts, covering regression, classification, dimensionality reduction, and deep generative models.

Clustering Methods: K-means and DBSCAN

Explores K-means and DBSCAN clustering methods, discussing properties, drawbacks, initialization, and optimal cluster selection.

Unsupervised Learning: PCA & K-means

Covers unsupervised learning with PCA and K-means for dimensionality reduction and data clustering.

Clustering: K-Means

Covers clustering and the K-means algorithm for partitioning datasets into clusters based on similarity.

Clustering: K-means & LDA

Covers clustering using K-means and LDA, PCA, K-means properties, Fisher LDA, and spectral clustering.

Ensemble Methods: Random Forests

Covers ensemble methods like random forests and Gaussian Naive Bayes, explaining how they improve prediction accuracy and estimate conditional Gaussian distributions.

Clustering: k-means

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

Machine Learning: Features and Model Selection

Delves into the significance of features, model evolution, labeling challenges, and model selection in machine learning.

Unsupervised Learning: Dimensionality Reduction and Clustering

Covers unsupervised learning, focusing on dimensionality reduction and clustering, explaining how it helps find patterns in data without labels.

Applied Machine Learning

Introduces applied machine learning concepts such as data collection, feature engineering, model selection, and performance evaluation metrics.

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.

Semi-supervised Clustering: Transductive SVM

Explores Transductive Support Vector Machine for semi-supervised clustering, aiming for zero error on labeled points and well-separated unlabeled points.

Machine Learning Fundamentals

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

Kernel K-means Clustering

Explores Kernel K-means clustering, interpreting solutions, handling missing data, and dataset selection for machine learning.

Dimensionality Reduction: PCA & t-SNE

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

Clustering Methods and Dimensionality Reduction

Covers clustering methods and dimensionality reduction techniques.

Clustering: Theory and Practice

Covers the theory and practice of clustering algorithms, including PCA, K-means, Fisher LDA, spectral clustering, and dimensionality reduction.

Graph Coloring II

Explores advanced graph coloring concepts, including planted coloring, rigidity threshold, and frozen variables in BP fixed points.