Fast Dual-Tree k-means with Bounded Single-Iteration Runtime

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Explains fast dual-tree k-means with bounded iteration runtime. Teaches scalable clustering algorithm design.

A 59-minute video from Microsoft Research: “Fast Dual-Tree k-means with Bounded Single-Iteration Runtime”.

Video by Microsoft Research, played through YouTube's embedded player.

Part of Candidate Talk