scientific article; zbMATH DE number 893887

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

• Learning pattern classification-a survey
• Pattern classification.
• scientific article; zbMATH DE number 47593
• scientific article; zbMATH DE number 1249221

zbMATH Keywords

hypercubeneural networkBSP treespotential kernel functions

Mathematics Subject Classification ID

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)

• Distribution-free consistency of kernel non-parametric M-estimators.
• A penalized criterion for variable selection in classification
• Classification rules based on distribution functions of functional depth
• An empirical study of the complexity and randomness of prediction error sequences
• Classification with multiple independent measurements under a separate sampling scheme
• Exact performance of error estimators for discrete classifiers
• Finite sample properties of system identification of ARX models under mixing conditions
• Analysis of the rate of convergence of least squares neural network regression estimates in case of measurement errors
• Pattern recognition in non-Kolmogorovian structures
• A consistency result for functional SVM by spline interpolation
• Probabilistic representation of complexity.
• Classification with guaranteed probability of error
• Density estimation by the penalized combinatorial method
• Hyper-rectangular space partitioning trees: practical approach
• Complete search for feature selection in decision trees
• Nonparametric regression function estimation using interaction least squares splines and complexity regularization.
• On deep learning as a remedy for the curse of dimensionality in nonparametric regression
• A random forest guided tour
• Integrating prior domain knowledge into discriminative learning using automatic model construction and phantom examples
• Wavelet-based estimation of generalized discriminant functions
• On the rate of convergence of error estimates for the partitioning classification rule
• The Tangent Classifier
• A best linear threshold classification with scale mixture of skew normal populations
• On local times, density estimation and supervised classification from functional data
• Complete statistical theory of learning
• Limits to classification and regression estimation from ergodic processes
• Simulation-based classification; a model-order-reduction approach for structural health monitoring
• On estimation of surrogate models for multivariate computer experiments
• Stein's identity, Fisher information, and projection pursuit: A triangulation
• On the value of partial information for learning from examples
• Formal methods in pattern recognition: A review
• Pointwise universal consistency of nonparametric density estimators
• On the rates of convergence of simulation-based optimization algorithms for optimal stopping problems
• Classification when the covariate vectors have unequal dimensions
• Estimation of a jump point in random design regression
• Universal consistency of delta estimators
• Nonasymptotic bounds on the \(L_{2}\) error of neural network regression estimates
• Results in statistical discriminant analysis: A review of the former Soviet Union literature.
• A theoretical analysis of the peaking phenomenon in classification
• Discriminant analysis with independently repeated multivariate measurements: an \(L^2\) approach
• A consistent combined classification rule
• A probabilistic theory of clustering
• Heteroscedastic linear feature extraction based on sufficiency conditions
• Multiclass classification with potential function rules: margin distribution and generalization
• The false discovery rate for statistical pattern recognition
• Classification using proximity catch digraphs
• Estimation of the optimal design of a nonlinear parametric regression problem via Monte Carlo experiments
• Divergence-type errors of smooth Barron-type density estimators.
• Estimation of a posteriori probability in problems of pattern recognition and prediction
• The Hilbert kernel regression estimate.
• Finding blocks and other patterns in a random coloring of ℤ
• Moments and root-mean-square error of the Bayesian MMSE estimator of classification error in the Gaussian model
• On the maximal deviation of kernel regression estimators with NMAR response variables
• Wavelet‐based estimation of a discriminant function
• Quantum learning: asymptotically optimal classification of qubit states
• Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms
• Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy
• 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
• Boosting for high-dimensional linear models
• A new family of proximity graphs: class cover catch digraphs
• Identifiability of nonparametric mixture models and Bayes optimal clustering
• Dimensionality reduction on the Cartesian product of embeddings of multiple dissimilarity matrices
• On statistical properties of sets fulfilling rolling-type conditions
• Bayesian variable selection for high dimensional generalized linear models: convergence rates of the fitted densities
• Nearest neighbor classification in infinite dimension
• Nonparametrically consistent depth-based classifiers
• Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
• Accelerated gradient boosting
• Aggregation for Gaussian regression
• Fast learning rates for plug-in classifiers

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)