Greedy approximated hypervolume subset selection for many-objective optimization.
Ke ShangHisao IshibuchiWeiyu ChenPublished in: GECCO (2021)
Keyphrases
- subset selection
- hill climbing
- feature selection
- nsga ii
- forward selection
- multi objective
- greedy algorithm
- multiple objectives
- search space
- simulated annealing
- search algorithm
- test problems
- multi objective optimization
- multi objective evolutionary algorithms
- linear combination
- pareto optimal
- optimization problems
- evolutionary algorithm
- genetic algorithm ga
- dynamic programming
- uniform design
- candidate solutions
- greedy search
- greedy heuristic
- multiobjective optimization
- search strategy
- greedy algorithms
- search procedure
- tabu search
- locally optimal
- optimal solution
- genetic algorithm
- knapsack problem
- databases
- computationally expensive
- optimization algorithm
- upper bound
- objective function