Tracking local communities in streaming graphs with a dynamic algorithm.
Anita ZakrzewskaDavid A. BaderPublished in: Soc. Netw. Anal. Min. (2016)
Keyphrases
- computational complexity
- real time
- preprocessing
- k means
- cost function
- expectation maximization
- learning algorithm
- object tracking algorithm
- np hard
- dynamic programming
- graph matching
- object tracking
- detection algorithm
- tracking of multiple objects
- graph structure
- worst case
- search space
- objective function
- particle filter
- kalman filter
- moving target
- random graphs
- optimal solution