Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths.
Yung-Chung ChiuHsueh-I LuPublished in: CoRR (2021)
Keyphrases
- experimental evaluation
- objective function
- dynamic programming
- cost function
- learning algorithm
- recognition algorithm
- detection algorithm
- worst case
- evolutionary algorithm
- preprocessing
- simulated annealing
- times faster
- theoretical analysis
- optimization algorithm
- lower bound
- improved algorithm
- data sets
- optimal solution
- high accuracy
- shortest path
- computationally efficient
- similarity matrix
- optimal path
- matching algorithm
- ant colony optimization
- similarity measure
- search space
- particle swarm optimization
- least squares
- computational complexity
- significant improvement
- k means