The power of implicit social relation in rating prediction of social recommender systems of social recommender

• Main Authors: Reafee, W., Salim, N., Khan, A.
• Format: Article
• Language: English
• Published: Public Library of Science 2016
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.utm.my/id/eprint/72585/1/Waleed2016_ThePowerofImplicitSocialRelation.pdf; http://eprints.utm.my/id/eprint/72585/; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84968608575&doi=10.1371%2fjournal.pone.0154848&partnerID=40&md5=41e3a5a6c20d4eaf93a824b5bd6a6160

The explosive growth of social networks in recent times has presented a powerful source of information to be utilized as an extra source for assisting in the social recommendation problems. The social recommendation methods that are based on probabilistic matrix factorization improved the recommendation accuracy and partly solved the cold-start and data sparsity problems. However, these methods only exploited the explicit social relations and almost completely ignored the implicit social relations. In this article, we firstly propose an algorithm to extract the implicit relation in the undirected graphs of social networks by exploiting the link prediction techniques. Furthermore, we propose a new probabilistic matrix factorization method to alleviate the data sparsity problem through incorporating explicit friendship and implicit friendship. We evaluate our proposed approach on two real datasets, Last.Fm and Douban. The experimental results show that our method performs much better than the state-of-the-art approaches, which indicates the importance of incorporating implicit social relations in the recommendation process to address the poor prediction accuracy.