A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning

DOI10.1007/s10994-021-06109-0OpenAlexW3211817722MaRDI QIDQ2163207

András Hajdu, Attila Tiba, Henrietta Tomán, Gyorgy H. Terdik

Publication date: 10 August 2022

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.08101

zbMATH Keywords

majority votingstochastic selectionknapsack problemsensemble creation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• UCI-ml
• Knapsack
• RACT

Cites Work

• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
• On the distribution of the product of independent beta random variables
• On a discrete nonlinear and nonseparable knapsack problem
• A minimal algorithm for the multiple-choice knapsack problem
• Large margin classification using the perceptron algorithm
• Optimizing majority voting based systems under a resource constraint for multiclass problems
• Expected complexity analysis of stochastic direct-search
• Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction
• The Design of Approximation Algorithms
• Search and Optimization by Metaheuristics
• Combining Pattern Classifiers
• Generalizing the Majority Voting Scheme to Spatially Constrained Voting
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning