The DOI matches its Crossref record.
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
Abstract
Article Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension Share on Authors: A Blumer University of California at Santa Cruz and Department of Mathematics and Computer Science, University of Denver, Denver, Colorado University of California at Santa Cruz and Department of Mathematics and Computer Science, University of Denver, Denver, ColoradoView Profile , A Ehrenfeucht Department of Computer Science, University of Colorado, Boulder, Colorado Department of Computer Science, University of Colorado, Boulder, ColoradoView Profile , D Haussler Department of Mathematics and Computer Science, University of Denver, Denver, Colorado Department of Mathematics and Computer Science, University of Denver, Denver, ColoradoView Profile , M Warmuth Department of Computer and Information Sciences, University of California, Santa Cruz, California Department of Computer and Information Sciences, University of California, Santa Cruz, CaliforniaView Profile Authors Info & Claims STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingNovember 1986 Pages 273–282https://doi.org/10.1145/12130.12158Online:01 November 1986Publication History 83citation790DownloadsMetricsTotal Citations83Total Downloads790Last 12 Months58Last 6 weeks16 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Learning regular sets from queries and counterexamples
Angluin, D. (1987) · Information and Computation · doi:10.1016/0890-5401(87)90052-6 · Cited by 2,114
Almost optimal set covers in finite VC-dimension
Brönnimann, H., & Goodrich, M. T. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02570718 · Cited by 441
Metadata
- Authors
- Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M.
- Venue
- Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86
- Publisher
- ACM Press
- Published
- 1986
- Pages
- 273-282
- OpenAlex
- W2066789935
- Cited by
- 159
- References
- 0
- FWCI
- 18.58
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension. https://app.cochat.ai/papers/10.1145/12130.12158
- The paper
- Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1986). Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension. Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86. https://doi.org/10.1145/12130.12158
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
