A shifting algorithm for continuous tree partitioning.
Ronald I. BeckerBruno SimeoneYen-I ChiangPublished in: Theor. Comput. Sci. (2002)
Keyphrases
- cost function
- k means
- experimental evaluation
- learning algorithm
- binary tree
- matching algorithm
- tree structure
- detection algorithm
- optimization algorithm
- high accuracy
- convergence rate
- times faster
- significant improvement
- dynamic programming
- worst case
- minimum spanning tree
- computational complexity
- simulated annealing
- neural network
- input data
- expectation maximization
- theoretical analysis
- linear programming
- search space
- search algorithm
- optimal solution
- computational cost
- bayesian networks
- space partitioning