2008
DOI: 10.1007/s10994-008-5081-7
|View full text |Cite
|
Sign up to set email alerts
|

Latent grouping models for user preference prediction

Abstract: We tackle the problem of new users or documents in collaborative filtering. Generalization over users by grouping them into user groups is beneficial when a rating is to be predicted for a relatively new document having only few observed ratings. Analogously, generalization over documents improves predictions in the case of new users. We show that if either users and documents or both are new, two-way generalization becomes necessary. We demonstrate the benefits of grouping of users, grouping of documents, and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
21
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(21 citation statements)
references
References 18 publications
0
21
0
Order By: Relevance
“…Typical examples include Pearson Correlation Coefficient (PCC) [27] and Vector Similarity (VS) [4]. Alternatively, model-based methods [7,13,32,33] are from a probabilistic perspective, which builds a probabilistic model to calculate the expectation of a user's rating on an item. A classical way is to utilize probabilistic latent class [13].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Typical examples include Pearson Correlation Coefficient (PCC) [27] and Vector Similarity (VS) [4]. Alternatively, model-based methods [7,13,32,33] are from a probabilistic perspective, which builds a probabilistic model to calculate the expectation of a user's rating on an item. A classical way is to utilize probabilistic latent class [13].…”
Section: Related Workmentioning
confidence: 99%
“…Traditionally, CF algorithms are used in these systems, assigning each user-item pair a score indicating the user's rating on the item, based on which a ranking list of items is generated to the user as suggestions. Classical CF methods are divided into memory-based methods [4,12,14,20,30,34] and model-based methods [7,13,32,33]. Recently, social relations have been considered in many applications, and in this paper, we address the issue of social recommendation.…”
Section: Introductionmentioning
confidence: 99%
“…This problem of unseen or almost unseen users and documents is generally referred to as the cold-start problem in recommender system literature, see for instance [23]. The Two-Way Model was proposed to tackle this problem of either new users or new documents [22,24].…”
Section: Cold-start Problemmentioning
confidence: 99%
“…In addition, there is a two-way grouping model, called Flexible Mixture Model (FMM; [21]). We have discussed the main differences between our Two-Way Model and these related models in [22].…”
mentioning
confidence: 99%
“…Biclustering is a well-studied problem, with applications to gene expression data, recommender systems, market segmentation, and other areas [7,8,14,16,25,36]. However, maybe surprisingly, biclustering has not been used for shape correspondence, with the notable exception of [10].…”
Section: Introductionmentioning
confidence: 99%