A Nearly Tight Analysis of Greedy k-means++
945 views
About this video
Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceAnalyzes k-means++ clustering algorithm, teaching approximation analysis and randomized algorithms. Theoretical computer science seminar.
A 52-minute video from Google TechTalks: “A Nearly Tight Analysis of Greedy k-means++”.
Video by Google TechTalks, played through YouTube's embedded player.