1 code implementation • 25 Aug 2019 • Jonathan Strahl, Jaakko Peltonen, Hiroshi Mamitsuka, Samuel Kaski
The identification and removal of contested edges adds no computational complexity to state-of-the-art graph-regularized matrix factorization, remaining linear with respect to the number of non-zeros.
Ranked #1 on Recommendation Systems on YahooMusic (using extra training data)