The following pages link to Occam's razor (Q1108056):
Displaying 50 items.
- On learning width two branching programs (Q293246) (← links)
- Feature selection for support vector machines using generalized Benders decomposition (Q319318) (← links)
- Path loss prediction in urban environment using learning machines and dimensionality reduction techniques (Q645503) (← links)
- Four types of noise in data for PAC learning (Q673611) (← links)
- Compact MILP models for optimal and Pareto-optimal LAD patterns (Q714016) (← links)
- The complexity of Euler's integer partition theorem (Q714811) (← links)
- Keeping pace with criminals: an extended study of designing patrol allocation against adaptive opportunistic criminals (Q725011) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- On cognitive preferences and the plausibility of rule-based models (Q782445) (← links)
- Learnability with respect to fixed distributions (Q809614) (← links)
- Consistency-based search in feature selection (Q814528) (← links)
- Maximizing agreements and coagnostic learning (Q817828) (← links)
- The DNF exception problem (Q818117) (← links)
- Partial observability and learnability (Q991012) (← links)
- Sharpening Occam's razor (Q1007542) (← links)
- MILP approach to pattern generation in logical analysis of data (Q1028471) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework (Q1106669) (← links)
- Selection of relevant features and examples in machine learning (Q1127357) (← links)
- Partial Occam's Razor and its applications (Q1127393) (← links)
- The Vapnik-Chervonenkis dimension of decision trees with bounded rank (Q1182084) (← links)
- Equivalence of models for polynomial learnability (Q1183606) (← links)
- Learning in parallel (Q1187024) (← links)
- On the necessity of Occam algorithms (Q1193631) (← links)
- Double Horn functions (Q1271644) (← links)
- PAC-learning a decision tree with pruning (Q1278327) (← links)
- Efficient distribution-free learning of probabilistic concepts (Q1329154) (← links)
- Nonuniform learnability (Q1329161) (← links)
- Learning Boolean concepts in the presence of many irrelevant features (Q1337683) (← links)
- The MIN PFS problem and piecewise linear model estimation (Q1348259) (← links)
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
- Automatically selecting and using primary effects in planning: Theory and experiments. (Q1399131) (← links)
- Logical analysis of binary data with missing bits (Q1606295) (← links)
- Exploring learnability between exact and PAC (Q1780447) (← links)
- The PAC-learnability of planning algorithms: Investigating simple planning domains (Q1818761) (← links)
- Learning decision trees from random examples (Q1823009) (← links)
- A general lower bound on the number of examples needed for learning (Q1823011) (← links)
- Apple tasting. (Q1854360) (← links)
- Generalization bounds for averaged classifiers (Q1879971) (← links)
- Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis (Q1885808) (← links)
- Pareto-optimal patterns in logical analysis of data (Q1885813) (← links)
- Learning functions of \(k\) relevant variables (Q1886314) (← links)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973) (← links)
- Learning fallible deterministic finite automata (Q1900974) (← links)
- Ockham's razor in interval identification (Q1904305) (← links)
- Learning the set covering machine by bound minimization and margin-sparsity trade-off (Q1959549) (← links)
- Top program construction and reduction for polynomial time meta-interpretive learning (Q2051277) (← links)
- The quest of parsimonious XAI: a human-agent architecture for explanation formulation (Q2060710) (← links)
- PAC-learning gains of Turing machines over circuits and neural networks (Q2111729) (← links)
- Surrogate modeling for fluid flows based on physics-constrained deep learning without simulation data (Q2176917) (← links)
