An efficient hybrid similarity measure based on user interests for recommender systems. Issue 5 (29th August 2019)

• Record Type: Journal Article
• Authors: Hawashin, Bilal; Lafi, Mohammad; Kanan, Tarek; Mansour, Ayman
• Other Names: Chang Victor guestEditor.; Aljawarneh Shadi A. guestEditor.; Li Chung‐Sheng guestEditor.
• Is Part Of: Expert systems. Volume 37:Issue 5(2020)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-08-29
• Subjects: cold start problem -- content‐based filtering -- machine learning -- recommender systems -- user interest -- user–user similarity measure; Expert systems (Computer science); 006.33
• DOI: 10.1111/exsy.12471
• Languages: English
• ISSNs: 0266-4720

Abstract

Abstract: Recommender systems are used to suggest items to users based on their interests. They have been used widely in various domains, including online stores, web advertisements, and social networks. As part of their process, recommender systems use a set of similarity measurements that would assist in finding interesting items. Although many similarity measurements have been proposed in the literature, they have not concentrated on actual user interests. This paper proposes a new efficient hybrid similarity measure for recommender systems based on user interests. This similarity measure is a combination of two novel base similarity measurements: the user interest–user interest similarity measure and the user interest–item similarity measure. This hybrid similarity measure improves the existing work in three aspects. First, it improves the current recommender systems by using actual user interests. Second, it provides a comprehensive evaluation of an efficient solution to the cold start problem. Third, this similarity measure works well even when no corated items exist between two users. Our experiments show that our proposed similarity measure is efficient in terms of accuracy, execution time, and applicability. Specifically, our proposed similarity measure achieves a mean absolute error (MAE) as low as 0.42, with 64% applicability and an execution time as low as 0.03 s, whereas the existing similarity measures from the literature achieve an MAE of 0.88 at their best; these results demonstrate the superiority of our proposed similarity measure in terms of accuracy, as well as having a high applicability percentage and a very short execution time.