Mixed Bregman Clustering with Approximation Guarantees thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Mixed Bregman Clustering with Approximation Guarantees

Published on Oct 10, 20083250 Views

Two recent breakthroughs have dramatically improved the scope and performance of k-means clustering: squared Euclidean seeding for the initialization step, and Bregman clustering for the iterative ste