JUMP: A Fast Deterministic Algorithm to Find the Closest Pair of Subsequences.
Xingyu CaiShanglin ZhouSanguthevar RajasekaranPublished in: SDM (2018)
Keyphrases
- learning algorithm
- dynamic programming
- computational complexity
- optimal solution
- detection algorithm
- experimental evaluation
- linear programming
- times faster
- segmentation algorithm
- matching algorithm
- particle swarm optimization
- simulated annealing
- search space
- preprocessing
- convergence rate
- recognition algorithm
- np hard
- relaxation algorithm
- cost function
- multi objective
- significant improvement
- k means
- objective function
- similarity measure
- face recognition