SCFM: Social and crowdsourcing factorization machines for recommendation

Abstract

With the rapid development of social networks, the exponential growth of social information has attracted much attention. Social information has great value in recommender systems to alleviate the sparsity and cold start problem. On the other hand, the crowd computing empowers recommender systems by utilizing human wisdom. Internal user reviews can be exploited as the wisdom of the crowd to contribute information. In this paper, we propose social and crowdsourcing factorization machines, called SCFM. Our approach fuses social and crowd computing into the factorization machine model. For social computing, we calculate the influence value between users by taking users’ social information and user similarity into account. For crowd computing, we apply LDA (Latent Dirichlet Allocation) on people review to obtain sets of underlying topic probabilities. Furthermore, we impose two important constraints called social regularization and domain inner regularization. The experimental results show that our approach outperforms other state-of-the-art methods. Show more