A sufficiently fast algorithm for finding close to optimal clique trees.
Ann BeckerDan GeigerPublished in: Artif. Intell. (2001)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- learning algorithm
- expectation maximization
- computational complexity
- cost function
- computational cost
- optimization algorithm
- segmentation algorithm
- detection algorithm
- clustering method
- high accuracy
- experimental evaluation
- tree structure
- objective function
- globally optimal
- closed form
- recognition algorithm
- exhaustive search
- binary tree
- simulated annealing
- particle swarm optimization
- neural network
- k means
- similarity measure
- decision trees
- np hard
- significant improvement
- times faster
- convergence rate
- search space
- optimal strategy
- optimal parameters
- operating point