A discrete particle swarm optimization box-covering algorithm for fractal dimension on complex networks.
Li KuangFeng WangYuanxiang LiHaiqiang MaoMin LinFei YuPublished in: CEC (2015)
Keyphrases
- fractal dimension
- complex networks
- discrete particle swarm optimization
- dynamic programming
- cost function
- np hard
- objective function
- optimal solution
- pattern recognition
- computational complexity
- community detection
- box counting
- image processing
- betweenness centrality
- fractal analysis
- particle swarm optimization algorithm
- knapsack problem
- computational efficiency
- matching algorithm
- optimization algorithm
- particle swarm optimization
- simulated annealing
- search space