An Efficient Algorithm for the Equation Tree Automaton via the $k$-C-Continuations.
Ludovic MignotNadia Ouali SebtiDjelloul ZiadiPublished in: CoRR (2014)
Keyphrases
- preprocessing
- high accuracy
- learning algorithm
- matching algorithm
- tree structure
- optimization algorithm
- worst case
- mathematical model
- clustering method
- detection algorithm
- times faster
- recognition algorithm
- experimental evaluation
- spanning tree
- significant improvement
- k means
- binary tree
- objective function
- dynamic programming
- np hard
- optimal solution
- graph structure
- tree construction
- finite state automata
- pattern matching
- theoretical analysis
- particle swarm optimization
- state space
- computational cost
- cost function
- search algorithm
- data structure
- similarity measure