Comparison of User Trajectories with the Needleman-Wunsch Algorithm.
Maros CavojskýMartin DrozdaPublished in: MobiCASE (2019)
Keyphrases
- computational complexity
- cost function
- preprocessing
- matching algorithm
- learning algorithm
- high accuracy
- recognition algorithm
- np hard
- computationally efficient
- times faster
- significant improvement
- data sets
- dynamic programming
- tree structure
- clustering method
- ant colony optimization
- user intervention
- optimization algorithm
- theoretical analysis
- particle swarm optimization
- linear programming
- worst case
- computational cost
- optimal solution
- objective function
- similarity measure
- search engine