An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees.
Jason Tsong-Li WangBruce A. ShapiroDennis E. ShashaKaizhong ZhangKathleen M. CurreyPublished in: IEEE Trans. Pattern Anal. Mach. Intell. (1998)
Keyphrases
- improved algorithm
- times faster
- computational complexity
- theoretical analysis
- method finds
- preprocessing
- recognition algorithm
- cost function
- dynamic programming
- experimental evaluation
- tree structure
- particle swarm optimization
- convergence rate
- path planning
- computationally efficient
- expectation maximization
- neural network
- np hard
- significant improvement
- objective function
- learning algorithm
- k means
- search space
- classification trees