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)
- 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
- On Poincaré cone property
- Regression in random design and warped wavelets
- Arbitrarily slow convergence of sequences of linear operators: a survey
- Local Rademacher complexities
- A stochastic version of general recognition theory
- An almost surely optimal combined classification rule
- Probabilistic clustering via Pareto solutions and significance tests
- Fast rates for support vector machines using Gaussian kernels
- Ranking and empirical minimization of \(U\)-statistics
- On best approximation by ridge functions
- Average case recovery analysis of tomographic compressive sensing
- Optimal aggregation of classifiers in statistical learning.
- Prototype selection for dissimilarity-based classifiers
- COBRA: a combined regression strategy
- New insights into approximate Bayesian computation
- Asymptotic normality for regression function estimate under truncation and \(\alpha \)-mixing conditions
- Bayesian instance selection for the nearest neighbor rule
- Bolstered error estimation
- A partial overview of the theory of statistics with functional data
- Empirical risk minimization is optimal for the convex aggregation problem
- Multi-output learning via spectral filtering
- A weighted \(k\)-nearest neighbor density estimate for geometric inference
- Noisy independent factor analysis model for density estimation and classification
- Adaptive kernel methods using the balancing principle
- Structured large margin machines: sensitive to data distributions
- Generalized canonical correlation analysis for classification
- Minimax fast rates for discriminant analysis with errors in variables
- Approximation by neural networks and learning theory
- Simultaneous adaptation to the margin and to complexity in classification
- Vertex nomination via seeded graph matching
- Imputation Scores
- A nearest-neighbor based nonparametric test for viral remodeling in heterogeneous single-cell proteomic data
- Optimal rates for plug-in estimators of density level sets
- A survey of cross-validation procedures for model selection
- Classification in general finite dimensional spaces with the \(k\)-nearest neighbor rule
- A statistical view of clustering performance through the theory of \(U\)-processes
- Asymptotics of cross-validated risk estimation in estimator selection and performance assess\-ment
- Maximum Likelihood Estimation of a Multi-Dimensional Log-Concave Density
- Robust estimation and classification for functional data via projection-based depth notions
- On the estimation of the mean density of random closed sets
- Optimal weighted nearest neighbour classifiers
- Generalized density clustering
- Regularization in statistics
- Optimization by Gradient Boosting
- Theory of Classification: a Survey of Some Recent Advances
- Total error in a plug-in estimator of level sets.
- 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
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)
