๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A general lower bound on the number of examples needed for learning

โœ Scribed by Andrzej Ehrenfeucht; David Haussler; Michael Kearns; Leslie Valiant

Book ID
113383889
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
846 KB
Volume
82
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

General Bounds on the Number of Examples
General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts
โœ Hans Ulrich Simon ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 631 KB

Given a p-concept class C, we define two important functions d C (#), d$ C (#) (related to the notion of #-shattering). We prove a lower bound of 0((d C (#)&1)ร‚(=# 2 )) on the number of examples required for learning C with an (=, #)-good model of probability. We prove similar lower bounds for some

A lower bound on the independence number
A lower bound on the independence number of a graph
โœ Jochen Harant ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 210 KB

A new lower bound on the independence number of a graph is established and an accompanying efficient algorithm constructing an independent vertex set the cardinality of which is at least this lower bound is given. (~