Non-exhaustive, Overlapping Clustering via Low-Rank Semidefinite Programming
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% confidenceCovers non-exhaustive overlapping clustering via low-rank semidefinite programming, a machine learning technique. Presents a specific algorithmic solution with mathematical grounding.
A 20-minute video from Association for Computing Machinery (ACM): “Non-exhaustive, Overlapping Clustering via Low-Rank Semidefinite Programming”.
Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.
Part of KDD 2015