\(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration (Q1978498)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1454279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration |
scientific article; zbMATH DE number 1454279 |
Statements
\(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration (English)
0 references
4 June 2000
0 references
computational complexity
0 references
Boolean function
0 references
concept learning
0 references
learning by examples
0 references
sufficient statistics
0 references
nonparametric statistics
0 references
0 references
0 references
0.813964307308197
0 references
0.8038089871406555
0 references
