A comparison of modified tree-seed algorithm for high-dimensional numerical functions.
Ayse BeskirliDurmus ÖzdemirHasan TemurtasPublished in: Neural Comput. Appl. (2020)
Keyphrases
- cost function
- high dimensional
- dynamic programming
- significant improvement
- experimental evaluation
- learning algorithm
- optimal solution
- noisy data
- preprocessing
- times faster
- tree structure
- high accuracy
- classification trees
- detection algorithm
- neural network
- multi dimensional
- linear programming
- computational cost
- np hard
- computational complexity
- objective function
- binary tree
- particle swarm optimization
- expectation maximization
- segmentation algorithm
- search space
- recognition algorithm
- pruning algorithm
- gradient projection