YoVDO

A Nearly Tight Analysis of Greedy k-means++

Offered By: Google TechTalks via YouTube

Tags

K-means Courses Data Analysis Courses Machine Learning Courses scikit-learn Courses Computational Complexity Courses Sampling Courses Greedy Algorithms Courses Clustering Courses Approximation Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a Google TechTalk presented by Václav Rozhoň on the analysis of the greedy k-means++ algorithm. Delve into the popular k-means++ algorithm for solving the k-means problem, its implementation, and the guarantees of its greedy variant. Learn about the O(ℓ^3 * log^3 k)-approximation algorithm and the near-matching lower bound. Gain insights into distributed and parallel algorithms from a PhD student at ETH Zurich. Discover the implications of this research for practical applications in machine learning and data analysis.

Syllabus

A Nearly Tight Analysis of Greedy k-means++


Taught by

Google TechTalks

Related Courses

Introduction to Artificial Intelligence
Stanford University via Udacity Natural Language Processing
Columbia University via Coursera Probabilistic Graphical Models 1: Representation
Stanford University via Coursera Computer Vision: The Fundamentals
University of California, Berkeley via Coursera Learning from Data (Introductory Machine Learning course)
California Institute of Technology via Independent