点击次数：

论文类型：期刊论文

发表时间：2016-12-01

发表刊物：KNOWLEDGE AND INFORMATION SYSTEMS

收录刊物：SCIE、Scopus

卷号：49

期号：3

页面范围：975-1004

ISSN号：0219-1377

关键字：Collaborative filtering; Community; Relatedness; Homotopy algorithm; l(1)-Regularized least squares problem

摘要：Collaborative filtering (CF) approaches have been widely been employed in e-commerce to help users find items they like. Whereas most of existing work focuses on improving algorithmic performance, it is important to know whether the recommendation for users and items can be trustworthy. In this paper, we propose a metric, "relatedness," to measure the potential that a user's preference on an item can be accurately predicted. The relatedness of a user-item pair is determined by a community which consists of users and items most related to the pair. The relatedness is computed by solving a constrained -regularized least square problem with a generalized homotopy algorithm, and we design the homotopy-based community search algorithm to identify the community by alternately selecting the most related users and items. As an application of the relatedness metric, we develop the data-oriented combination (DOC) method for recommender systems by integrating a group of benchmark CF methods based on the relatedness of user-item pairs. In experimental studies, we examine the effectiveness of the relatedness metric and validate the performance of the DOC method by comparing it with benchmark methods.