scientific article; zbMATH DE number 893887
From MaRDI portal
Publication:4881152
zbMATH Open0853.68150MaRDI QIDQ4881152FDOQ4881152
Authors: László Györfi, Luc Devroye, Gábor Lugosi 
Publication date: 27 June 1996
Title of this publication is not available (Why is that?)
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Pattern recognition, speech recognition (68T10)
Cited In (only showing first 100 items - show all)
- Lectures on the nearest neighbor method
- Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns
- Fast \(DD\)-classification of functional data
- Estimation of the essential supremum of a regression function
- Relation between weight size and degree of over-fitting in neural network regression
- Construction and evaluation of classifiers for forensic document analysis
- Classification with Gaussians and convex loss. II: Improving error bounds by noise conditions
- A Hoeffding inequality for Markov chains using a generalized inverse
- On extensions of Hoeffding's inequality for panel data
- Pattern recognition with ordered labels
- Linear classifiers are nearly optimal when hidden variables have diverse effects
- Robustness and generalization
- On cross-validation in kernel and partitioning regression estimation.
- Submodular functions: learnability, structure, and optimization
- On Dobrushin's inequality
- Local likelihood regression in generalized linear single-index models with applications to microarray data
- Kernel classification with missing data and the choice of smoothing parameters
- On classification with nonignorable missing data
- Nonparametric density estimation for symmetric distributions by contaminated data
- Risk bounds for CART classifiers under a margin condition
- Posterior concentration for Bayesian regression trees and forests
- Large deviations of divergence measures on partitions
- Learning a priori constrained weighted majority votes
- Random Projection RBF Nets for Multidimensional Density Estimation
- Optimal \(L_{1}\) bandwidth selection for variable kernel density estimates
- Pattern recognition based on canonical correlations in a high dimension low sample size context
- Mining evolving data streams for frequent patterns
- Indexability, concentration, and VC theory
- An affine invariant \(k\)-nearest neighbor regression estimate
- Functional data clustering via piecewise constant nonparametric density estimation
- Some results on classifier selection with missing covariates
- Hoeffding's inequality for uniformly ergodic Markov chains
- Boosted Bayesian network classifiers
- PAC-Bayesian bounds for randomized empirical risk minimizers
- Stochastic optimal growth model with risk sensitive preferences
- Segmenting magnetic resonance images via hierarchical mixture modelling
- Complexity regularization via localized random penalties
- Universal smoothing factor selection in density estimation: theory and practice. (With discussion)
- Morphological perceptrons with competitive learning: lattice-theoretical framework and constructive learning algorithm
- A universal strong law of large numbers for conditional expectations via nearest neighbors
- Obtaining fast error rates in nonconvex situations
- Maximum likelihood estimation of smooth monotone and unimodal densities.
- Diffusion learning algorithms for feedforward neural networks
- A strong uniform convergence rate of kernel conditional quantile estimator under random censorship
- Strong convergence in nonparametric regression with truncated dependent data
- Universally consistent regression function estimation using hierarchical \(B\)-splines
- Active learning in heteroscedastic noise
- Rates of convergence in active learning
- Prediction from randomly right censored data
- Process consistency for AdaBoost.
- Classification algorithms using adaptive partitioning
- Optimal exponential bounds on the accuracy of classification
- Nonparametric estimation of a maximum of quantiles
- Empirical measures for incomplete data with applications
- Optimal dyadic decision trees
- Asymptotic analysis of estimators on multi-label data
- Recursive aggregation of estimators by the mirror descent algorithm with averaging
- Measures of divergence on credal sets
- On the consistency properties of linear and quadratic discriminant analyses
- Cox process functional learning
- Asymptotics for regression models under loss of identifiability
- Lower bounds on the rate of convergence of nonparametric regression estimates
- Probabilistic models for pattern statistics
- Optimal rates of aggregation in classification under low noise assumption
- Complexities of convex combinations and bounding the generalization error in classification
- On nonparametric classification with missing covariates
- Kernel regression estimation for incomplete data with applications
- Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality?
- Relaxing support vectors for classification
- On the use of random forest for two-sample testing
- On depth measures and dual statistics. A methodology for dealing with general data
- A note on margin-based loss functions in classification
- Does modeling lead to more accurate classification? A study of relative efficiency in linear classification
- Supervised classification and mathematical optimization
- Universally consistent vertex classification for latent positions graphs
- On the empirical estimation of integral probability metrics
- On combinatorial testing problems
- Shannon sampling and function reconstruction from point values
- On the asymptotics of random forests
- Smooth discrimination analysis
- Nonparametric discrimination of areal functional data
- A new test for randomness and its application to some cryptographic problems
- Fast learning rates in statistical inference through aggregation
- Consistency of random forests
- Choice of neighbor order in nearest-neighbor classification
- Title not available (Why is that?)
- A topologically valid definition of depth for functional data
- Robust nearest-neighbor methods for classifying high-dimensional data
- Mixing strategies for density estimation.
- Performance of empirical risk minimization in linear aggregation
- Optimal classification and nonparametric regression for functional data
- A dynamic model of classifier competence based on the local fuzzy confusion matrix and the random reference classifier
- One-pass AUC optimization
- Metrics for labelled Markov processes
- Bootstrap model selection for possibly dependent and heterogeneous data
- An asymptotically optimal kernel combined classifier
- Gibbs posterior for variable selection in high-dimensional classification and data mining
- Safe autonomy under perception uncertainty using chance-constrained temporal logic
- A tree-based regressor that adapts to intrinsic dimension
- Local nearest neighbour classification with applications to semi-supervised learning
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 Q4881152)
