A new PAC bound for intersection-closed concept classes (Q2384136): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Learning nested differences in the presence of malicious noise / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line learning with malicious noise and the closure algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximating hyper-rectangles: Learning and pseudorandom sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A general lower bound on the number of examples needed for learning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Predicting \(\{ 0,1\}\)-functions on randomly drawn points / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4013525 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the density of families of sets / rank | |||
Normal rank |
Latest revision as of 09:57, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new PAC bound for intersection-closed concept classes |
scientific article |
Statements
A new PAC bound for intersection-closed concept classes (English)
0 references
20 September 2007
0 references
PAC bounds
0 references
intersection-closed classes
0 references