World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Supervised Convolutional Matrix Factorization for Document Recommendation

    https://doi.org/10.1142/S1469026818500189Cited by:4 (Source: Crossref)

    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.

    Remember to check out the Most Cited Articles!

    Check out these titles in artificial intelligence!