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.
- Density estimation by the penalized combinatorial method (Q558002) (← links)
- Monte Carlo algorithms for optimal stopping and statistical learning (Q558680) (← links)
- Rigorous learning curve bounds from statistical mechanics (Q676243) (← links)
- Neural networks with quadratic VC dimension (Q676433) (← links)
- Asymptotic behavior of solutions of some classes of stochastic equations and their applications to statistical problems (Q684618) (← links)
- Combining frequency and time domain approaches to systems with multiple spike train input and output (Q732704) (← links)
- Results on learnability and the Vapnik-Chervonenkis dimension (Q751859) (← links)
- Learning and generalization errors for the 2D binary perceptron. (Q815504) (← links)
- An evolutionary approach for achieving scalability with general regression neural networks (Q835981) (← links)
- Optimizing resources in model selection for support vector machine (Q856459) (← links)
- Risk bounds for statistical learning (Q869973) (← links)
- Creating a quality map of a slate deposit using support vector machines (Q879412) (← links)
- Using the doubling dimension to analyze the generalization of learning algorithms (Q923877) (← links)
- Kernel methods in machine learning (Q930651) (← links)
- Locally linear reconstruction for instance-based learning (Q941602) (← links)
- Bayesian approach, theory of empirical risk minimization. Comparative analysis (Q1008355) (← links)
- An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution (Q1014429) (← links)
- Robust centroid based classification with minimum error rates for high dimension, low sample size data (Q1021991) (← links)
- Estimating a density and its derivatives via the minimum distance method (Q1102656) (← links)
- On the asymptotic properties of smoothed estimators of the classification error rate (Q1102667) (← links)
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework (Q1106669) (← links)
- Learning metric-topological maps for indoor mobile robot navigation (Q1128610) (← links)
- On convergence proofs in system identification -- a general principle using ideas from learning theory (Q1128973) (← links)
- Theoretical aspects of ill-posed problems in statistics (Q1181248) (← links)
- 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)