Building user profiles based on sequences for content and collaborative filtering. Issue 1 (January 2019)

• Record Type: Journal Article
• Authors: Sánchez, Pablo; Bellogín, Alejandro
• Is Part Of: Information processing & management. Volume 56:Issue 1(2019:Jan.)
• Page Start: 192
• Page End: 211
• Publication Date: 2019-01
• Subjects: Hybrid recommender systems -- Preference filtering -- Content-based filtering -- Collaborative filtering -- Longest Common Subsequence; Information storage and retrieval systems -- Periodicals; Information science -- Periodicals; Systèmes d'information -- Périodiques; Sciences de l'information -- Périodiques; Information science; Information storage and retrieval systems; Periodicals; 658.4038
• DOI: 10.1016/j.ipm.2018.10.003
• Languages: English
• ISSNs: 0306-4573

Abstract

Highlights: A generic method to transform users to sequences using collaborative and content-based information. We define a user similarity metric based on LCS algorithm (extensible to any string-based comparison algorithm) than can produce competitive recommendations. Definition of various parameters (confidence, preference, normalizations, and threshold) to produce better recommendations in the LCS-based algorithm. Normalization functions help to improve accuracy without hurting diversity or novelty. Preference filtering does not decrement the performance but reduces its computational cost. Abstract: Modeling user profiles is a necessary step for most information filtering systems – such as recommender systems – to provide personalized recommendations. However, most of them work with users or items as vectors, by applying different types of mathematical operations between them and neglecting sequential or content-based information. Hence, in this paper we study how to propose an adaptive mechanism to obtain user sequences using different sources of information, allowing the generation of hybrid recommendations as a seamless, transparent technique from the system viewpoint. As a proof of concept, we develop the Longest Common Subsequence (LCS) algorithm as a similarity metric to compare the user sequences, where, in the process of adapting this algorithm to recommendation, we include different parameters to control the efficiency by reducing the information used in the algorithm ( preference filter ), to decide when a neighbor is considered useful enough to be included in the process ( confidence filter ), to identify whether two interactions are equivalent ( δ-matching threshold ), and to normalize the length of the LCS in a bounded interval ( normalization functions ). These parameters can be extended to work with any type of sequential algorithm. We evaluate our approach with several state-of-the-art recommendation algorithms using different evaluation metrics measuring the accuracy, diversity, and novelty of the recommendations, and analyze the impact of the proposed parameters. We have found that our approach offers a competitive performance, outperforming content, collaborative, and hybrid baselines, and producing positive results when either content- or rating-based information is exploited.