The importance of similarity metrics for representative users identification in recommender systems
Date Issued
2010
Author(s)
DOI
10.1007/978-3-642-16239-8_5
Abstract
In this paper we explore the efficiency of recommendation provided by representative users on behalf of cluster members. Clustering is used to moderate the scalability and diversity issues faced by most recommendation algorithms face. We show through extended evaluation experiments that cluster representative make successful recommendations outperforming the K-nearest neighbor approach which is common in recommender systems that are based on collaborative filtering. However, selection of representative users depends heavily on the similarity metric that is used to identify users with similar preferences. It is shown that the use of different similarity metrics leads, in general, to different representative users while the commonly used Pearson coefficient is the poorest similarity metric in terms of representative user identification
File(s)![Thumbnail Image]()
Name
Tsapatsoulis_The importance of similarity metrics for.pdf
Size
130.58 KB
Format
Adobe PDF
Checksum (MD5)
fda19cd0aca481a915932ede6896f946