Learnability and the Vapnik-Chervonenkis dimension (Q3474905): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56214749, #quickstatements; #temporary_batch_1705502051474
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 21:26, 4 February 2024

scientific article
Language Label Description Also known as
English
Learnability and the Vapnik-Chervonenkis dimension
scientific article

    Statements

    Learnability and the Vapnik-Chervonenkis dimension (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    Vapnik-Chervonenkis dimension
    0 references
    geometrical problems and computations
    0 references
    probabilistic algorithms
    0 references
    concept learning
    0 references
    induction
    0 references
    learnability theory
    0 references
    learning from examples
    0 references
    Occam's razor
    0 references
    PAC learning
    0 references
    sample complexity
    0 references
    Vapnik-Chervonenkis classes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references