An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract)
Laurent HyafilF. PruskerJean VuilleminPublished in: STOC (1974)
Keyphrases
- extended abstract
- dynamic programming
- worst case
- optimal solution
- detection algorithm
- optimization algorithm
- improved algorithm
- experimental evaluation
- k means
- computationally efficient
- cost function
- times faster
- learning algorithm
- clustering method
- neural network
- closed form
- exhaustive search
- globally optimal
- expectation maximization
- particle swarm optimization
- significant improvement
- search space
- preprocessing
- computational complexity
- np hard
- tree structure
- feature subset
- recognition algorithm
- objective function
- estimation error
- similarity measure
- data sets
- optimal parameters