FURL: Fixed-memory and Uncertainty Reducing Local Triangle Counting for Graph Streams.
Minsoo JungSunmin LeeYongsub LimU KangPublished in: CoRR (2016)
Keyphrases
- memory requirements
- data streams
- weighted graph
- graph structure
- random walk
- memory space
- graph theory
- graph partitioning
- graph representation
- directed acyclic graph
- directed graph
- probability measure
- graph based algorithm
- probability theory
- decision theory
- inherent uncertainty
- neural network
- real time
- belief functions
- streaming data
- graph theoretic
- memory usage
- graph mining
- associative memory
- transactional data
- memory size
- connected components
- multi stream
- data structure
- incoming data