Sketched history: VC combinatorics, 1826 up to 1975

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The earliest published instance found of combinatorial quantities later occurring in the work of Vapnik and Chervonenkis was in a paper of Jakob Steiner in 1826. The next, still more pertinent occurrence foundwas inwork of Ludwig Schläfli done around 1850 but not published until 1901, after his death. The nineteenth century work was on subsets of Euclidean spaces cut by intersections of finitely many half-spaces. Then there is another long gap until a paper of T.M. Cover, who cited Schläfli, in 1965, preceding by a few years the landmark announcement by Vapnik and Chervonenkis in 1968 and longer paper of 1971. Further history is given about Steiner, Schläfli, and some of their contemporary mathematicians and about the initial reception of the Vapnik and Chervonenkis work.

Cite

CITATION STYLE

APA

Dudley, R. M. (2015). Sketched history: VC combinatorics, 1826 up to 1975. In Measures of Complexity: Festschrift for Alexey Chervonenkis (pp. 31–42). Springer International Publishing. https://doi.org/10.1007/978-3-319-21852-6_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free