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

DOI10.1007/S10994-021-06109-0OpenAlexW3211817722MaRDI QIDQ2163207FDOQ2163207

Authors: András Hajdu, Attila Tiba, Henrietta Tomán, Gy. 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 votingknapsack problemsstochastic selectionensemble creation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

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

Cited In (1)

• A stochastic approach to handle knapsack problems in the creation of ensembles

Uses Software

• UCI-ml
• Knapsack
• RACT

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163207)