Logistic classification with varying gaussians

DOI10.1016/J.CAMWA.2010.11.016MaRDI QIDQ534984zbMATH OpenOpenAlexFDO

Authors Dao-Hong Xiang

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

zbMATH Keywords

reproducing kernel Hilbert spacebinary classificationSobolev spaceprojection operatorlogistic loss

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Recommendations

• scientific article; zbMATH DE number 2119836
• Logistic regression with random coefficients
• Nonlinear Logistic Discrimination Via Regularized Gaussian Basis Expansions
• Logistic regression with total variation regularization
• Logistic Discrimination Based on Regularized Local Likelihood Method

Cites work

• scientific article; zbMATH DE number 45848 (Why is no real title available?)
• scientific article; zbMATH DE number 962825 (Why is no real title available?)
• Capacity of reproducing kernel spaces in learning theory
• Classification with Gaussians and convex loss
• Convexity, Classification, and Risk Bounds
• Fast rates for support vector machines using Gaussian kernels
• Fully online classification by regularization
• Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
• Learning Theory
• Learning rates of least-square regularized regression
• Multi-kernel regularized classifiers
• ONLINE LEARNING WITH MARKOV SAMPLING
• On Complexity Issues of Online Learning Algorithms
• Optimal aggregation of classifiers in statistical learning.
• Regularization networks and support vector machines
• SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
• Support vector machine soft margin classifiers: error analysis
• The covering number in learning theory
• The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
• Theory of Reproducing Kernels

Cited in

(9)

• Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications
• Classification with Gaussians and convex loss. II: Improving error bounds by noise conditions
• Error bounds for learning the kernel
• Quantitative convergence analysis of kernel based large-margin unified machines
• Consistency of logistic classifier in abstract Hilbert spaces
• Large margin unified machines with non-i.i.d. process
• Learning rates for classification with Gaussian kernels
• Comparison theorems on large-margin learning
• Self-concordant analysis for logistic regression

This page was built for publication: Logistic classification with varying gaussians

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534984)