Paper Session 5: Applications of Recommenders in Personal Needs

Date: Wednesday, Sept 18, 2019, 09:00-10:30
Location: Auditorium
Chair: Tommaso Di Noia

  • LPCollective Embedding for Neural Context-Aware Recommender Systems
    by Felipe Soares da Costa, Peter Dolog

    Context-aware recommender systems consider contextual features as additional information to predict user’s preferences. For example, the recommendations could be based on time, location, or the company of other people. Among the contextual information, time became an important feature because user preferences tend to change over time or be similar in the near future. Researchers have proposed different models to incorporate time into their recommender system, however, the current models are not able to capture specific temporal patterns. To address the limitation observed in previous works, we propose Collective embedding for Neural Context-Aware Recommender Systems (CoNCARS). The proposed solution jointly model the item, user and time embeddings to capture temporal patterns. Then, CoNCARS use the outer product to model the user-item-time correlations between dimensions of the embedding space. The hidden features feed our Convolutional Neural Networks (CNNs) to learn the non-linearities between the different features. Finally, we combine the output from our CNNs in the fusion layer and then predict the user’s preference score. We conduct extensive experiments on real-world datasets, demonstrating CoNCARS improves the top-N item recommendation task and outperform the state-of-the-art recommendation methods.

  • LPA Recommender System for Heterogeneous and Time Sensitive Environment
    by Meng Wu, Ying Zhu, Qilian Yu, Bhargav Rajendra, Yunqi Zhao, Navid Aghdaie, Kazi A. Zaman

    The digital game industry has recently adopted recommender systems to deliver the most relevant content and suggest the most suitable activities to players. Because of diverse game designs and dynamic experiences, recommender systems typically operate in highly heterogeneous and time-sensitive environments. In this paper, we describe a recommender system at a digital game company which aims to provide recommendations for a large variety of use-cases while being easy to integrate and operate. The system leverages a unified data platform, standardized context and tracking data pipelines, robust naive linear contextual multi-armed bandit algorithms, and experimentation platform for extensibility as well as flexibility. Several games and applications have successfully launched with the recommender system and have achieved significant improvements.

  • LPLatent Factor Models and Aggregation Operators for Collaborative Filtering in Reciprocal Recommender Systems
    by James Neve, Ivan Palomares

    Online dating platforms help to connect people who might potentially be a good match for each other. They have exerted a significant societal impact over the last decade, such that about one third of new relationships in the US are now started online, for instance. Recommender Systems are widely utilized in online platforms that connect people to people in e.g. online dating and recruitment sites. These recommender approaches are fundamentally different from traditional user-item approaches (such as those operating on movie and shopping sites), in that they must consider the interests of both parties jointly. Latent factor models have been notably successful in the area of user-item recommendation, however they have not been investigated within user-to-user domains as of yet. In this study, we present a novel method for reciprocal recommendation using latent factor models. We also provide a first analysis of the use of different preference aggregation strategies, thereby demonstrating that the aggregation function used to combine user preference scores has a significant impact on the outcome of the recommender system. Our evaluation results report significant improvements over previous nearest-neighbour and content-based methods for reciprocal recommendation, and show that the latent factor model can be used effectively on much larger datasets than previous state-of-the-art reciprocal recommender systems.

  • LPCB2CF: A Neural Multiview Content-to-Collaborative Filtering Model for Completely Cold Item Recommendations
    by Oren Barkan, Noam Koenigstein, Eylon Yogev, Ori Katz

    In Recommender Systems research, algorithms are often characterized as either Collaborative Filtering (CF) or Content Based (CB). CF algorithms are trained using a dataset of user preferences while CB algorithms are typically based on item profiles. These approaches harness different data sources and therefore the resulting recommended items are generally very different. This paper presents the CB2CF, a deep neural multiview model that serves as a bridge from items content into their CF representations. CB2CF is a ‘real-world’ algorithm designed for Microsoft Store services that handle around a billion users worldwide. CB2CF is demonstrated on movies and apps recommendations, where it is shown to outperform an alternative CB model on completely cold items.

  • LPOnline Learning to Rank for Sequential Music Recommendation
    by Bruno L. Pereira, Alberto Ueda, Gustavo Penha, Rodrygo L. T. Santos, Nivio Ziviani

    The prominent success of music streaming services has brought increasingly complex challenges for music recommendation. In particular, in a streaming setting, songs are consumed sequentially within a listening session, which should cater not only for the user’s historical preferences, but also for eventual preference drifts, triggered by a sudden change in the user’s context. In this paper, we propose a novel online learning to rank approach for music recommendation aimed to continuously learn from the user’s listening feedback. In contrast to existing online learning approaches for music recommendation, we leverage implicit feedback as the only signal of the user’s preference. Moreover, to adapt rapidly to preference drifts over millions of songs, we represent each song in a lower dimensional feature space and explore multiple directions in this space as duels of candidate recommendation models. Our thorough evaluation using listening sessions from Last.fm demonstrates the effectiveness of our approach at learning faster and better compared to state-of-the-art online learning approaches.

  • SPOPace My Race: Recommendations for Marathon Running
    by Jakim Berndsen, Barry Smyth, Aonghus Lawlor

    We propose marathon running as a novel domain for recommender systems and machine learning. Using high-resolution marathon performance data from multiple marathon races (n=7931), we build in-race recommendations for runners. We show that we can outperform the existing techniques which are currently employed for in-race finish-time prediction, and we demonstrate how such predictions may be used to make real time recommendations to runners. The recommendations are made at critical points in the race to provide personalised guidance so the runner can adjust their race strategy. Through the association of model features and the expert domain knowledge of marathon runners we generate explainable, adaptable pacing recommendations which can guide runners to their best possible finish time and help them avoid the potentially catastrophic effects of hitting the wall.

Back to Program

Diamond Supporters
 
 
Platinum Supporters
 
 
 
Gold Supporters
 
 
 
 
Silver Supporters
 
 
Special Supporter