Semi-supervised learning with the help of Parzen windows (Q640960): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 08:20, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Semi-supervised learning with the help of Parzen windows |
scientific article |
Statements
Semi-supervised learning with the help of Parzen windows (English)
0 references
21 October 2011
0 references
Learning theory provides mathematical foundations of many algorithms for learning from examples. A large class of learning algorithms are generated by kernel-based regularization schemes. There are two kinds of kernel-based regularization schemes: one for supervised learning and the other for semi-supervised learning or unsupervised learning. In this paper the authors introduce Parzen windows to the classical least squares regularized regression with the motivation of using unlabelled data for semi-supervised learning. The main results are an error analysis and satisfactory learning rates for the learning algorithm.
0 references
semi-supervised learning
0 references
graph-based models
0 references
support vector machine
0 references
least square regression, reproducing kernel Hilbert spaces
0 references