Back to search

University of Minnesota

Algorithms for Semisupervised learning on graphs

Abstract

dc:description.abstract

Laplacian regularization has been extensively used in a wide variety of semi-supervised learning tasks over the past fifteen years. In recent years, limitations of the Laplacian regularization have been exposed, leading to the development of a general class of Lp-based Laplacian regularization models. We propose novel algorithms to solve the resulting optimization problem, as the amount of unlabeled data increases to infinity, while the amount of labeled data remains fixed and is very small. We explore a practical application to recommender systems.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Flores, Mauricio

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Dc Identifier Citation
Flores, Mauricio. (2018). Algorithms for Semisupervised learning on graphs. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/202202.

Chain of custody

source
Harvested from
University of Minnesota
Base URL
conservancy.umn.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Flores, Mauricio. Algorithms for Semisupervised learning on graphs. 2018. http://hdl.handle.net/11299/202202