Exploring Coclustering for Serendipity Improvement in Content-Based Recommendation

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

Abstract

Content-based recommender systems are widely used in different domains. However, they are usually inefficient to produce serendipitous recommendations. A recommendation is serendipitous if it is both relevant and unexpected. The literature indicates that one possibility of achieving serendipity in recommendations is to design them using partial similarities between items. From such intuition, coclustering can be explored to offer serendipitous recommendations to users. In this paper, we propose a coclustering-based approach to implement content-based recommendations. Experiments carried out on the MovieLens 2K dataset show that our approach is competitive in terms of serendipity.

Cite

CITATION STYLE

APA

Silva, A. M., da Silva Costa, F. H., Diaz, A. K. R., & Peres, S. M. (2018). Exploring Coclustering for Serendipity Improvement in Content-Based Recommendation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11314 LNCS, pp. 317–327). Springer Verlag. https://doi.org/10.1007/978-3-030-03493-1_34

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