Predicting NBA games with matrix factorization

In my thesis, I present the methods I use to predict NBA games using matrix factorization. Matrix factorization is popular through the Netflix recommendation problem, but in general, one can apply it to data that are best modeled as the result of pairwise interaction. My thesis contains three parts. First, I explain how I model NBA prediction as a matrix factorization problem and use the basic low-rank matrix factorization approach to discover structure in the data. I also explain some differences between using matrix factorization for NBA prediction versus that in the Netflix recommendation problem. Second, I use probabilistic matrix factorization (PMF) to incorporate the fact that when two teams play each other, the scores will be different each time. Lastly, I incorporate supplementary information such as the date of the game by combining multiple PMF problems using Gaussian process priors. I replace the scalar latent features with functions of this supplementary information to aid with prediction.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2016

Author dc:creator

• Tran, Tuan, M. Eng (Tuan Minh) Massachusetts Institute of Technology

Advisor dc:contributor.advisor

• Regina Barzilay.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/106385

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/106385