Classification with non-i.i.d. sampling
From MaRDI portal
Recommendations
- Learning from non-identical sampling for classification
- Least-square regularized regression with non-iid sampling
- Regression learning with non-identically and non-independently sampling
- Coefficient regularized regression with non-iid sampling
- Online learning with samples drawn from non-identical distributions
Cites work
- A Bennett concentration inequality and its application to suprema of empirical processes
- Basic properties of strong mixing conditions. A survey and some open questions
- Capacity of reproducing kernel spaces in learning theory
- Convexity, Classification, and Risk Bounds
- Fast rates for support vector machines using Gaussian kernels
- Improving the sample complexity using global data
- Learning Theory
- Learning and generalisation. With applications to neural networks.
- Learning from dependent observations
- Learning from non-identical sampling for classification
- Learning rates of regularized regression for exponentially strongly mixing sequence
- Learning theory estimates via integral operators and their approximations
- Least-square regularized regression with non-iid sampling
- Minimum complexity regression estimation with weakly dependent observations
- Multi-kernel regularized classifiers
- ONLINE LEARNING WITH MARKOV SAMPLING
- Rates of convergence for empirical processes of stationary mixing sequences
- Stability bounds for stationary \(\varphi \)-mixing and \(\beta \)-mixing processes
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Statistical performance of support vector machines
- Support vector machine soft margin classifiers: error analysis
- The covering number in learning theory
- Weak convergence and empirical processes. With applications to statistics
Cited in
(17)- Learning from non-random data in Hilbert spaces: an optimal recovery perspective
- Algorithmic Learning Theory
- Classification of the entities represented by samples from Gaussian distribution
- Online learning with samples drawn from non-identical distributions
- Learning from non-iid data: fast rates for the one-vs-all multiclass plug-in classifiers
- Error analysis of the moving least-squares method with non-identical sampling
- scientific article; zbMATH DE number 78503 (Why is no real title available?)
- Convergence rate for the moving least-squares learning with dependent sampling
- Pattern recognition for conditionally independent data
- ERM scheme for quantile regression
- Fast learning from \(\alpha\)-mixing observations
- Error analysis of the moving least-squares regression learning algorithm with β-mixing and non-identical sampling
- Large margin unified machines with non-i.i.d. process
- Auxiliary Marker-Assisted Classification in the Absence of Class Identifiers
- Coefficient regularized regression with non-iid sampling
- Concentration inequalities for empirical processes of linear time series
- Learning from non-identical sampling for classification
This page was built for publication: Classification with non-i.i.d. sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652859)
