Multi-scale broad collaborative filtering for personalized recommendation

Recently, neighborhood-based collaborative filtering has been increasingly used in personalized recommender systems. However, inevitably, the neighborhood selection is based on a single scale, i.e. selecting a fixed number of the nearest users/items. To solve this problem, we propose a new recommend...

Full description

Saved in:
Bibliographic Details
Published inKnowledge-based systems Vol. 278; p. 110853
Main Authors Gao, Yuefang, Huang, Zhen-Wei, Huang, Zi-Yuan, Huang, Ling, Kuang, Yingjie, Yang, Xiaojun
Format Journal Article
LanguageEnglish
Published Elsevier B.V 25.10.2023
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Recently, neighborhood-based collaborative filtering has been increasingly used in personalized recommender systems. However, inevitably, the neighborhood selection is based on a single scale, i.e. selecting a fixed number of the nearest users/items. To solve this problem, we propose a new recommender system called Multi-scale Broad Collaborative Filtering (MBCF). The main contribution lies in designing a multi-scale collaborative vector for capturing the rich information from different numbers of the nearest users/items. However, it is undesirable to input the low-dimensional multi-scale collaborative vector directly into the Deep Neural Networks (DNNs), which can easily lead to overfitting. For this reason, instead of DNNs, the Broad Learning System (BLS) is adopted as the mapping function to learn the complex nonlinear relationships between users and items, which can avoid the above problems while obtaining very satisfactory recommendation performance. Extensive experiments on eight benchmark datasets demonstrate the effectiveness of the proposed MBCF algorithm.
ISSN:0950-7051
1872-7409
DOI:10.1016/j.knosys.2023.110853