MASCOT: Memory-efficient and Accurate Sampling for Counting Local Triangles in Graph Streams.
Yongsub LimU KangPublished in: KDD (2015)
Keyphrases
- memory efficient
- graph search
- random walk
- external memory
- multiple sequence alignment
- graph theory
- directed graph
- structured data
- graph databases
- monte carlo
- bipartite graph
- random sampling
- data structure
- iterative deepening
- integral image
- directed acyclic graph
- graph structure
- connected components
- sample size
- graph representation
- graph theoretic
- sliding window
- computationally efficient
- high accuracy
- semi supervised
- search space
- real time
- massive graphs