A Study Of The Application Of SVT Algorithm In Netflix Problem

Matrix completion has a wide range of applications and draws moreattention in the data mining field. In this article, the famous Netflix problemis translated as a matrix completion problem and the singular valuethresholding algorithm is used to solve it. Although the SVT method iseffective for many matrix completions, it indeed encounters some difficultieswhile being used directly to Netflix problem. For the implement of the SVT,we make the code which could maintain the sparse data structure of the matrix,and improve the recovery accuracy by mean offset correction. To balance themodel approximation and error control, we proposed a variable thresholdscheme. Meanwhile, considering the time properties of the data in Netflixproblem, a simple time-weighted model is formed which can improve therecovery accuracy to some extent. But there exists a gap compared with theexpected result and further improvements are needed in many aspects.