Etd

Large Scale Matrix Completion and Recommender Systems

Public

Downloadable Content

open in viewer

The goal of this thesis is to extend the theory and practice of matrix completion algorithms, and how they can be utilized, improved, and scaled up to handle large data sets. Matrix completion involves predicting missing entries in real-world data matrices using the modeling assumption that the fully observed matrix is low-rank. Low-rank matrices appear across a broad selection of domains, and such a modeling assumption is similar in spirit to Principal Component Analysis. Our focus is on large scale problems, where the matrices have millions of rows and columns. In this thesis we provide new analysis for the convergence rates of matrix completion techniques using convex nuclear norm relaxation. In addition, we validate these results on both synthetic data and data from two real-world domains (recommender systems and Internet tomography). The results we obtain show that with an empirical, data-inspired understanding of various parameters in the algorithm, this matrix completion problem can be solved more efficiently than some previous theory suggests, and therefore can be extended to much larger problems with greater ease.

Creator
Contributors
Degree
Unit
Publisher
Language
  • English
Identifier
  • etd-090415-162439
Keyword
Advisor
Defense date
Year
  • 2015
Date created
  • 2015-09-04
Resource type
Rights statement
Last modified
  • 2021-02-01

Relations

In Collection:

Items

Items

Permanent link to this page: https://digital.wpi.edu/show/bk128b05q