A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Top-N recommendation is an important recommendation technique that delivers a ranked top-N item list to each user. Data sparsity is a great challenge for top-N recommendation. In order to tackle this problem, in this paper, we propose a semi-supervised model called Semi-BPR (Semi-Supervised Bayesian Personalized Ranking). Our approach is based on the assumption that, for a given model, users always prefer items ranked higher in the generated recommendation list. Therefore, we select a certaindoi:10.3390/sym10100492 fatcat:of7ludz2jbf7rogdpocmmpnaqm