검색 상세

Friend Recommendation Using Probabilistic Matrix Co-Factorization

초록/요약

Nowadays, the number of users on social network sites or e-commercial sites becomes much larger and users’ information on those sites are normally heterogeneous, so friend recommendation becomes more and more an important issue. Many researches have been proposed such as the graph-based approach or content-based approach or hybrid ones, however the model-based method is few, especially the one can utilize a variety of user information. Advancing previous work, in this thesis we present a novel model-based algorithm which can incorporate both the friendship graph and the user rating matrix to learn sensible user descriptors for making friend recommendations. Then, for the experiments we use the benchmark Filmtipset dataset and prove that our algorithm outperforms the base-line methods.

more

목차

1 Introduction 1
2 Related Work 4
3 Algorithm 7
3.1 Problem Definition . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
3.2 FriendPMCF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
3.2.1 Probabilistic Matrix Co-Factorization (PMCF) . . . . . . . 8
3.2.2 Friend Recommendation . . . . . . . . . . . . . . . . . . . . 11
4 Experiment 13
4.1 Description of the Filmtipset Dataset . . . . . . . . . . . . . . . . 13
4.2 Metrics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
4.3 Comparison of Performance . . . . . . . . . . . . . . . . . . . . . . 16
5 Conclusion 21
한글 요약문 23
Bibliography 24

more