Learning the set covering machine by bound minimization and margin-sparsity trade-off (Q1959549): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory and Kernel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Occam's razor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifying inductive bias: AI learning algorithms and Valiant's learning framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/jmlr.2003.3.4-5.723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PAC-Bayesian stochastic model selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rademacher averages and phase transitions in Glivenko-Cantelli classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261789 / rank
 
Normal rank

Latest revision as of 07:48, 3 July 2024

scientific article
Language Label Description Also known as
English
Learning the set covering machine by bound minimization and margin-sparsity trade-off
scientific article

    Statements

    Learning the set covering machine by bound minimization and margin-sparsity trade-off (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 October 2010
    0 references
    0 references
    set-covering machine
    0 references
    sample compression
    0 references
    risk bounds
    0 references
    margin-sparsity trade-off
    0 references
    bound minimization
    0 references
    0 references