Graph-based recommendation by trust
by Liejun Wang; Long Pan; Jiwei Qin
International Journal of Internet Protocol Technology (IJIPT), Vol. 14, No. 1, 2021

Abstract: The recommendation system as an effective tool is used to alleviate the information overload problem, and is being applied to personalised services. In recommendation, user's ratings as explicit feedback data can clearly express user's preference, however explicit feedback data has a natural defect that user's interest for an item would varies in context such as emotions, time etc. and the ratings could not reflect the changing. In this paper, a novel graph recommendation algorithm is presented based on user's trust relation that is regarded as implicit feedback data to calculate similarity to enhance the performance for Top-K recommendations. By evaluating the presented algorithm and compared to four competitive algorithms on the four real world datasets, the results show that the presented algorithm performs better than other algorithms in precision, recall and converge.

Online publication date: Thu, 01-Apr-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Protocol Technology (IJIPT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com