MASCOT: Memory-efficient and Accurate Sampling for Counting Local Triangles in Graph Streams

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% confidence

Describes MASCOT, an algorithm for efficiently counting local triangles in streaming graph data with memory constraints. A concrete solution to a graph analysis problem.

A 33-minute video from Association for Computing Machinery (ACM): “MASCOT: Memory-efficient and Accurate Sampling for Counting Local Triangles in Graph Streams”.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of KDD 2015