Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Kernel K-means: Iterative Clustering Algorithm
Graph Chatbot
Related lectures (32)
Time Series Clustering
Covers clustering time series data using dynamic time warping, string metrics, and Markov models.
Clustering: Hierarchical and K-means Methods
Introduces hierarchical and k-means clustering methods, discussing construction approaches, linkage functions, Ward's method, the Lloyd algorithm, and k-means++.
Unsupervised Learning: Clustering & Dimensionality Reduction
Introduces unsupervised learning through clustering with K-means and dimensionality reduction using PCA, along with practical examples.
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.
Clustering Algorithms: K-Means vs Spectral Clustering
Compares K-Means and Spectral Clustering algorithms, highlighting their differences and practical applications in clustering student behaviors.
Statistical Physics of Clusters
Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.
Clustering Methods: K-means and DBSCAN
Explores K-means and DBSCAN clustering methods, discussing properties, drawbacks, initialization, and optimal cluster selection.
Clustering Methods: K-means and Density Clustering
Explores k-means, kernel trick, and density clustering methods for non-convex clusters.
K-means Algorithm
Covers the K-means algorithm for clustering data samples into k classes without labels, aiming to minimize the loss function.
Nearest Neighbor Rules: Part 2
Explores the Nearest Neighbor Rules, k-NN algorithm challenges, Bayes classifier, and k-means algorithm for clustering.
Characterisation of Clusters: Homogeneity, Separability
Explores centroid, medoid, homogeneity, separability in clustering, quality evaluation, stability, expert knowledge, and clustering algorithms.
Kernel K-Means Method
Introduces the kernel k-means method to form non-convex clusters and discusses clustering by density to identify dense regions in datasets.
Previous
Page 2 of 2
Next