A New Algorithm Using the Non-Dominated Tree to Improve Non-Dominated Sorting.
Patrik GustavssonAnna SyberfeldtPublished in: Evol. Comput. (2018)
Keyphrases
- expectation maximization
- computational cost
- detection algorithm
- np hard
- binary tree
- tree structure
- optimal solution
- experimental evaluation
- optimization algorithm
- high accuracy
- dynamic programming
- cost function
- preprocessing
- times faster
- minimum spanning tree
- pruning algorithm
- worst case
- learning algorithm
- probabilistic model
- computational complexity
- similarity measure
- computationally efficient
- theoretical analysis
- segmentation algorithm
- multi objective
- evolutionary algorithm
- search space
- matching algorithm
- path planning
- spanning tree
- classification trees
- search algorithm
- objective function