Pages that link to "Item:Q1171840"
From MaRDI portal
The following pages link to Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz (Q1171840):
Displayed 50 items.
- Equivalence of models for polynomial learnability (Q1183606) (← links)
- Decision theoretic generalizations of the PAC model for neural net and other learning applications (Q1198550) (← links)
- Scale-sensitive dimensions and skeleton estimates for classification (Q1265744) (← links)
- The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension (Q1265746) (← links)
- An introduction to some statistical aspects of PAC learning theory (Q1274408) (← links)
- A learning result for continuous-time recurrent neural networks (Q1274412) (← links)
- Sample size lower bounds in PAC learning by Algorithmic Complexity Theory (Q1274920) (← links)
- On the learnability of rich function classes (Q1305934) (← links)
- Combinatorics and connectionism (Q1313821) (← links)
- A result of Vapnik with applications (Q1314333) (← links)
- Efficient distribution-free learning of probabilistic concepts (Q1329154) (← links)
- Three fundamental concepts of the capacity of learning machines (Q1330342) (← links)
- A review of combinatorial problems arising in feedforward neural network design (Q1331904) (← links)
- An investigation on the conditions of pruning an induced decision tree (Q1333477) (← links)
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
- Identificaction of nonlinear block-oriented systems by the recursive kernel estimate (Q1338578) (← links)
- Toward efficient agnostic learning (Q1342730) (← links)
- A theory for memory-based learning (Q1342731) (← links)
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension (Q1345876) (← links)
- Search for the best decision rules with the help of a probabilistic estimate (Q1354081) (← links)
- A decision-theoretic generalization of on-line learning and an application to boosting (Q1370863) (← links)
- Approximation and learning of convex superpositions (Q1370865) (← links)
- On the value of partial information for learning from examples (Q1383444) (← links)
- PAC learning of concept classes through the boundaries of their items (Q1392018) (← links)
- Nonlinear orthogonal series estimates for random design regression (Q1399276) (← links)
- Constructing fixed rank optimal estimators with method of best recurrent approximations (Q1403419) (← links)
- A note on different covering numbers in learning theory. (Q1426052) (← links)
- Results in statistical discriminant analysis: A review of the former Soviet Union literature. (Q1427521) (← links)
- On learning multicategory classification with sample queries. (Q1427857) (← links)
- Formal methods in pattern recognition: A review (Q1579483) (← links)
- Inequalities for uniform deviations of averages from expectations with applications to nonparametric regression (Q1582357) (← links)
- A geometric approach to leveraging weak learners (Q1603593) (← links)
- The complexity of theory revision (Q1606294) (← links)
- A unified treatment of direct and indirect estimation of a probability density and its derivatives (Q1612997) (← links)
- Solving the slate tile classification problem using a DAGSVM multiclassification algorithm based on SVM binary classifiers with a one-versus-all approach (Q1644084) (← links)
- Bounds on the minimax rate for estimating a prior over a VC class from independent learning tasks (Q1704568) (← links)
- Weight-based label-unknown multi-view data set generation approach (Q1739209) (← links)
- Two smooth support vector machines for \(\varepsilon \)-insensitive regression (Q1753072) (← links)
- Optimal recursive estimation of raw data (Q1772982) (← links)
- New support vector algorithms with parametric insensitive/margin model (Q1784537) (← links)
- Equivalences between learning of data and probability distributions, and their applications (Q1784951) (← links)
- Arcing classifiers. (With discussion) (Q1807115) (← links)
- A general lower bound on the number of examples needed for learning (Q1823011) (← links)
- The Vapnik-Chervonenkis dimension of a random graph (Q1842142) (← links)
- Improved lower bounds for learning from noisy examples: An information-theoretic approach (Q1854425) (← links)
- Optimal aggregation of classifiers in statistical learning. (Q1884608) (← links)
- On data classification by iterative linear partitioning (Q1885803) (← links)
- Some connections between learning and optimization (Q1885804) (← links)
- A counterexample concerning uniform ergodic theorems for a class of functions (Q1897079) (← links)
- Fusion methods for multiple sensor systems with unknown error densities (Q1898158) (← links)