The following pages link to (Q4004178):
Displaying 50 items.
- Robust cutpoints in the logical analysis of numerical data (Q412323) (← links)
- Multiclass classification with potential function rules: margin distribution and generalization (Q645885) (← links)
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks (Q676431) (← links)
- Neural networks with quadratic VC dimension (Q676433) (← links)
- Aggregate operators in constraint query languages (Q696963) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Analysis of a multi-category classifier (Q714014) (← links)
- Learning in the limit with lattice-structured hypothesis spaces (Q714848) (← links)
- Maximizing agreements and coagnostic learning (Q817828) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- A Boolean measure of similarity (Q860381) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- On the generalization error of fixed combinations of classifiers (Q881592) (← links)
- On the sample size of random convex programs with structured dependence on the uncertainty (Q900216) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Consistent and coherent learning with \(\delta \)-delay (Q958312) (← links)
- Sharpening Occam's razor (Q1007542) (← links)
- Using a similarity measure for credible classification (Q1028441) (← links)
- Maximal width learning of binary functions (Q1041230) (← links)
- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting (Q1271468) (← links)
- An introduction to some statistical aspects of PAC learning theory (Q1274408) (← links)
- Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete (Q1305933) (← links)
- Combinatorics and connectionism (Q1313821) (← links)
- On sparse approximations to randomized strategies and convex combinations (Q1322876) (← links)
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
- Learning and complexity in genetic auto-adaptive systems (Q1342722) (← links)
- A sufficient condition for polynomial distribution-dependent learnability (Q1364775) (← links)
- On the complexity of learning from drifting distributions (Q1376422) (← links)
- Error-free and best-fit extensions of partially defined Boolean functions (Q1383161) (← links)
- Variations on extending partially defined Boolean functions with missing bits. (Q1400581) (← links)
- Interior and exterior functions of positive Boolean functions. (Q1408452) (← links)
- Convexity and logical analysis of data (Q1575707) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Exploring learnability between exact and PAC (Q1780447) (← links)
- The PAC-learnability of planning algorithms: Investigating simple planning domains (Q1818761) (← links)
- The Vapnik-Chervonenkis dimension of a random graph (Q1842142) (← links)
- Exact VC-dimension of Boolean monomials (Q1847362) (← links)
- On weak base hypotheses and their implications for boosting regression and classification (Q1848929) (← links)
- Logical analysis of data with decomposable structures. (Q1853578) (← links)
- On the complexity of learning for spiking neurons with temporal coding. (Q1854302) (← links)
- Learning fixed-dimension linear thresholds from fragmented data (Q1854473) (← links)
- Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
- A decomposability index in logical analysis of data (Q1878410) (← links)
- Robust learning -- rich and poor (Q1880777) (← links)
- Process consistency for AdaBoost. (Q1884601) (← links)
- On data classification by iterative linear partitioning (Q1885803) (← links)
- Some connections between learning and optimization (Q1885804) (← links)
- Classification by polynomial surfaces (Q1897355) (← links)
- On specifying Boolean functions by labelled examples (Q1897365) (← links)
