Learnability and the Vapnik-Chervonenkis dimension
Citations
12 citations
Cites background from "Learnability and the Vapnik-Chervon..."
...[10] showed that the sample complexity of C is bounded by...
[...]
12 citations
12 citations
Cites background from "Learnability and the Vapnik-Chervon..."
...The lemma has found many applications in such diverse fields as computational learning theory and empirical process theory [5, 31, 3, 12, 2, 7, 30], coding theory [11], computational geometry [15, 22, 6, 16], road network routing [1], and automatic verification [6]; in the former it is the avenue through which the VC dimension enters into generalisation error bounds and the theoretical foundations of learnability....
[...]
12 citations
12 citations
Cites background or methods from "Learnability and the Vapnik-Chervon..."
...We remark that there is a polynomial time consistent-hypothesis-finder for BPn: rephrase the problem as a linear programme and use Karmarkar's algorithm (see [3])....
[...]
...Thus, the perceptron algorithm (for any learning constant v) can be used as a consistent-hypothesis-finder (using terminology from [3])....
[...]
...As indicated in [3], given t € BPn and a sample x = (*i,x2,....
[...]
References
42,654 citations
40,020 citations
17,939 citations
14,948 citations
13,647 citations