A recommendation algorithm considering user trust and interest

2Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A traditional collaborative filtering recommendation algorithm has problems with data sparseness, a cold start and new users. With the rapid development of social network and e-commerce, building the trust between users and user interest tags to provide a personalized recommendation is becoming an important research issue. In this study, we propose a probability matrix factorization model (STUIPMF) by integrating social trust and user interest. First, we identified implicit trust relationship between users and potential interest label from the perspective of user rating. Then, we used a probability matrix factorization model to conduct matrix decomposition of user ratings information, user trust relationship, and user interest label information, and further determined the user characteristics to ease data sparseness. Finally, we used an experiment based on the Epinions website’s dataset to verify our proposed method. The results show that the proposed method can improve the recommendation’s accuracy to some extent, ease a cold start and solve new user problems. Meanwhile, the STUIPMF approach, we propose, also has a good scalability.

Cite

CITATION STYLE

APA

Mi, C., Peng, P., & Mierzwiak, R. (2018). A recommendation algorithm considering user trust and interest. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10842 LNAI, pp. 408–422). Springer Verlag. https://doi.org/10.1007/978-3-319-91262-2_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free