Kernel K-means Clustering

This lecture covers the Kernel K-means algorithm, an iterative procedure involving cluster initialization, data point assignment to centroids, and cluster update steps until stability. It explores the influence of terms on clustering using the RBF kernel, interpreting the objective function, and the impact of data point distribution on clustering results. The lecture also discusses interpreting the solution, density versus number of points, and the effect of polynomial kernels on clustering boundaries. Various methods for handling missing data, encoding categorical values, and dealing with unbalanced datasets are presented, along with techniques like down-sampling and over-sampling. The importance of dataset selection, preprocessing, and visualization is emphasized, with examples from different domains like gene expression, cancer RNA-Seq, and online retail datasets.

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 (37)

Related concepts (38)

MICRO-455: Applied machine learning

Real-world engineering applications must cope with a large dataset of dynamic variables, which cannot be well approximated by classical or deterministic models. This course gives an overview of method

Data and information visualization (data viz or info viz) is the practice of designing and creating easy-to-communicate and easy-to-understand graphic or visual representations of a large amount of complex quantitative and qualitative data and information with the help of static, dynamic or interactive visual items.

Deep learning is part of a broader family of machine learning methods, which is based on artificial neural networks with representation learning. The adjective "deep" in deep learning refers to the use of multiple layers in the network. Methods used can be either supervised, semi-supervised or unsupervised.

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.

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.

Scientific visualization (also spelled scientific visualisation) is an interdisciplinary branch of science concerned with the visualization of scientific phenomena. It is also considered a subset of computer graphics, a branch of computer science. The purpose of scientific visualization is to graphically illustrate scientific data to enable scientists to understand, illustrate, and glean insight from their data.

Explores document analysis, topic modeling, and generative models for data generation in machine learning.

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

Covers dimensionality reduction techniques like PCA and LDA, clustering methods, density estimation, and data representation.

Explores the Kernel K-means iterative clustering algorithm and its influence on cluster density and point proximity.

Explores the Kernel K-Means algorithm, convergence proof, RBF kernel influence, and clustering interpretation.