Local Popularity and Time in top-N Recommendation

Items popularity is a strong signal in recommendation algorithms. It strongly affects collaborative filtering approaches and it has been proven to be a very good baseline in terms of results accuracy. Even though we miss an actual personalization, global popularity can be effectively used to recommend items to users. In this paper we introduce the idea of a time-aware personalized popularity in recommender systems by considering both items popularity among neighbors and how it changes over time. An experimental evaluation shows a highly competitive behavior of the proposed approach, compared to state of the art model-based collaborative approaches, in terms of results accuracy.Comment: ECIR short paper, 7 page

How to Perform Reproducible Experiments in the ELLIOT Recommendation Framework: Data Processing, Model Selection, and Performance Evaluation

Recommender Systems have shown to be an efective way to alleviate the over-choice problem and provide accurate and tailored recommendations. However, the impressive number of proposed recommendation algorithms, splitting strategies, evaluation protocols, metrics, and tasks, has made rigorous experimental evaluation particularly challenging. ELLIOT is a comprehensive recommendation framework that aims to run and reproduce an entire experimental pipeline by processing a simple confguration fle. The framework loads, flters, and splits the data considering a vast set of strategies. Then, it optimizes hyperparameters for several recommendation algorithms, selects the best models, compares them with the baselines, computes metrics spanning from accuracy to beyond-accuracy, bias, and fairness, and conducts statistical analysis. The aim is to provide researchers a tool to ease all the experimental evaluation phases (and make them reproducible), from data reading to results collection. ELLIOT is freely available on GitHub at https://github.com/sisinflab/ellio

Applying reranking strategies to route recommendation using sequence-aware evaluation

Venue recommendation approaches have become particularly useful nowadays due to the increasing number of users registered in location-based social networks (LBSNs), applications where it is possible to share the venues someone has visited and establish connections with other users in the system. Besides, the venue recommendation problem has certain characteristics that differ from traditional recommendation, and it can also benefit from other contextual aspects to not only recommend independent venues, but complete routes or venue sequences of related locations. Hence, in this paper, we investigate the problem of route recommendation under the perspective of generating a sequence of meaningful locations for the users, by analyzing both their personal interests and the intrinsic relationships between the venues. We divide this problem into three stages, proposing general solutions to each case: First, we state a general methodology to derive user routes from LBSNs datasets that can be applied in as many scenarios as possible; second, we define a reranking framework that generate sequences of items from recommendation lists using different techniques; and third, we propose an evaluation metric that captures both accuracy and sequentiality at the same time. We report our experiments on several LBSNs datasets and by means of different recommendation quality metrics and algorithms. As a result, we have found that classical recommender systems are comparable to specifically tailored algorithms for this task, although exploiting the temporal dimension, in general, helps on improving the performance of these techniques; additionally, the proposed reranking strategies show promising results in terms of finding a trade-off between relevance, sequentiality, and distance, essential dimensions in both venue and route recommendation tasksThis work has been funded by the Ministerio de Ciencia, Innovación y Universidades (reference: TIN2016-80630-P) and by the European Social Fund (ESF), within the 2017 call for predoctoral contract

On the discriminative power of Hyper-parameters in Cross-Validation and how to choose them

Hyper-parameters tuning is a crucial task to make a model perform at its best. However, despite the well-established methodologies, some aspects of the tuning remain unexplored. As an example, it may affect not just accuracy but also novelty as well as it may depend on the adopted dataset. Moreover, sometimes it could be sufficient to concentrate on a single parameter only (or a few of them) instead of their overall set. In this paper we report on our investigation on hyper-parameters tuning by performing an extensive 10-Folds Cross-Validation on MovieLens and Amazon Movies for three well-known baselines: User-kNN, Item-kNN, BPR-MF. We adopted a grid search strategy considering approximately 15 values for each parameter, and we then evaluated each combination of parameters in terms of accuracy and novelty. We investigated the discriminative power of nDCG, Precision, Recall, MRR, EFD, EPC, and, finally, we analyzed the role of parameters on model evaluation for Cross-Validation.Comment: 5 pages RecSys 201

Recommender system performance evaluation and prediction: information retrieval perspective

Tesis doctoral inédita. Universidad Autónoma de Madrid, Escuela Politécnica Superior, octubre de 201

Exploiting dynamic changes from latent features to improve recommendation using temporal matrix factorization

Recommending sustainable products to the target users in a timely manner is the key drive for consumer purchases in online stores and served as the most effective means of user engagement in online services. In recent times, recommender systems are incorporated with different mechanisms, such as sliding windows or fading factors to make them adaptive to dynamic change of user preferences. Those techniques have been investigated and proved to increase recommendation accuracy despite the very volatile nature of users’ behaviors they deal with. However, the previous approaches only considered the dynamics of user preferences but ignored the dynamic change of item properties. In this paper, we present a novel Temporal Matrix Factorization method that can capture not only the common users’ behaviours and important item properties but also the change of users’ interests and the change of item properties that occur over time. Experimental results on a various real-world datasets show that our model significantly outperforms all the baseline methods

Building Up Recommender Systems By Deep Learning For Cognitive Services

Cognitive services provide artificial intelligence (AI) technology for application developers, who are not required to be experts on machine learning. Cognitive services are presented as an integrated service platform where end users bring abilities such as seeing, hearing, speaking, searching, user profiling, etc. to their own applications under development via simple API calls. As one of the above abilities, recommender systems serve as an indispensable building brick, especially when it comes to the information retrieval functionality in the cognitive service platform. This thesis focuses on the novel recommendation algorithms that are able to improve on recommendation quality measured by accuracy metrics, e.g., precision and recall, with advanced deep learning techniques. Recent deep learning-based recommendation models have been proved to have state-ofthe-art recommendation quality in a host of recommendation scenarios, such as rating prediction tasks, top-N ranking tasks, sequential recommendation, etc. Many of them only leverage the existing information acquired from users’ past behaviours to model them and make one or a set of predictions on the users’ next choice. Such information is normally sparse so that an accurate user behaviour model is often difficult to obtain even with deep learning. To overcome this issue, we invent various adversarial techniques and apply them to deep learning recommendation models in different scenarios. Some of these techniques involve generative models to address data sparsity and some improve user behaviour modelling by introducing an adversarial opponent in model training. We empirically show the effectiveness of our novel techniques and the enhancement achieved over existing models via thorough experiments and ablation studies on widely adopted recommendation datasets. The contributions in this thesis are as follows: 1. Propose the adversarial collaborative auto-encoder model for top-N recommendation; 2. Propose a novel deep domain adaptation cross-domain recommendation model for rating prediction tasks via transfer learning; 3. Propose a novel adversarial noise layer for convolutional neural networks and a convolutional generative adversarial model for top-N recommendation

Recommending on graphs: a comprehensive review from a data perspective

Recent advances in graph-based learning approaches have demonstrated their effectiveness in modelling users' preferences and items' characteristics for Recommender Systems (RSS). Most of the data in RSS can be organized into graphs where various objects (e.g., users, items, and attributes) are explicitly or implicitly connected and influence each other via various relations. Such a graph-based organization brings benefits to exploiting potential properties in graph learning (e.g., random walk and network embedding) techniques to enrich the representations of the user and item nodes, which is an essential factor for successful recommendations. In this paper, we provide a comprehensive survey of Graph Learning-based Recommender Systems (GLRSs). Specifically, we start from a data-driven perspective to systematically categorize various graphs in GLRSs and analyze their characteristics. Then, we discuss the state-of-the-art frameworks with a focus on the graph learning module and how they address practical recommendation challenges such as scalability, fairness, diversity, explainability and so on. Finally, we share some potential research directions in this rapidly growing area.Comment: Accepted by UMUA

WiFi-Based Human Activity Recognition Using Attention-Based BiLSTM

Recently, significant efforts have been made to explore human activity recognition (HAR) techniques that use information gathered by existing indoor wireless infrastructures through WiFi signals without demanding the monitored subject to carry a dedicated device. The key intuition is that different activities introduce different multi-paths in WiFi signals and generate different patterns in the time series of channel state information (CSI). In this paper, we propose and evaluate a full pipeline for a CSI-based human activity recognition framework for 12 activities in three different spatial environments using two deep learning models: ABiLSTM and CNN-ABiLSTM. Evaluation experiments have demonstrated that the proposed models outperform state-of-the-art models. Also, the experiments show that the proposed models can be applied to other environments with different configurations, albeit with some caveats. The proposed ABiLSTM model achieves an overall accuracy of 94.03%, 91.96%, and 92.59% across the 3 target environments. While the proposed CNN-ABiLSTM model reaches an accuracy of 98.54%, 94.25% and 95.09% across those same environments