Rademacher complexity in Neyman-Pearson classification (Q1034311): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-008-6210-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978448727 / rank
 
Normal rank

Revision as of 19:17, 19 March 2024

scientific article
Language Label Description Also known as
English
Rademacher complexity in Neyman-Pearson classification
scientific article

    Statements

    Rademacher complexity in Neyman-Pearson classification (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Neyman-Pearson Lemma
    0 references
    VC classes
    0 references
    Rademacher complexity
    0 references
    Neyman-Pearson classification
    0 references
    0 references