Graph-Based Collaborative Filtering with MLP

2018 
The collaborative filtering (CF) methods are widely used in the recommendation systems. They learn users’ interests and preferences from their historical data and then recommend the items users may like. However, the existing methods usually measure the correlation between users by calculating the coefficient of correlation, which cannot capture any latent features between users. In this paper, we proposed an algorithm based on graph. First, we transform the usersinformation into vectors and use SVD method to reduce dimensions and then learn the preferences and interests of all users based on the improved kernel function and map them to the network; finally, we predict the user’s rating for the items through the Multilayer Perceptron (MLP). Compared with existing methods, on one hand, our method can discover some latent features between users by mapping usersinformation to the network. On the other hand, we improve the vectors with the ratings information to the MLP method and predict the ratings for items, so we can achieve better effects for recommendation.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    26
    References
    6
    Citations
    NaN
    KQI
    []