HAES: A New Hybrid Approach for Movie Recommendation with Elastic Serendipity

Recommendation systems provide good guidance for users to find their favorite movies from an overwhelming amount of options. However, most systems excessively pursue the recommendation accuracy and give rise to over-specialization, which triggers the emergence of serendipity. Hence, serendipity recommendation has received more attention in recent years, facing three key challenges: subjectivity in the definition, the lack of data, and users' floating demands for serendipity. To address these challenges, we introduce a new model called HAES, a H ybrid A pproach for movie recommendation with E lastic S erendipity, to recommend serendipitous movies. Specifically, we (1) propose a more objective definition of serendipity, \em content difference and \em genre accuracy, according to the analysis on a real dataset, (2) propose a new algorithm named JohnsonMax to mitigate the data sparsity and build weak ties beneficial to finding serendipitous movies, and (3) define a novel concept of elasticity in the recommendation, to adjust the level of serendipity flexibly and reach a trade-off between accuracy and serendipity. Extensive experiments on real-world datasets show that HAES enhances the serendipity of recommendations while preserving recommendation quality, compared to several widely used methods.

[1]  Craig MacDonald,et al.  A Deep Recurrent Collaborative Filtering Framework for Venue Recommendation , 2017, CIKM.

[2]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[3]  Lukás Burget,et al.  Recurrent neural network based language model , 2010, INTERSPEECH.

[4]  Krzysztof Goczyla,et al.  Serendipitous Recommendations Through Ontology-Based Contextual Pre-filtering , 2017, BDAS.

[5]  Shuaiqiang Wang,et al.  How does serendipity affect diversity in recommender systems? A serendipity-oriented greedy algorithm , 2018, Computing.

[6]  Enrico Tronci 1997 , 1997, Les 25 ans de l’OMC: Une rétrospective en photos.

[7]  Alex Lobzhanidze,et al.  Buy It Again: Modeling Repeat Purchase Recommendations , 2018, KDD.

[8]  W. S. Lewis Yale Edition of Horace Walpole's correspondence , 1935 .

[9]  Loren Terveen,et al.  User Personality and User Satisfaction with Recommender Systems , 2017, Information Systems Frontiers.

[10]  Xi Niu An Adaptive Recommender System for Computational Serendipity , 2018, ICTIR.

[11]  Tsvi Kuflik,et al.  Distributed collaborative filtering with domain specialization , 2007, RecSys '07.

[12]  Yoshua Bengio,et al.  Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling , 2014, ArXiv.

[13]  Paul Resnick,et al.  Recommender systems , 1997, CACM.

[14]  Deborah Estrin,et al.  Exploring recommendations under user-controlled data filtering , 2018, RecSys.

[15]  Horace Walpole's,et al.  The Yale Edition of Horace Walpole's Correspondence, 1933-1973 , 1938 .

[16]  Haibin Cheng,et al.  Real-time Personalization using Embeddings for Search Ranking at Airbnb , 2018, KDD.

[17]  Wei Niu,et al.  Quality-aware neural complementary item recommendation , 2018, RecSys.

[18]  Paul Lamere,et al.  Music recommendation and discovery revisited , 2011, RecSys '11.

[19]  Alessandro Bozzon,et al.  Interacting Attention-gated Recurrent Networks for Recommendation , 2017, CIKM.

[20]  Shuaiqiang Wang,et al.  Challenges of Serendipity in Recommender Systems , 2016, WEBIST.

[21]  Zhi-Hua Zhou,et al.  A Unified View of Multi-Label Performance Measures , 2016, ICML.

[22]  Qian Zhao,et al.  Investigating serendipity in recommender systems based on real user feedback , 2018, SAC.

[23]  Jonathan L. Herlocker,et al.  Evaluating collaborative filtering recommender systems , 2004, TOIS.

[24]  En Wang,et al.  Improving Existing Collaborative Filtering Recommendations via Serendipity-Based Algorithm , 2018, IEEE Transactions on Multimedia.

[25]  Philip S. Yu,et al.  Broad Learning based Multi-Source Collaborative Recommendation , 2017, CIKM.

[26]  Daniele Quercia,et al.  Auralist: introducing serendipity into music recommendation , 2012, WSDM '12.

[27]  Jian Wang,et al.  Binary Sequences with Good Aperiodic Autocorrelations Using Cross-Entropy Method , 2009, ICIC.

[28]  Shuaiqiang Wang,et al.  A survey of serendipity in recommender systems , 2016, Knowl. Based Syst..

[29]  Jie Wu,et al.  FluidRating: A time-evolving rating scheme in trust-based recommendation systems using fluid dynamics , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[30]  Liang Zhang,et al.  Deep reinforcement learning for page-wise recommendations , 2018, RecSys.

[31]  Jie Wu,et al.  Fine-Grained Feature-Based Social Influence Evaluation in Online Social Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[32]  Shafiq R. Joty,et al.  ANR: Aspect-based Neural Recommender , 2018, CIKM.

[33]  Sarajane Marques Peres,et al.  Exploring Coclustering for Serendipity Improvement in Content-Based Recommendation , 2018, IDEAL.

[34]  Sean M. McNee,et al.  Being accurate is not enough: how accuracy metrics have hurt recommender systems , 2006, CHI Extended Abstracts.

[35]  Yiqun Liu,et al.  Attention-based Adaptive Model to Unify Warm and Cold Starts Recommendation , 2018, CIKM.

[36]  P. Jaccard THE DISTRIBUTION OF THE FLORA IN THE ALPINE ZONE.1 , 1912 .

[37]  F. Maxwell Harper,et al.  The MovieLens Datasets: History and Context , 2016, TIIS.

[38]  Mouzhi Ge,et al.  Beyond accuracy: evaluating recommender systems by coverage and serendipity , 2010, RecSys '10.

[39]  Sophie Ahrens,et al.  Recommender Systems , 2012 .

[40]  Lora Aroyo,et al.  SIRUP: Serendipity In Recommendations via User Perceptions , 2017, IUI.

[41]  Gaurav Pandey,et al.  Recommending Serendipitous Items using Transfer Learning , 2018, CIKM.