An Approximation Algorithm for Binary Searching in Trees.
Eduardo Sany LaberMarco MolinaroPublished in: Algorithmica (2011)
Keyphrases
- learning algorithm
- tree structure
- recognition algorithm
- improved algorithm
- experimental evaluation
- theoretical analysis
- optimization algorithm
- dynamic programming
- cost function
- probabilistic model
- k means
- high accuracy
- binary tree
- convergence rate
- detection algorithm
- non binary
- computational complexity
- clustering method
- worst case
- search space
- monte carlo
- times faster
- error bounds
- itemsets
- linear programming
- computational cost
- binary trees