Learning the set covering machine by bound minimization and margin-sparsity trade-off
type: Item
instance of: scholarly article
title: Learning the set covering machine by bound minimization and margin-sparsity trade-off
zbMATH Open document ID: 1470.68133
author: François Laviolette
author: Mario Marchand
author: Mohak Shah
author: Sara Shanian
published in: Machine Learning
publication date: 2010-10-07T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 62H30
zbMATH DE Number: 5796845
zbMATH Keywords: set-covering machine
zbMATH Keywords: sample compression
zbMATH Keywords: risk bounds
zbMATH Keywords: margin-sparsity trade-off
zbMATH Keywords: bound minimization
MaRDI profile type: Publication
full work available at URL: s10994-009-5137-3
OpenAlex ID: W2013029345
cites work: Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes
cites work: Learning Theory and Kernel Machines
cites work: Occam's razor
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Q4198056
cites work: PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
cites work: Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
cites work: Q3174151
cites work: Q3093250
cites work: Q3174125
cites work: 10.1162/jmlr.2003.3.4-5.723
cites work: Q3093258
cites work: PAC-Bayesian stochastic model selection
cites work: Rademacher averages and phase transitions in Glivenko-Cantelli classes
cites work: Q3093187
cites work: A theory of the learnable
cites work: Q4261789
DOI: 10.1007/S10994-009-5137-3
description: scientific article; zbMATH DE number 5796845