An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
Ming-Yang KaoTak Wah LamWing-Kin SungHing-Fung TingPublished in: CoRR (2001)
Keyphrases
- optimization algorithm
- detection algorithm
- times faster
- matching algorithm
- learning algorithm
- recognition algorithm
- k means
- cost function
- expectation maximization
- segmentation algorithm
- tree structure
- experimental evaluation
- dynamic programming
- np hard
- tree construction
- input data
- improved algorithm
- high accuracy
- worst case
- computational cost
- significant improvement
- computational complexity
- objective function
- neural network
- data sets
- computationally efficient
- theoretical analysis
- simulated annealing
- path planning
- search space
- real valued
- approximation algorithms