Semi-supervised learning with the help of Parzen windows

DOI10.1016/j.jmaa.2011.07.059zbMath1237.68107OpenAlexW2043062885MaRDI QIDQ640960

Shao-Gao Lv, Yun-Long Feng

Publication date: 21 October 2011

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2011.07.059

zbMATH Keywords

support vector machinesemi-supervised learninggraph-based modelsleast square regression, reproducing kernel Hilbert spaces

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Convergence rate for the moving least-squares learning with dependent sampling ⋮ Optimal convergence rates of high order Parzen windows with unbounded sampling

Uses Software

• KernSmooth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parzen windows for multi-class classification
• High order Parzen windows and randomized sampling
• Text classification from labeled and unlabeled documents using EM
• Optimum bounds for the distributions of martingales in Banach spaces
• Weak convergence and empirical processes. With applications to statistics
• Regularization networks and support vector machines
• Learning theory estimates via integral operators and their approximations
• On the mathematical foundations of learning
• Learning Theory
• Capacity of reproducing kernel spaces in learning theory
• Learning Theory

This page was built for publication: Semi-supervised learning with the help of Parzen windows