An extremely fast algorithm for identifying high closeness centrality vertices in large-scale networks.
Vladimir UfimtsevSanjukta BhowmickPublished in: IA3@SC (2014)
Keyphrases
- cost function
- high accuracy
- high efficiency
- detection algorithm
- experimental evaluation
- k means
- significant improvement
- dynamic programming
- improved algorithm
- learning algorithm
- computationally efficient
- recognition algorithm
- search space
- optimal solution
- convergence rate
- network analysis
- worst case
- image sequences
- optimization algorithm
- network structure
- probabilistic model
- times faster
- convex hull
- expectation maximization
- linear programming
- mobile robot
- np hard
- preprocessing
- computational complexity
- similarity measure
- image segmentation