Constrained graph-based semi-supervised learning with higher order regularization
Graph-based semi-supervised learning (SSL) algorithms have been widely studied in the last few years. Most of these algorithms were designed from unconstrained optimization problems using a Laplacian regularizer term as smoothness functional in an attempt to reflect the intrinsic geometric structure...
| Autor principal: | |
|---|---|
| Formato: | doctoralThesis |
| Idioma: | eng |
| Publicado em: |
2017
|
| Texto completo: | https://doi.org/10.11606/T.55.2017.tde-08122017-102557 |
| País: | Brasil |
| Oai: | oai:teses.usp.br:tde-08122017-102557 |