scientific article; zbMATH DE number 53984
From MaRDI portal
Publication:4004178
Recommendations
Cited in
(96)- Sharpening Occam's razor
- Using a similarity measure for credible classification
- Maximal width learning of binary functions
- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
- An introduction to some statistical aspects of PAC learning theory
- Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete
- Combinatorics and connectionism
- On sparse approximations to randomized strategies and convex combinations
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
- Learning and complexity in genetic auto-adaptive systems
- A sufficient condition for polynomial distribution-dependent learnability
- On the complexity of learning from drifting distributions
- Error-free and best-fit extensions of partially defined Boolean functions
- Variations on extending partially defined Boolean functions with missing bits.
- Interior and exterior functions of positive Boolean functions.
- Convexity and logical analysis of data
- Remarks on computational learning theory
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- Exploring learnability between exact and PAC
- The PAC-learnability of planning algorithms: Investigating simple planning domains
- 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
- 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
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- A decomposability index in logical analysis of data
- Robust learning -- rich and poor
- Process consistency for AdaBoost.
- On data classification by iterative linear partitioning
- Some connections between learning and optimization
- Classification by polynomial surfaces
- On specifying Boolean functions by labelled examples
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
- Independence number and the complexity of families of sets
- Accuracy of techniques for the logical analysis of data
- Inner-core and outer-core functions of partially defined Boolean functions
- Canonical forest
- Quadratic boosting
- Classification based on prototypes with spheres of influence
- A hybrid classifier based on boxes and nearest neighbors
- On two-stage convex chance constrained problems
- Aspects of discrete mathematics and probability in the theory of machine learning
- Ambiguous chance constrained problems and robust optimization
- On the fusion of threshold classifiers for categorization and dimensionality reduction
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Institute of control sciences through the lens of VC dimension
- scientific article; zbMATH DE number 434672 (Why is no real title available?)
- Theory of Classification: a Survey of Some Recent Advances
- Learning Theory
- scientific article; zbMATH DE number 4155930 (Why is no real title available?)
- scientific article; zbMATH DE number 8767 (Why is no real title available?)
- scientific article; zbMATH DE number 50692 (Why is no real title available?)
- Robust cutpoints in the logical analysis of numerical data
- scientific article; zbMATH DE number 1304255 (Why is no real title available?)
- Learning deterministic regular grammars from stochastic samples in polynomial time
- Using the Perceptron Algorithm to Find Consistent Hypotheses
- scientific article; zbMATH DE number 1016747 (Why is no real title available?)
- scientific article; zbMATH DE number 1169068 (Why is no real title available?)
- Generating dual-bounded hypergraphs
- COMPLEXITY: METRICS AND MODULES
- scientific article; zbMATH DE number 194808 (Why is no real title available?)
- scientific article; zbMATH DE number 1373681 (Why is no real title available?)
- Valid Generalisation from Approximate Interpolation
- Perceptrons with polynomial post-processing
- Ten More Years of Error Rate Research
- scientific article; zbMATH DE number 926775 (Why is no real title available?)
- Neural Network Learning
- Neural networks and some applications to finance
- Random projections for linear programming
- Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
- A lower bound for families of Natarajan dimension d
- Monotone term decision lists
- Probabilistic solutions to some NP-hard matrix problems
- Decision lists and related Boolean functions
- On the non-efficient PAC learnability of conjunctive queries
- Compactness Hypothesis, Potential Functions, and Rectifying Linear Space in Machine Learning
- Multiclass classification with potential function rules: margin distribution and generalization
- A fast and simple algorithm for identifying 2-monotonic positive Boolean functions
- Statistical computational learning
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
- Neural networks with quadratic VC dimension
- Aggregate operators in constraint query languages
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- Analysis of a multi-category classifier
- Learning in the limit with lattice-structured hypothesis spaces
- Maximizing agreements and coagnostic learning
- A global parallel algorithm for the hypergraph transversal problem
- A Boolean measure of similarity
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- On the generalization error of fixed combinations of classifiers
- On the sample size of random convex programs with structured dependence on the uncertainty
- Learning recursive functions: A survey
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Consistent and coherent learning with \(\delta \)-delay
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4004178)
