Logistic classification with varying gaussians
From MaRDI portal
Publication:534984
DOI10.1016/j.camwa.2010.11.016zbMath1211.65064OpenAlexW2082710801MaRDI QIDQ534984
Publication date: 10 May 2011
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2010.11.016
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)
Related Items (5)
Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications ⋮ Quantitative convergence analysis of kernel based large-margin unified machines ⋮ Learning Rates for Classification with Gaussian Kernels ⋮ Error bounds for learning the kernel ⋮ Comparison theorems on large-margin learning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-kernel regularized classifiers
- Fast rates for support vector machines using Gaussian kernels
- The covering number in learning theory
- Optimal aggregation of classifiers in statistical learning.
- Regularization networks and support vector machines
- Fully online classification by regularization
- Learning rates of least-square regularized regression
- Learning Theory
- Capacity of reproducing kernel spaces in learning theory
- ONLINE LEARNING WITH MARKOV SAMPLING
- The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
- On Complexity Issues of Online Learning Algorithms
- Convexity, Classification, and Risk Bounds
- Theory of Reproducing Kernels
This page was built for publication: Logistic classification with varying gaussians
