Abstract
Classic Collaborative Filtering (CF) algorithms rely on the assumption that data are static and we usually disregard the temporal effects in natural user-generated data. These temporal effects include user preference drifts and shifts, seasonal effects, inclusion of new users, and items entering the systemand old ones leavinguser and item activity rate fluctuations and other similar time-related phenomena. These phenomena continuously change the underlying relations between users and items that recommendation algorithms essentially try to capture. In the past few years, a new generation of CF algorithms has emerged, using the time dimension as a key factor to improve recommendation models. In this overview, we present a comprehensive analysis of these algorithms and identify important challenges to be faced in the near future.(C) 2015 John Wiley & Sons, Ltd.

Abstract
We describe GPU implementations of the matrix recommender algorithms CCD++ and ALS. We compare the processing time and predictive ability of the GPU implementations with existing multi- core versions of the same algorithms. Results on the GPU are better than the results of the multi- core versions (maximum speedup of 14.8).

Abstract
Temporal information retrieval has been a topic of great interest in recent years. Its purpose is to improve the effectiveness of information retrieval methods by exploiting temporal information in documents and queries. In this article, we present a survey of the existing literature on temporal information retrieval. In addition to giving an overview of the field, we categorize the relevant research, describe the main contributions, and compare different approaches. We organize existing research to provide a coherent view, discuss several open issues, and point out some possible future research directions in this area. Despite significant advances, the area lacks a systematic arrangement of prior efforts and an overview of state-of-the-art approaches. Moreover, an effective end-to-end temporal retrieval system that exploits temporal information to improve the quality of the presented results remains undeveloped.

Abstract

Abstract

Abstract
Planning strategies play an important role in companies' management. In the decision-making process, one of the main important goals is sales forecasting. They are important for stocks planing, shop space maintenance, promotions, etc. Sales forecasting use historical data to make reliable projections for the future. In the retail sector, data has a hierarchical structure. Products are organized in hierarchical groups that reflect the business structure. In this work we present a case study, using real data, from a Portuguese leader retail company. We experimentally evaluate standard approaches for sales forecasting and compare against models that explore the hierarchical structure of the products. Moreover, we evaluate different methods to combine predictions for the different hierarchical levels. The results show that exploiting the hierarchical structure present in the data systematically reduces the error of the forecasts.