Clustering: Unsupervised Learning

This lecture covers the clustering problem, where points are grouped into clusters based on distance measures in high-dimensional space. It discusses the characteristics, methods, and examples of clustering, including hierarchical clustering and K-means. The instructor explains the challenges of clustering in high-dimensional spaces and provides insights into the K-means algorithm, its properties, drawbacks, and ways to determine the optimal number of clusters. Additionally, density-based clustering methods like DBSCAN are introduced, highlighting their advantages over centroid-based methods. The lecture concludes with a detailed explanation of DBSCAN algorithm and its performance.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (269)

Related concepts (183)

CS-401: Applied data analysis

This course teaches the basic techniques, methodologies, and practical skills required to draw meaningful insights from a variety of data, with the help of the most acclaimed software tools in the dat

Cluster analysis

Cluster analysis or clustering is the task of grouping a set of objects in such a way that objects in the same group (called a cluster) are more similar (in some sense) to each other than to those in other groups (clusters). It is a main task of exploratory data analysis, and a common technique for statistical data analysis, used in many fields, including pattern recognition, , information retrieval, bioinformatics, data compression, computer graphics and machine learning.

K-means clustering

k-means clustering is a method of vector quantization, originally from signal processing, that aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean (cluster centers or cluster centroid), serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells. k-means clustering minimizes within-cluster variances (squared Euclidean distances), but not regular Euclidean distances, which would be the more difficult Weber problem: the mean optimizes squared errors, whereas only the geometric median minimizes Euclidean distances.

Hierarchical clustering

In data mining and statistics, hierarchical clustering (also called hierarchical cluster analysis or HCA) is a method of cluster analysis that seeks to build a hierarchy of clusters. Strategies for hierarchical clustering generally fall into two categories: Agglomerative: This is a "bottom-up" approach: Each observation starts in its own cluster, and pairs of clusters are merged as one moves up the hierarchy. Divisive: This is a "top-down" approach: All observations start in one cluster, and splits are performed recursively as one moves down the hierarchy.

Single-linkage clustering

In statistics, single-linkage clustering is one of several methods of hierarchical clustering. It is based on grouping clusters in bottom-up fashion (agglomerative clustering), at each step combining two clusters that contain the closest pair of elements not yet belonging to the same cluster as each other. This method tends to produce long thin clusters in which nearby elements of the same cluster have small distances, but elements at opposite ends of a cluster may be much farther from each other than two elements of other clusters.

Data

In common usage and statistics, data (USˈdætə; UKˈdeɪtə) is a collection of discrete or continuous values that convey information, describing the quantity, quality, fact, statistics, other basic units of meaning, or simply sequences of symbols that may be further interpreted formally. A datum is an individual value in a collection of data. Data is usually organized into structures such as tables that provide additional context and meaning, and which may themselves be used as data in larger structures.

Clustering: k-means PHYS-467: Machine learning for physicists

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

Clustering Methods

Covers K-means, hierarchical, and DBSCAN clustering methods with practical examples.

Unsupervised Learning: Clustering Methods CS-401: Applied data analysis

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

Clustering: Theory and Practice CS-233(a): Introduction to machine learning (BA3)

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

Supervised Learning Overview BIO-322: Introduction to machine learning for bioengineers

Covers CNNs, RNNs, SVMs, and supervised learning methods, emphasizing the importance of tuning regularization and making informed decisions in machine learning.