Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams.
Jingjing WangYanhao WangWenjun JiangYuchen LiKian-Lee TanPublished in: CoRR (2022)
Keyphrases
- computationally efficient
- computationally intensive
- computationally expensive
- uniform sampling
- data streams
- graph theory
- learning algorithm
- random sampling
- exact and approximate
- motif discovery
- random graphs
- single pass
- web graph
- streaming data
- temporal data
- directed acyclic graph
- temporal information
- data mining techniques
- worst case
- spatio temporal
- data structure
- bayesian networks