Algorithms for Semisupervised learning on graphs

Flores, Mauricio
2018-12

View/Download File

Flores_umn_0130E_19992.pdf (5.59 MB)

Persistent link to this item

https://hdl.handle.net/11299/202202
Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Algorithms for Semisupervised learning on graphs

Authors

Published Date

2018-12

Publisher

Type

Thesis or Dissertation

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.

Keywords

Description

University of Minnesota Ph.D. dissertation.December 2018. Major: Mathematics. Advisors: Jeff Calder, Gilad Lerman. 1 computer file (PDF); ix, 89 pages.

Related to

Replaces

License

Collections

Dissertations

Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

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

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.