- DMNU:BRIEF – A Privacy-aware Newsletter Personalization Engine for Publishers
by Ernesto Diaz-Aviles (recsyslabs and University College Dublin (UCD), Ireland), Claudia Orellana-Rodriguez (recsyslabs and University College Dublin (UCD), Ireland), Igor Brigadir (recsyslabs and University College Dublin (UCD), Ireland), and Reshma Narayanan Kutty (recsyslabs and University College Dublin (UCD), Ireland)
Newsletters have (re-) emerged as a powerful tool for publishers to engage with their readers directly and more effectively. Despite the diversity in their audiences, publishers’ newsletters remain largely a one-size-fits-all offering, which is suboptimal. In this paper, we present NU:BRIEF, a web application for publishers that enables them to personalize their newsletters without harvesting personal data. Personalized newsletters build a habit and become a great conversion tool for publishers, providing an alternative readers-generated revenue model to a declining ad/clickbait-centered business model. Demo: https://demo.nubrief.com/md03PaAJSwXMegL5BbKpQlArK3elb3hDUglcHodx4gE=/ Explainer video: https://www.youtube.com/watch?v=AUZGuyPJYH4
Full text in ACM Digital Library
|
- DMGeneric Automated Lead Ranking in Dynamics CRM
by Royi Ronen (Microsoft, Israel), Hilik Berezin (Microsoft, Israel), Rotem Preizler (Microsoft, Israel), Gopal Kasturi (Microsoft, India), AJ Ezzour (Microsoft, United States), Sayalee Bhanavase (Microsoft, Canada), Edan Hauon (Microsoft, Israel), and Oron Nir (Microsoft, Israel)
We developed a generic framework which enables Customer Relationship Management (CRM) organizations to deploy an automated ranking system for leads (commonly known as ‘lead scoring’). Leads are records that represent non-customers who might become customers. Lead ranking is a fundamental CRM problem with many flavors. Ranking serves as a prioritization management tool for CRM organizations, with many characteristics similar to those of recommender systems. We present the system with its most recent developments, emphasizing challenges that go beyond the core of the learning algorithm, and that have played an instrumental role in maturing the system into a trustable feature, robust to different types of organizations and datasets. Particularly, we present features which enable Human in the Loop [1], a dominant concept in both configuration and result consumption. Another type of features demonstrates the addition of domain knowledge into the machine learning based process. We present the concepts of feature selection, with and without human help, prediction explanations, insights on model inputs, data quality issues, training for UX consistency, and actionability for each individual prediction.
Full text in ACM Digital Library
|
- LBREigenvalue Perturbation for Item-based Recommender Systems
by Cesare Bernardis (Politecnico di Milano, Italy) and Paolo Cremonesi (Politecnico di Milano, Italy)
Adding confidence estimates to predicted ratings has been shown to positively influence the quality of the recommendations provided by a recommender system. While confidence over single point predictions of ratings and preferences has been widely studied in literature, limited effort has been put in exploring the benefits provided by user-level confidence indices. In this work we exploit a recently introduced user-level confidence index, called eigenvalue confidence index, in order to provide maximum confidence recommendations for item-based recommender systems. We firstly derive a closed form solution to calculate the index, then we propose a new recommendation methodology for item-based models, called eigenvalue perturbation, founded on the strongly positive correlation between the index value and the accuracy of the recommendations. We show and discuss the accuracy results obtained with a comprehensive set of experiments over several datasets and using different item-based models, empirically proving that applying the new technique we are able to outperform the original recommendation models in most of the experimental configurations.
Full text in ACM Digital Library
|
- LBRQuality Metrics in Recommender Systems: Do We Calculate Metrics Consistently?
by Yan-Martin Tamm (Sber AI Lab, Russian Federation), Rinchin Damdinov (Sber AI Lab, Russian Federation), and Alexey Vasilev (Sber AI Lab, Russian Federation)
Offline evaluation is a popular approach to determine the best algorithm in terms of the chosen quality metric. However, if the chosen metric calculates something unexpected, this miscommunication can lead to poor decisions and wrong conclusions. In this paper, we thoroughly investigate quality metrics used for recommender systems evaluation. We look at the practical aspect of implementations found in modern RecSys libraries and at the theoretical aspect of definitions in academic papers. We find that Precision is the only metric universally understood among papers and libraries, while other metrics may have different interpretations. Metrics implemented in different libraries sometimes have the same name but measure different things, which leads to different results given the same input. When defining metrics in an academic paper, authors sometimes omit explicit formulations or give references that do not contain explanations either. In 47% of cases, we cannot easily know how the metric is defined because the definition is not clear or absent. These findings highlight yet another difficulty in recommender system evaluation and call for a more detailed description of evaluation protocols.
Full text in ACM Digital Library
|
- LBRInvestigating Overparameterization for Non-Negative Matrix Factorization in Collaborative Filtering
by Yuhi Kawakami (National Institute of Informatics and The Graduate University for Advanced Studies, SOKENDAI, Japan) and Mahito Sugiyama (National Institute of Informatics and The Graduate University for Advanced Studies, SOKENDAI, Japan)
Overparameterization is one of the key techniques in modern machine learning, where a model with the higher complexity can generalize better on test data against the common knowledge of the bias-variance trade-off in classical statistical learning theory. In this paper, we empirically investigate the effect of overparameterization for matrix factorization-based models in collaborative filtering. Surprisingly, we firstly show that the performance of overparameterized non-negative matrix factorization (NMF) on test data gets better than that of the underparameterized NMF, which is commonly used to date, and is even competitive with the state-of-the-art collaborative filtering techniques. Moreover, we also show that the double descent phenomenon occurs when we increase the number of parameters of the NMF, where the test error decreases, increases, and decreases again as the model complexity grows, which has been recently reported in various machine learning methods such as deep learning models and kernel methods.
Full text in ACM Digital Library
|
- LBRPredicting Music Relistening Behavior Using the ACT-R Framework
by Markus Reiter-Haas (Graz University of Technology, Austria), Emilia Parada-Cabaleiro (Johannes Kepler University Linz, Austria), Markus Schedl (Johannes Kepler University Linz, Austria), Elham Motamedi (University of Primorska, Slovenia), Marko Tkalcic (University of Primorska, Slovenia), and Elisabeth Lex (Graz University of Technology, Austria)
Providing suitable recommendations is of vital importance to improve the user satisfaction of music recommender systems. Here, users often listen to the same track repeatedly and appreciate recommendations of the same song multiple times. Thus, accounting for users’ relistening behavior is critical for music recommender systems. In this paper, we describe a psychology-informed approach to model and predict music relistening behavior that is inspired by studies in music psychology, which relate music preferences to human memory. We adopt a well-established psychological theory of human cognition that models the operations of human memory, i.e., Adaptive Control of Thought—Rational (ACT-R). In contrast to prior work, which uses only the base-level component of ACT-R, we utilize five components of ACT-R, i.e., base-level, spreading, partial matching, valuation, and noise, to investigate the effect of five factors on music relistening behavior: (i) recency and frequency of prior exposure to tracks, (ii) co-occurrence of tracks, (iii) the similarity between tracks, (iv) familiarity with tracks, and (v) randomness in behavior. On a dataset of 1.7 million listening events from Last.fm, we evaluate the performance of our approach by sequentially predicting the next track(s) in user sessions. We find that recency and frequency of prior exposure to tracks is an effective predictor of relistening behavior. Besides, considering the co-occurrence of tracks and familiarity with tracks further improves performance in terms of R-precision. We hope that our work inspires future research on the merits of considering cognitive aspects of memory retrieval to model and predict complex user behavior.
Full text in ACM Digital Library
|
- LBRTransfer Learning in Collaborative Recommendation for Bias Reduction
by Zinan Lin (Shenzhen University, China), Dugang Liu (Shenzhen University, China), Weike Pan (Shenzhen University, China), and Zhong Ming (Shenzhen University, China)
In a recommender system, a user’s interaction is often biased by the items’ displaying positions and popularity, as well as the user’s self-selection. Most existing recommendation models are built using such a biased user-system interaction data. In this paper, we first additionally introduce a specially collected unbiased data and then propose a novel transfer learning solution, i.e., transfer via joint reconstruction (TJR), to achieve knowledge transfer and sharing between the biased data and unbiased data. Specifically, in our TJR, we refine the prediction via the latent features containing bias information in order to obtain a more accurate and unbiased prediction. Moreover, we integrate the two data by reconstructing their interaction in a joint learning manner. We then adopt three representative methods as the backbone models of our TJR and conduct extensive empirical studies on two public datasets, showcasing the effectiveness of our transfer learning solution over some very competitive baselines.
Full text in ACM Digital Library
|
- LBRGlobal-Local Item Embedding for Temporal Set Prediction
by Seungjae Jung (Naver R&D Center and NAVER CLOVA, Korea, Republic of), Young-Jin Park (Naver R&D Center and NAVER CLOVA, Korea, Republic of), Jisu Jeong (NAVER CLOVA and NAVER AI LAB, Korea, Republic of), Kyung-Min Kim (NAVER CLOVA and NAVER AI LAB, Korea, Republic of), Hiun Kim (NAVER CLOVA, Korea, Republic of), Minkyu Kim (NAVER CLOVA, Korea, Republic of), and Hanock Kwak (NAVER CLOVA, Korea, Republic of)
Temporal set prediction is becoming increasingly important as many companies employ recommender systems in their online businesses, e.g., personalized purchase prediction of shopping baskets. While most previous techniques have focused on leveraging a user’s history, the study of combining it with others’ histories remains untapped potential. This paper proposes Global-Local Item Embedding (GLOIE) that learns to utilize the temporal properties of sets across whole users as well as within a user by coining the names as global and local information to distinguish the two temporal patterns. GLOIE uses Variational Autoencoder (VAE) and dynamic graph-based model to capture global and local information and then applies attention to integrate resulting item embeddings. Additionally, we propose to use Tweedie output for the decoder of VAE as it can easily model zero-inflated and long-tailed distribution, which is more suitable for several real-world data distributions than Gaussian or multinomial counterparts. When evaluated on three public benchmarks, our algorithm consistently outperforms previous state-of-the-art methods in most ranking metrics.
Full text in ACM Digital Library
|
|
- DSArgument-based generation and explanation of recommendations
by Andrés Segura-Tinoco (Departamento de Ingeniería Informática Universidad Autónoma de Madrid, Spain)
In the recommender systems literature, it has been shown that, in addition to improving system effectiveness, explaining recommendations may increase user satisfaction, trust, persuasion and loyalty. In general, explanations focus on the filtering algorithms or the users and items involved in the generation of recommendations. However, on certain domains that are rich on user-generated textual content, it would be valuable to provide justifications of recommendations according to arguments that are explicit, underlying or related with the data used by the systems, e.g., the reasons for customers’ opinions in reviews of e-commerce sites, and the requests and claims in citizens’ proposals and debates of e-participation platforms. In this context, there is a need and challenging task to automatically extract and exploit the arguments given for and against evaluated items. We thus advocate to focus not only on user preferences and item features, but also on associated arguments. In other words, we propose to not only consider what is said about items, but also why it is said. Hence, arguments would not only be part of the recommendation explanations, but could also be used by the recommendation algorithms themselves. To this end, in this thesis, we propose to use argument mining techniques and tools that allow retrieving and relating argumentative information from textual content, and investigate recommendation methods that exploit that information before, during and after their filtering processes.
Full text in ACM Digital Library
|
- INRecommender Systems for Personalized User Experience: Lessons learned at Booking.com
by Ioannis Kangas (Booking.com, Netherlands), Maud Schwoerer (Booking.com, Netherlands), and Lucas J Bernardi (Booking.com, Netherlands)
Booking.com is the world’s leading online travel platform where users make many decisions supported by our recommendations, such as destinations, travel dates, facilities, etc. This leads to a complex User Interface (UI) containing many widgets of different relevance for different users. We address the problem of constructing an optimal UI, a non-trivial problem, mainly due to user preferences evolving over time and multiple independent teams collaboratively building the UI. Our goal is to provide a personalized User Experience (UX) which adapts to changes in the environment and ensures governable, collaborative product development. The solution relies on a Multi Armed Bandits (MAB) framework currently allowing product teams to collaborate on the construction of UIs and serving millions of users every day. We present examples of our solution and lessons learned during their implementation.
Full text in ACM Digital Library
|
|
|
- LBRAn Interpretable Recommendation Model for Gerontological Care
by Andre Paulino de Lima (University of São Paulo, Brazil), Laurentino Augusto Dantas (University of São Paulo, Brazil), Marcelo Garcia Manzato (University of São Paulo, Brazil), Maria Pimentel (University of São Paulo, Brazil), Brunela Orlandi (Federal University of Western of Bahia (UFOB), Brazil), and Paula Castro (Federal University of São Carlos (UFSCar), Brazil)
Recommender systems have been successfully applied to diverse areas, but their use in the healthcare domain is still rare. One challenge of applying recommender systems to this domain is related to legal concerns about the consequences of provided recommendations. In this work, we advance an expert-in-the-loop, explanation-first approach to tackle this challenge in a specific healthcare niche: gerontological care. A key aspect of the proposed approach is that both recommendations and explanations reflect the structured questionnaire employed by the practitioner to identify patient needs. Another key aspect is that a clinical dataset of patient assessments and respective assigned interventions is used to estimate effects of alternative interventions during the recommendation process. To evaluate the feasibility of this modelling approach, an explanation style was designed with help of practitioners, and a recommendation model was devised and evaluated against a clinical dataset, which was collected by a partner research group working on gerontological primary care. When compared to other traditional recommendation models, the attained precision was competitive across several evaluation conditions. The results suggest that the proposed approach is feasible and may point new ways of adapting recommender systems to play an assistive role in health care.
Full text in ACM Digital Library
|