Pages that link to "Item:Q3373749"
From MaRDI portal
The following pages link to Theory of Classification: a Survey of Some Recent Advances (Q3373749):
Displaying 50 items.
- Classification in general finite dimensional spaces with the \(k\)-nearest neighbor rule (Q292872) (← links)
- A partial overview of the theory of statistics with functional data (Q389287) (← links)
- A statistical view of clustering performance through the theory of \(U\)-processes (Q392047) (← links)
- Adaptive partitioning schemes for bipartite ranking (Q413849) (← links)
- Learning noisy linear classifiers via adaptive and selective sampling (Q413852) (← links)
- Robustness and generalization (Q420915) (← links)
- Risk bounds for CART classifiers under a margin condition (Q437488) (← links)
- Kullback-Leibler aggregation and misspecified generalized linear models (Q447818) (← links)
- Cover-based combinatorial bounds on probability of overfitting (Q461903) (← links)
- Classification algorithms using adaptive partitioning (Q482871) (← links)
- Overlaying classifiers: A practical approach to optimal scoring (Q607486) (← links)
- A high-dimensional Wilks phenomenon (Q718891) (← links)
- Generalized mirror averaging and \(D\)-convex aggregation (Q734528) (← links)
- PAC-Bayesian bounds for randomized empirical risk minimizers (Q734547) (← links)
- Optimal weighted nearest neighbour classifiers (Q741805) (← links)
- On signal representations within the Bayes decision framework (Q763367) (← links)
- Efficiency of classification methods based on empirical risk minimization (Q844356) (← links)
- On the kernel rule for function classification (Q853841) (← links)
- On regularization algorithms in learning theory (Q870339) (← links)
- Multi-kernel regularized classifiers (Q870343) (← links)
- Empirical risk minimization for heavy-tailed losses (Q892246) (← links)
- Kernel methods in machine learning (Q930651) (← links)
- Obtaining fast error rates in nonconvex situations (Q933417) (← links)
- Learning by mirror averaging (Q955138) (← links)
- Constructing processes with prescribed mixing coefficients (Q956363) (← links)
- Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
- A survey of cross-validation procedures for model selection (Q975579) (← links)
- Fast learning rates for plug-in classifiers (Q995418) (← links)
- Bayesian approach, theory of empirical risk minimization. Comparative analysis (Q1008355) (← links)
- Instability, complexity, and evolution (Q1036993) (← links)
- PAC-Bayesian high dimensional bipartite ranking (Q1642737) (← links)
- Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction (Q1650797) (← links)
- Localization of VC classes: beyond local Rademacher complexities (Q1663641) (← links)
- Relative deviation learning bounds and generalization with unbounded loss functions (Q1714946) (← links)
- Convergence conditions for the observed mean method in stochastic programming (Q1745693) (← links)
- Testing piecewise functions (Q1786590) (← links)
- Upper bounds and aggregation in bipartite ranking (Q1951156) (← links)
- Classification with minimax fast rates for classes of Bayes rules with sparse representation (Q1951772) (← links)
- Plugin procedure in segmentation and application to hyperspectral image segmentation (Q1952077) (← links)
- Adaptive kernel methods using the balancing principle (Q1959089) (← links)
- Classification with many classes: challenges and pluses (Q2008227) (← links)
- Sharpness estimation of combinatorial generalization ability bounds for threshold decision rules (Q2034842) (← links)
- Robust \(k\)-means clustering for distributions with two moments (Q2054489) (← links)
- Statistical analysis of Mapper for stochastic and multivariate filters (Q2082451) (← links)
- Percolation centrality via Rademacher Complexity (Q2091801) (← links)
- Statistical learning from biased training samples (Q2106792) (← links)
- Depth separations in neural networks: what is actually being separated? (Q2117335) (← links)
- An empirical classification procedure for nonparametric mixture models (Q2131945) (← links)
- How can we identify the sparsity structure pattern of high-dimensional data: an elementary statistical analysis to interpretable machine learning (Q2170515) (← links)
- Robust statistical learning with Lipschitz and convex loss functions (Q2174664) (← links)
