Greedy Decremental Quick Hypervolume Subset Selection Algorithms.
Andrzej JaszkiewiczPiotr ZielniewiczPublished in: PPSN (2) (2022)
Keyphrases
- subset selection
- hill climbing
- computational complexity
- significant improvement
- theoretical analysis
- greedy search
- learning algorithm
- data mining
- computational cost
- orders of magnitude
- computational efficiency
- computationally expensive
- recently developed
- real time
- data structure
- stochastic search
- test problems
- black box
- search strategy
- greedy algorithm
- benchmark datasets
- database
- computationally efficient
- genetic programming
- feature selection
- search space
- decision trees
- search algorithm