scientific article

Publication date: 18 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

decision lists probably approximately correct learning efficiency of learning Vapnik-Chervonenkins dimension

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Dual-bounded generating problems: Weighted transversals of a hypergraph, A decomposability index in logical analysis of data, Learning deterministic regular grammars from stochastic samples in polynomial time, Robust learning -- rich and poor, Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements, Process consistency for AdaBoost., On data classification by iterative linear partitioning, Some connections between learning and optimization, Learning and complexity in genetic auto-adaptive systems, A global parallel algorithm for the hypergraph transversal problem, Classification by polynomial surfaces, On specifying Boolean functions by labelled examples, Quadratic boosting, Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers, A Boolean measure of similarity, An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation, A sufficient condition for polynomial distribution-dependent learnability, Using the Perceptron Algorithm to Find Consistent Hypotheses, Ten More Years of Error Rate Research, On the complexity of learning from drifting distributions, Independence number and the complexity of families of sets, Classification based on prototypes with spheres of influence, Error-free and best-fit extensions of partially defined Boolean functions, On the generalization error of fixed combinations of classifiers, On the non-efficient PAC learnability of conjunctive queries, Robust cutpoints in the logical analysis of numerical data, Variations on extending partially defined Boolean functions with missing bits., On the sample size of random convex programs with structured dependence on the uncertainty, Interior and exterior functions of positive Boolean functions., Multiclass classification with potential function rules: margin distribution and generalization, Accuracy of techniques for the logical analysis of data, Inner-core and outer-core functions of partially defined Boolean functions, Learning recursive functions: A survey, A hybrid classifier based on boxes and nearest neighbors, A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs, On the complexity of monotone dualization and generating minimal hypergraph transversals, On two-stage convex chance constrained problems, Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks, Neural networks with quadratic VC dimension, Consistent and coherent learning with \(\delta \)-delay, Aspects of discrete mathematics and probability in the theory of machine learning, Aggregate operators in constraint query languages, Canonical forest, A lower bound for families of Natarajan dimension \(d\), Monotone term decision lists, COMPLEXITY: METRICS AND MODULES, Ambiguous chance constrained problems and robust optimization, Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry, Generating dual-bounded hypergraphs, Analysis of a multi-category classifier, Probabilistic solutions to some NP-hard matrix problems, Learning in the limit with lattice-structured hypothesis spaces, Exploring learnability between exact and PAC, Decision lists and related Boolean functions, On the fusion of threshold classifiers for categorization and dimensionality reduction, Theory of Classification: a Survey of Some Recent Advances, Sharpening Occam's razor, Random Projections for Linear Programming, Valid Generalisation from Approximate Interpolation, General bounds on statistical query learning and PAC learning with noise via hypothesis boosting, The PAC-learnability of planning algorithms: Investigating simple planning domains, An introduction to some statistical aspects of PAC learning theory, Using a similarity measure for credible classification, Convexity and logical analysis of data, Neural networks and some applications to finance, Maximal width learning of binary functions, The Vapnik-Chervonenkis dimension of a random graph, Exact VC-dimension of Boolean monomials, On weak base hypotheses and their implications for boosting regression and classification, Parameterized computation and complexity: a new approach dealing with NP-hardness, Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete, Logical analysis of data with decomposable structures., On the complexity of learning for spiking neurons with temporal coding., Learning fixed-dimension linear thresholds from fragmented data, Combinatorics and connectionism, On sparse approximations to randomized strategies and convex combinations, Perceptrons with polynomial post-processing, Maximizing agreements and coagnostic learning