StreaM - A Stream-Based Algorithm for Counting Motifs in Dynamic Graphs.
Benjamin SchillerSven JagerKay HamacherThorsten StrufePublished in: AlCoB (2015)
Keyphrases
- cost function
- detection algorithm
- k means
- learning algorithm
- optimal solution
- computational complexity
- graph clustering
- significant improvement
- spanning tree
- weighted graph
- expectation maximization
- motif finding
- neural network
- minimum spanning tree
- sliding window
- segmentation algorithm
- simulated annealing
- worst case
- dynamic programming
- np hard
- data streams
- objective function