A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning.
András HajduGyörgy TerdikAttila TibaHenrietta TománPublished in: Mach. Learn. (2022)
Keyphrases
- resource constraints
- knapsack problem
- ensemble pruning
- optimal solution
- optimization problems
- routing problem
- pruning method
- dynamic programming
- temporal constraints
- vehicle routing problem
- pruning algorithms
- np hard
- text categorization
- pruning algorithm
- greedy algorithm
- multi class
- qualitative and quantitative
- multi label learning
- machine learning