Some special Vapnik-Chervonenkis classes
From MaRDI portal
Publication:1152158
DOI10.1016/0012-365X(81)90274-0zbMath0459.60008OpenAlexW2046907549WikidataQ56504090 ScholiaQ56504090MaRDI QIDQ1152158
Richard M. Dudley, Roberta S. Wenocur
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(81)90274-0
Geometric probability and stochastic geometry (60D05) Partial orders, general (06A06) Other combinatorial set theory (03E05) Probability theory on algebraic and topological structures (60B99)
Related Items
On range searching with semialgebraic sets, A review of combinatorial problems arising in feedforward neural network design, \(\epsilon\)-nets and simplex range queries, Fusion methods for multiple sensor systems with unknown error densities, On the asymptotic properties of smoothed estimators of the classification error rate, Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers, Some new tests for multivariate normality, Rank regression for current status data, Quantifying inductive bias: AI learning algorithms and Valiant's learning framework, Smoothed maximum score change-point estimation in binary response model, AN EQUIVALENCE RESULT FOR VC CLASSES OF SETS, A decision-theoretic generalization of on-line learning and an application to boosting, On VC-minimal theories and variants, Maximum score change-point estimation in binary response model, PAC learning of concept classes through the boundaries of their items, Sample Compression Schemes for Balls in Graphs, Learning half-spaces on general infinite spaces equipped with a distance function, Neural Networks with Local Receptive Fields and Superlinear VC Dimension, Tukey’s Depth for Object Data, Some new maximum VC classes, On weak \(\epsilon\)-nets and the Radon number, The Vapnik-Chervonenkis dimension of decision trees with bounded rank, Rank-\(r\) decision trees are a subclass of \(r\)-decision lists, Decision theoretic generalizations of the PAC model for neural net and other learning applications, Gaining degrees of freedom in subsymbolic learning, Maximal pattern complexity, dual system and pattern recognition, Kernel estimators of density function of directional data, Unnamed Item, \(k\)-Fold unions of low-dimensional concept classes, Order compression schemes, Theory of Classification: a Survey of Some Recent Advances, Consistent regression using data-dependent coverings, A general lower bound on the number of examples needed for learning, Density and dimension, Generalization of the kolmogorov-smirnov goodness-of-fit test, usinggroup invariance, Conditional independence testing via weighted partial copulas, Combinatorics and connectionism, Invariance principles for sums of Banach space valued random elements and empirical processes, Rate of convergence in the central limit theorem for empirical processes
Cites Work
- Unnamed Item
- Unnamed Item
- Corrections to Central limit theorems for empirical measures
- Log log laws for empirical measures
- Empirical processes: A survey of results for independent and identically distributed random variables
- Balls in \(\mathbb{R}^k\) do not cut all subsets of \(k+2\) points
- Enumeration of Seven-Argument Threshold Functions
- The number of partitions of a set of N points in k dimensions induced by hyperplanes
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
