Regularized semi-supervised learning
Regularized semi-supervised learning adds explicit geometric or graph-based penalty terms to a semi-supervised objective so that the decision function varies smoothly over the data manifold. Pioneered through manifold regularization (Belkin, Niyogi & Sindhwani, 2006), it exploits the structure of both labeled and unlabeled examples to learn more accurate models than supervised regularization alone when labeled data are scarce.
Kilderegistrering
Citater kopieret ordret fra metodens kilderegistrering. Ingen påstandsniveauverifikation er udledt heraf.
- Belkin, M., Niyogi, P., & Sindhwani, V. (2006). Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of Machine Learning Research, 7, 2399–2434. · URL
- Chapelle, O., Scholkopf, B., & Zien, A. (Eds.). (2006). Semi-Supervised Learning. MIT Press. · ISBN 978-0-262-03358-9
Kuraterede påstande
Påstande gemt i bevis-loggen, hver med sin egen vurdering.
Denne visning opfinder ikke en påstandsvurdering, når loggen ingen har.
Relaterede metoder
Genereret fra metodegrafen og vist som maskinelt foreslåede relationer — ingen bevispåstand er udledt.