A Dynamic Algorithm for Linear Algebraically Computing Nonbacktracking Walk Centrality.
Eisha NathanPublished in: COMPLEX NETWORKS (2) (2020)
Keyphrases
- preprocessing
- detection algorithm
- dynamic programming
- computational cost
- probabilistic model
- similarity measure
- objective function
- linear systems
- k means
- linear programming
- improved algorithm
- times faster
- computational complexity
- cost function
- np hard
- recognition algorithm
- convergence rate
- significant improvement
- closed form
- theoretical analysis
- worst case
- experimental evaluation
- dynamic environments
- expectation maximization
- maximum likelihood
- input data
- face recognition
- optimal solution
- iterative algorithms
- linear complexity