Supervised Convolutional Matrix Factorization For Document Recommendation

Recently, document recommendation has become a very hot research area in online services. Since rating information is usually sparse with exploding growth of the numbers of users and items, conventional collaborative filtering-based methods degrade significantly in recommendation performance. To address this sparseness problem, auxiliary information such as item content information may be utilized. Convolution matrix factorization (ConvMF) is an appealing method, which tightly combines the rating and item content information. Although ConvMF captures contextual information of item content by utilizing convolutional neural network (CNN), the latent representation may not be effective when the rating information is very sparse. To address this problem, we generalize recent advances in supervised CNN and propose a novel recommendation model called supervised convolution matrix factorization (Super-ConvMF), which effectively combines the rating information, item content information and tag information into a unified recommendation framework. Experiments on three real-world datasets, two datasets come from MovieLens and the other one is from Amazon, show our model outperforms the state-of-the-art competitors in terms of the whole range of sparseness.