Integrating context similarity with sparse linear recommendation model

24Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Context-aware recommender systems extend traditional recommender systems by adapting their output to users’ specific contextual situations. Most of the existing approaches to context-aware recommendation involve directly incorporating context into standard recommendation algorithms (e.g., collaborative filtering, matrix factorization). In this paper, we highlight the importance of context similarity and make the attempt to incorporate it into context-aware recommender. The underlying assumption behind is that the recommendation lists should be similar if their contextual situations are similar. We integrate context similarity with sparse linear recommendation model to build a similarity-learning model. Our experimental evaluation demonstrates that the proposed model is able to outperform several state-of-the-art context-aware recommendation algorithms for the top-N recommendation task.

Cite

CITATION STYLE

APA

Zheng, Y., Mobasher, B., & Burke, R. (2015). Integrating context similarity with sparse linear recommendation model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9146, pp. 370–376). Springer Verlag. https://doi.org/10.1007/978-3-319-20267-9_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free