A personalized and context-aware news offer for mobile devices

For classical domains, such as movies, recommender systems have proven their usefulness. But recommending news is more challenging due to the short life span of news content and the demand for up-to-date recommendations. This paper presents a news recommendation service with a content-based algorithm that uses features of a search engine for content processing and indexing, and a collaborative filtering algorithm for serendipity. The extension towards a context-aware algorithm is made to assess the information value of context in a mobile environment through a user study. Analyzing interaction behavior and feedback of users on three recommendation approaches shows that interaction with the content is crucial input for user modeling. Context-aware recommendations using time and device type as context data outperform traditional recommendations with an accuracy gain dependent on the contextual situation. These findings demonstrate that the user experience of news services can be improved by a personalized context-aware news offer

Synthetic sequence generator for recommender systems - memory biased random walk on sequence multilayer network

Personalized recommender systems rely on each user's personal usage data in the system, in order to assist in decision making. However, privacy policies protecting users' rights prevent these highly personal data from being publicly available to a wider researcher audience. In this work, we propose a memory biased random walk model on multilayer sequence network, as a generator of synthetic sequential data for recommender systems. We demonstrate the applicability of the synthetic data in training recommender system models for cases when privacy policies restrict clickstream publishing.Comment: The new updated version of the pape

Context-aware user modeling strategies for journey plan recommendation

Popular journey planning systems, like Google Maps or Yahoo! Maps, usually ignore user’s preferences and context. This paper shows how we applied context-aware recommendation technologies in an existing journey planning mobile application to provide personalized and context-dependent recommendations to users. We describe two different strategies for context-aware user modeling in the journey planning domain. We present an extensive performance comparison of the proposed strategies by conducting a user-centric study in addition to a traditional offline evaluation methodPeer ReviewedPostprint (published version

The Semantics of Movie Metadata: Enhancing User Profiling for Hybrid Recommendation

In movie/TV collaborative recommendation approaches, ratings users gave to already visited content are often used as the only input to build profiles. However, users might have rated equally the same movie but due to different reasons: either because of its genre, the crew or the director. In such cases, this rating is insufficient to represent in detail users’ preferences and it is wrong to conclude that they share similar tastes. The work presented in this paper tries to solve this ambiguity by exploiting hidden semantics in metadata elements. The influence of each of the standard description elements (actors, directors and genre) in representing user’s preferences is analyzed. Simulations were conducted using Movielens and Netflix datasets and different evaluation metrics were considered. The results demonstrate that the implemented approach yields significant advantages both in terms of improving performance, as well as in dealing with common limitations of standard collaborative algorithm.info:eu-repo/semantics/publishedVersio

On the Complexity of Query Result Diversification

Query result diversification is a bi-criteria optimization problem for ranking query results. Given a database D, a query Q and a positive integer k, it is to find a set of k tuples from Q(D) such that the tuples are as relevant as possible to the query, and at the same time, as diverse as possible to each other. Subsets of Q(D) are ranked by an objective function defined in terms of relevance and diversity. Query result diversification has found a variety of applications in databases, information retrieval and operations research. This paper studies the complexity of result diversification for relational queries. We identify three problems in connection with query result diversification, to determine whether there exists a set of k tuples that is ranked above a bound with respect to relevance and diversity, to assess the rank of a given k-element set, and to count how many k-element sets are ranked above a given bound. We study these problems for a variety of query languages and for three objective functions. We establish the upper and lower bounds of these problems, all matching, for both combined complexity and data complexity. We also investigate several special settings of these problems, identifying tractable cases. 1

Heterogeneity, quality, and reputation in an adaptive recommendation model

Recommender systems help people cope with the problem of information overload. A recently proposed adaptive news recommender model [Medo et al., 2009] is based on epidemic-like spreading of news in a social network. By means of agent-based simulations we study a "good get richer" feature of the model and determine which attributes are necessary for a user to play a leading role in the network. We further investigate the filtering efficiency of the model as well as its robustness against malicious and spamming behaviour. We show that incorporating user reputation in the recommendation process can substantially improve the outcome

Context-Aware Multi-criteria Recommendation Based on Spectral Graph Partitioning

Both multi-criteria recommendation and context-aware recommendation are well addressed in previous research but separately in most of existing work. In this paper, we aim to contribute to the under-explored research problem which consists in tailoring the multi-criteria rating predictions to users involved in specific contexts. We investigate the application of simultaneous clustering based on the application of a spectral partitioning graph method over situational contexts in the one hand and criteria in the other hand. Besides, we conjecture that even with similar criteria-related ratings, the importance of criteria might differ among users. This idea leads us to use prioritized aggregation operators as means of multi-criteria rating aggregations. Our experimental results on a real-world dataset show the effectiveness of our approach

Semantic contextualisation of social tag-based profiles and item recommendations

Proceedigns of 12th International Conference, EC-Web 2011, Toulouse, France, August 30 - September 1, 2011.The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-23014-1_9We present an approach that efficiently identifies the semantic meanings and contexts of social tags within a particular folksonomy, and exploits them to build contextualised tag-based user and item profiles. We apply our approach to a dataset obtained from Delicious social bookmarking system, and evaluate it through two experiments: a user study consisting of manual judgements of tag disambiguation and contextualisation cases, and an offline study measuring the performance of several tag-powered item recommendation algorithms by using contextualised profiles. The results obtained show that our approach is able to accurately determine the actual semantic meanings and contexts of tag annotations, and allow item recommenders to achieve better precision and recall on their predictions.This work was supported by the Spanish Ministry of Science and Innovation (TIN2008-06566-C04-02), and the Community of Madrid (CCG10- UAM/TIC-5877