You are currently viewing a new version of our website. To view the old version click .
Electronics
  • Feature Paper
  • Article
  • Open Access

24 March 2022

Context Aware Recommender Systems: A Novel Approach Based on Matrix Factorization and Contextual Bias

,
,
,
,
and
1
Department of Industrial Engineering, University of Salerno, 84084 Fisciano, Italy
2
Department of Computer Science and Information Engineering, Asia University, Taichung 413, Taiwan
3
Research and Innovation Department, Skyline University College, Sharjah P.O. Box 1797, United Arab Emirates
4
School of Digital, Technologies and Arts, Staffordshire University, Stoke-on-Trent ST4 2DE, UK
This article belongs to the Special Issue Context-Aware Computing and Smart Recommender Systems in the IoT

Abstract

In the world of Big Data, a tool capable of filtering data and providing choice support is crucial. Recommender Systems have this aim. These have evolved further through the use of information that would improve the ability to suggest. Among the possible exploited information, the context is widely used in literature and leads to the definition of the Context-Aware Recommender System. This paper proposes a Context-Aware Recommender System based on the concept of embedded context. This technique has been tested on different datasets to evaluate its accuracy. In particular, the use of multiple datasets allows a deep analysis of the advantages and disadvantages of the proposed approach. The numerical results obtained are promising.

1. Introduction

The Internet of Things (IoT) [1,2,3,4] allows the digitalization of the daily experience and the collection of an enormous number of data that involves the Big Data management problem. The Big Data [5] term denotes a structured or not growing data set selected through complex algorithms [6]. The main features of Big Data are volume, variety, and velocity [7]. Data mining techniques can acquire relevant data and deal with the Big Data problem [8]. Among all of the used tools, the data mining field widely exploits Recommender Systems (RSs) [9].
RSs can analyze and filter information to provide support to the user in the selection phase [10,11]. RSs work on three main elements: system users, items to suggest, and transactions, interactions between users and the systems. Among the various transaction forms, rating or utility function [10] plays a central role and represents a user evaluation about an item that the system can suggest. Formally, the rating is a function that has as domain the Cartesian product of the users set U, and the items set I, and has as a codomain the real numbers set R .
r   :   u , i     U × I r ^ u i = r u , i     R
The Recommender Systems’ [12,13] principal utility is the prevision of items to suggest to individual users that users do not interact with, or rather the images of couples u , i     U × I that the system ignores. The techniques used to provide these forecasts classify Recommender Systems.
Content-based RSs [14,15,16] aim to create profiles (features vectors) that represent system entities (user, item). Profiles allow the calculation of the affinity between a user and an item of the system, for instance, through the cosine similarity [17,18].
Collaborative Filtering RSs [19,20,21] are recommendation methods based on the knowledge of ratings provided by users. Known ratings are collected in a matrix R R m × n , where the value m represents the number of users and the value n consists in a number of items. Collaborative techniques are divided into two groups: Memory-Based and Model-Based. Memory-Based Collaborative Filtering RSs [22] generate rating forecasts through the creation of Neighborhoods [23] that are groups of users (User-Based) [22] or of items (Item-Based) [24]. Model-Based Collaborative Filtering RSs [25,26] aim to build a mathematical model of the problem through the use of factorization techniques on the rating matrix R [27,28,29].
Hybrid Recommender Systems [30,31,32] exploit multiple recommendation techniques to generate more reliable rating forecasts. Moreover, they aim to overcome singular methodologies limits as, for instance, cold start [33,34], scalability [34,35,36], and sparsity [34,36,37].
Many methods aim to improve Recommender Systems performance. These methods exploit machine learning [38] and deep learning [39] techniques, ontologies [40], and context awareness [41,42] to provide more reliable rating forecasts. This paper focuses on Context-Aware Recommender Systems (CARSs) [43].
Context denotes “any information useful to characterize the situation of an entity that can affect the way users interact with systems” [44,45,46], where Recommender System entities are users and items [47]. In CARSs, contextual information involves the rating variation. For instance, an outdoor archaeological site has different ratings on rainy days to sunny ones.
Based on the information that characterizes the context, it can be divided into individual, location, time, activity, and relational context [47]. The individual concerns the entities (user, item) of the Reccomender systems, the location gives information on the physical or virtual location of an entity, the time context is based on a specific time or a time interval, activity concerns the entities tasks, and relational notifies social or functional relations among all entities. This general classification can be adapted to the application fields. For instance, in a musical application, the context classification includes features related to the device with which users interact and focuses on the achievement and the activity of users [48].
The strategies of contextual information integration into Recommender Systems are shown in Figure 1 and described in the following:
Figure 1. Summary of the contextual information introduction in the Recommendation Phase.
  • Contextual Pre-Filtering: contextual information is exploited for data filtering and, subsequently, is elaborated by the Recommender System. In Content-Based RSs, this strategy involves the creation of multiple profiles based on the contexts related to each user and each item. The Pre-Filtering consists of the selection of the proper features vector provided in the recommendation phase. In Collaborative Filtering RSs, this strategy elaborates the ratings related to the determined contextual dimension [47,49];
  • Contextual Post-Filtering: contextual information is exploited after the recommendation phase to select the proper rating forecasts related to the context [47,49];
  • Contextual Modeling: the recommendation phase integrates contextual information to calculate contextually consistent rating forecasts. In Content-Based RSs, contextual information entails the change of the formula related to the user/item affinity calculation in the determined context. In Collaborative Filtering RSs, Heuristic-Based methods are applied in the Memory-Based RSs, and tensor factorization and properly integrated matrix factorization techniques are exploited in Model-Based RSs [47,49,50].
This paper aims to introduce a novel Contextual Modeling recommendation method that exploits matrix factorization and contextual biases. The proposed approach evaluates context as tensor representation does, then all contexts are considered as ordered tuples and not individually. We define this context representation as embedded context that aims to consider all the contextual information simultaneously. For instance, a user can watch a movie ‘alone’ and ‘at home’, as shown in Figure 2. In this case, the individual evaluation of the companion context value alone can take into account all the values of location context and not only the value ‘at home’; likewise, the singular evaluation of the location context ‘at home’ evaluates all possible values of the companion context and not only the value ‘alone’. Instead, the embedded context allows elaborating the location and companion contexts only for the proper values.
Figure 2. Summary of the embedded context idea based on the example provided.
The paper structure is as follows: Section 2 focuses on the Context-Aware Recommender Systems literature, Section 3 aims to describe the proposed approach defined Contextual Bias Matrix Factorization (CBMF) and deeply describes the embedded context, in Section 4 numerical results related to the method accuracy are discussed, and finally, Section 5 contains conclusions and future works.

3. CBMF: Contextual Bias Matrix Factorization

Classical Recommender Systems that do not consider context exploit the rating matrix R described in relation (4) to represent known ratings. The rating matrix has two dimensions related to the cardinality of the users set U, and the items set I.
R = r u i u     U , i     I R m × n m = U n = I
The rating matrix R element r u i is related to user u and the item i and non zero if it is known otherwise r u i is usually equal to 0.
In the Context-Aware Recommender Systems field, the rating matrix R two-dimensionality is not enough to represent known ratings. Then, the tensor R described in relation (5) allows the rating representation in the CARS case.
R = r u i c 1 c k u U , i I , c 1 C 1 , , c k C k R m × n × w 1 × × w k
m   =   U , n   =   I , w j   =   C j j   =   1 , , k
The tensor dimensions are related to the cardinality of the users set U, the items set I, and the cardinality of contexts sets C 1 , , C k that contains the values assumed by the relative context. The tensor element r u i c 1 c k expresses the rating of the user u about the item i in the contextual information c 1 C 1 , , c k C k and is non-zero if it is known, otherwise r u i c 1 c k is usually equal to 0.
The tensor R allows the collection of the rating in the exact contextual scope represented by all values assumed by each context C 1 , , C k . This tensorial representation of the context is the basis of the embedded context concept exploited by the proposed approach Contextual Bias Matrix Factorization (CBMF).
Due to the high computation cost and the great quantity of memory requested by tensor decompositions, CBMF exploits matrix factorization and contextual bias based on the embedded context that considers the context in all values assumed by each context simultaneously.
To clarify the embedded context concept, Table 3 introduces the embedded context based on Table 1 contextual information and allows to understand how CBMF differs from other recommendation methods, for instance, User-Item-Splitting represented in Table 2 and CAMF-CI shown in relation (3).
Table 3. List of Embedded Contexts based on contextual information of Table 1.
From the provided example, the evaluation of the embedded context, related to the tensorial representation of the context, is the same as the evaluation of one context composed by the tuple composed by all values assumed by each context dimension. Then, in the example related to Table 3, the three dimensions tensor in which the context takes on four embedded context values instead of a tensor of dimension four.
To improve the comprehension of the embedded context concept, the example related to Figure 2 can explore it. The tensor related to the particular case has four dimensions as in relation (7). The first dimension is related to the number of system users, the second to the number of system items, and the third and the fourth concern the number of contexts values.
R ¯ = R ¯ u i c 1 c 2     R m × n × 2 × 2 m   =   U n   =   I
The embedded context allows the definition of a new three-dimensional tensor R ˜ , defined in relation (8), where the unique contextual dimension contains all the combinations of contextual information related to the two contexts of the example. Indeed, Table 3 describes the values of the embedded context.
R ˜ = R ˜ u i c     R m × n × 4
In particular, if the system makes recommendations based on only the companion context ‘alone’, it will calculate the mean of location context values. Indeed, in the rating forecast related to ‘home’, contextual information considers a mean of all values contained in the tensor R ¯ for location context, as in relation (9).
R ^ u , i , a l o n e = 1 2 R ¯ u , i , a l o n e , h o m e + R ¯ u , i , a l o n e , c i n e m a
The same reasoning applies if the system calculates rating forecasts based on ‘home’ value for location context. The embedded context evaluates the relationships between the location and companion contexts in the contextual information evaluated. This approach allows the systems not to lose the effects of contexts combination on rating forecasts. The presence of more contextual values for the unconsidered context implies the mean on more values than the particular case taken into account. Table 4 summarizes the typologies of rating forecasts calculation based on the evaluated contextual information.
Table 4. Summary of the typologies of rating forecasts based on evaluated contextual information.
This introductory example aims to underline that the objective of the proposed approach consists of evaluating all the contextual information to avoid losing information related to context.
Let be the system user u, the item i, and the contextual information c related to the embedded context. Contextual Bias Matrix Factorization method elaborates the rating forecasts through relation (10).
r ^ u i c = r ¯ c + b u c + b i c + p u · q i
The parameter r ¯ c is the mean related to all available ratings of all users and items in the embedded context c; b u c is the contextual bias of user in the embedded context c; b i c is the contextual bias related to the item i in the embedded context c; and p u · q i expresses the user/item affinity.
The main feature of the proposed approach is the introduction of the context into the mean r ¯ c and the biases b u c and b i c . Moreover, the principal difference between the proposed approach and the other methods consists of the context evaluation. Instead of considering a contextualized bias related to a single context, the proposed approach aims to consider the combination of all contexts to avoid losing the contextual information specificity. Moreover, the context introduction into users and items bias allows us to avoid the employment of tensor factorizations. Moreover the bias employment can improve the serendipity of the proposed approach [68].
The application of the CBMF method implies the calculation of the needed parameters. For instance, in the example related to the context information of Table 1, the method needs to calculate the parameter shown by Table 5.
Table 5. Parameters required to obtain the ratings forecasts based on the CBMF method related to Table 3 embedded contexts.
The current Section has introduced the embedded context concept and how the CBMF method calculates rating forecasts. The coming section provides the numerical experiments aimed to evaluate the accuracy of the proposed approach.

4. Numerical Results

The focus of this section is the introduction of the numerical experiments related to Contextual Bias Matrix Factorization (CBMF). Four subsections compose the current section: the first subsection aims to present the accuracy measures, the second subsection introduces the exploited datasets, the third subsection presents the limitations of the proposed approach related to the lack of contextual information, and, finally, the fourth subsection shows the domain in which CBMF works best.
The CBMF method exploits the Singular Value Decomposition [69] to calculate the user/item affinity through the algorithm Bias Stochastic Gradient Descent (BSGD) [70]. The parameter related to the BSGD algorithm are experimentally setted and assumed the values:
  • five latent factors;
  • 0.001 learning rate;
  • λ = 0.005 ;
  • 20 interactions.
Moreover, the dataset allows the calculation of contextual biases b u c e b i c related to relation (10). If the biases are zero elements after the training phase, they assume the mean value showed by relations (11) and (12).
i I   if   b i c = 0 then   b i c n e w = 1 { b l c : b l c 0 , l I } s I b s c
u U   if   b u c = 0 then   b u c n e w = 1 { b z c : b z c 0 , z U } s U b s c
Then, if there are not known ratings in a specific embedded context c related to an item i, the embedded context bias considers the mean of the biases for all items. Likewise, if there are not known ratings for the calculation of the embedded context bias related to the user u, it assumes a value equal to the mean of the known bias of all users in the specific embedded context. Finally, to make the numerical results more reliable, the experimental phase exploits the Cross-Validation k-Fold [71] method with the division of the dataset into five parts.

4.1. Accuracy Evaluation Metrics

The experimental phase exploits two accuracy metrics: the Mean Absolute Error (MAE) and the Root Mean Square Error (RMSE) [72,73,74].
Let be D the dataset expressed by relation (13) that contains the available ratings related to k contextual dimensions, and let be R ^ u i c 1 , , c k the rating forecasts provided by the CBMF method. The MAE is calculated through relation (14) and the RMSE is calculated through relation (15).
D = { u , i , c 1 , , c k     U × I × C 1 , × × C k : R u i c 1 , , c k }
MAE = 1 | D | u , i , c 1 , , c k D | R u i c 1 , , c k R ^ u i c 1 , , c k |
RMSE = 1 | D | u , i , c 1 , , c k D R u i c 1 , , c k R ^ u i c 1 , , c k 2

4.2. Datasets

This Subsection focuses on the description of the exploited datasets. The evaluated datasets are DePaulMovie, LDOS-CoMoDa, InCarMusic, and Travel-STS.
  • De Paul Movie Dataset [49,75,76] is a movies dataset composed of:
    5043 ratings divided into:
    1448 ratings without a specific context;
    3595 contextual ratings.
    3 contextual dimensions:
    • Location: Home, Cinema;
    • Companions: Alone, Family, Friends;
    • Time: Weekend, Weekday.
  • LDOS-CoMoDa [49,77] is a movies dataset composed of:
    2296 ratings related to 121 users an 1232 movies divided into:
    44 ratings without a specific context;
    2252 contextual ratings.
    12 contextual dimensions:
    • Time (4): Morning, Afternoon, Evening, Night;
    • Daytype (4): Working day, Weekend, Holiday;
    • Season (4): Spring, Summer, Autumn, Winter;
    • Location (3): Home, Public place, Friend’s house
    • Weather (5): Sunny, Rainy, Stormy, Snowy, Cloudy;
    • Social (7): Alone, My partner, Friends, Colleagues, Parents, Public, My family;
    • Emotion (7): Sad, Happy, Scared, Surprised, Angry, Disgusted, Neutral;
    • Dominant Emotion (7): Sad, Happy, Scared, Surprised, Angry, Disgusted, Neutral;
    • Mood (3): Positive, Neutral, Negative;
    • Physical (2): Healthy, Ill;
    • Decision (2): User decided which movie to watch, User was given a movie;
    • Interaction (2): first interaction, n-th interaction.
  • InCarMusic [49,76,78] is a music dataset composed of:
    4012 ratings related to 42 users and 139 items divided into:
    1003 ratings without a specific context;
    3009 contextual ratings.
    8 contextual dimensions:
    • Driving style (2): Relaxed driving, sport driving;
    • Landscape (4): Coast line, Country side, Mountains, Urban;
    • Mood (4): Active, Happy, Lazy, Sad;
    • Natural phenomena (4): Afternoon, Day time, Morning, Night;
    • Road type (3): City, Highway, Serpentine;
    • Sleepiness (2): Awake, Sleepy;
    • Traffic conditions (3): Free road, Lots of cars, Traffic jam;
    • Weather (4): Cloudy, Rainy, Snowing, Sunny.
  • Travel-STS [49,76,79] is a dataset composed of:
    2534 ratings related to 325 users and 249 items divided into:
    1146 ratings without a specific context;
    1388 contextual ratings.
    14 contextual dimensions:
    • Distance (2): Far away, Near by;
    • Time available (3): Half day, One day, More than one day;
    • Temperature (6): Burning, Hot, Warm, Cool, Cold, Freezing;
    • Crowdedness (3): Crowded, Not crowded, Empty;
    • Knowledge of surroundings (3): New to area, Returning visitor, Citizen of the area;
    • Season (4): Spring, Summer, Autumn, Winter;
    • Budget (3): Budget traveler, Price for quality, High spender;
    • Daytime (5): Morning, Noon, Afternoon, Evening, Night;
    • Weather (6): Clear sky, Sunny, Cloudy, Rainy, Thunderstorm, Snowing;
    • Companion (5): Alone, Friends, Family, Partner, Children;
    • Mood (4): Happy, Sad, Active, Lazy;
    • Daytype (2): Weekday, Weekend;
    • Travel goal (9): Visiting friends, Business, Religion, Health care, Social event, Education, Landscape, Hedonistic, Sport;
    • Means of transport (4): No transportation means, Bicycle, Car, Public transport.
The DePaulMovie dataset contains all the contextual information related to the known ratings contextual dimensions. Instead, in the LDOS-CoMoDa and Travel-STS datasets, available ratings do not present some contextual information. To overcome the problem of a lack of contextual information, the experimental results in these datasets exploit the information lack as a value. Then, lack of contextual information is one of the values that one of the components of the embedded context tuple can assume. Finally, the InCarMusic dataset contains the contextual information related to one contextual dimension for each known rating in the dataset.
The exploited tool is MatLab for the accuracy evaluation on datasets DePaulMovie, LDOS-CoMoDa, InCarMusic, and Travel-STS. The Import Data functionality of MatLab allows us to acquire files related to these datasets and convert them into numerical matrices. Then, the matrices elaboration enables calculation of the accuracy of these datasets through the Cross-Validation k-fold technique.

4.3. Limits of the Embedded Context

The provided definition of embedded context as a unique contextual dimension composed of the combination of the values that contextual dimensions assume has to deal with a problem: the contextual dimension increase implies a high increase in the possible combination that composes the embedded context.
The study on the LDOS-CoMoDa dataset allows the analysis of the proposed approach behavior on 12 contextual dimensions in the case of a lack of contextual information. This study is focused on the CBMF method accuracy on the single contexts and on a group of contexts selected based on the number of contextual information values as shown below:
  • Contextual dimensions 9-Mood (3), 10-Physical (2), 11-Decision (2), and 12-Interaction (2): contextual dimensions that contain a low number of contextual information for each node;
  • Contextual dimensions 1-Time (4), 2-Daytype (4), 3-Season (4), and 4-Location (3): contextual dimensions that have a medium number of contextual information for each node;
  • Contextual dimensions 5-Weather (5), 6-Social (7), 7-Emotion (7), and 8-Dominant Emotion (7): contextual dimensions that present a high number of contextual information for each node.
Table 6 presents the experimental results provided by the division into groups of contextual dimensions. Instead, Table 7 provides the accuracy measure results on the single contextual dimensions.
Table 6. Numerical results of the experiments tested on the LDOS-CoMoDa dataset based on the division into groups of contextual dimensions.
Table 7. Results related to single contexts of the LDOS-CoMoDa dataset.
From Table 6, numerical results return that the increase in the number of exploited contextual dimensions does not imply the accuracy measure improvement. Moreover, accuracy measure results related to Table 7 suggest that the increase in the amount of contextual information does not return a reduction in the MAE and the RMSE values. In fact, for instance, node 12 related to the context Interaction has two pieces of contextual information and obtains a better accuracy measure than the accuracy of contexts Time, Daytype, Season, Weather, and Social, which all have more contextual information.
The results from this dataset imply that the proposed approach reliability is not related to the contextual information quantity of a single contextual dimension but to the influence that contextual ratings suffer in the specific context. However, these results have to be deeply studied through other datasets that present a similar structure to LDOS-CoMoDa.
In the application field, where sensors allow collecting a large number of contextual information related to various contextual dimensions, the CBMF method needs to select the proper contextual dimensions to avoid the increase in embedded context and obtain only the contexts that affect the contextual rating variation. One of the possible tools that allows the contextual dimensions selection is the Context Dimension Tree [11] that consists of a non-oriented acyclic graph that allows context management.
From Table 6, the combination of Emotion and Dominant Emotion context dimensions returns the best accuracy, measuring results among all the considered combinations of contexts. Then, the proposed approach only exploits these contextual dimensions to the comparison with other methods. This study aimed at the contextual dimensions selection is consistent with the study of Zheng et al. [61] about the role of the emotions in Context-Aware Recommender Systems.
The comparison methods are Item-Splitting, User-Splitting, CAMF-C, CAMF-CI, and CAMF-CU, as described in Section 2. Zheng et al. [61] provide RMSE results related to the comparison methods on the LDOS-CoMoDa dataset. Table 8 presents the best results of each comparison method provided by Zheng et al. [61]. CAMF-C, CAMF-CI, and CAMF-CU return the best results on Emotion and Dominant Emotion contexts instead, using Item-Splitting and User-Splitting to analyze all contextual dimensions. CBMF is the third-best method among all methods of Table 8, despite the problems described before on the LDOS-CoMoDa dataset. The proposed approach of RMSE is worst than CAMF-CU and User-Splitting methods but is better than CAMF-C, Item-Splitting, and CAMF-CI methods.
Table 8. Numerical Results of the methods on the LDOSCoMoDa dataset.
Then, Table 9 compares the same methods with the proposed approach. In the case of unknown contextual information, the Root Mean Squared Error results return the same difficulties of the proposed approach. The methods CAMF-CI and Item-Splitting return better accuracy performance than CBMF. Instead, the proposed approach obtains a lower RMSE than the other comparison methods CAMF-C, CAMF-CU, and User-Splitting.
Table 9. Numerical Results of the methods on the Travel-STS dataset.
The results obtained from the LDOS-CoMoDa and Travel-STS datasets suggest that the proposed approach can mediate between the case in which context affects more users than items and the vice-versa. However, this assertion needs more experiments for confirmation.

4.4. Advantages of Embedded Context

After the previous subsection which has analyzed the proposed approach limits, this subsection focuses on the advantages of Contextual Bias Matrix Factorization methods through the accuracy measure study on the DePaulMovie dataset. Initially, Table 10 shows the accuracy results related to the single contextual dimensions and all combinations of the contextual dimensions as in the LDOS-CoMoDa dataset.
Table 10. Numerical Results of CBMF method on the De Paul Movie dataset.
The DePaulMovie dataset contains all the contextual information related to Location, Companions, and Time contexts for each available contextual rating, and, in this case, the increase in the evaluated context returns an accuracy measure enhancement. The experimental results on the DePaulMovie dataset suggest that the CBMF method improves the accuracy when all contextual information is available. Instead, the proposed approach accuracy worsens when there is a lack of contextual information, according to the previous analysis on the LDOS-CoMoDa dataset.
Table 11 returns the numerical results related to the MAE and the RMSE of the Contextual Bias Matrix Factorization method on DePaulMovie, LDOS-CoMoDa, Travel-STS, and InCarMusic datasets. This Table aims to summarize the results but cannot represent a comparison among datasets due to their different specifications.
Table 11. Accuracy of the CBMF methods on the datasets DePaulMovie, LDOS-CoMoDa, STS-Travel, and InCarMusic.
The accuracy measures value related to DePaulMovie confirms the proper behavior of the proposed approach when all contextual information is known, according to the results obtained into Table 10. Instead, the results provided by the method on the Travel-STS and LDOS-CoMoDa datasets return the proposed approach’s difficulties in the contextual information lack. In fact, in the case of LDOS-CoMoDa, the proposed approach is overcome by other comparison methods. Finally, on the InCarMusic dataset, the embedded context concept is not achievable due to the structure of the InCarMusic dataset because it presents only one known contextual dimension among all dataset available contexts. In fact, the accuracy results obtained from InCarMusic are inadequate.
Now Table 12 compares the CBMF method with CAMF-CI, CAMF-CU, CAMF-C, CAMF-CUCI, Item-Splitting, and User-Splitting on the DePaulMovie dataset where the proposed approach works best. The CARSKit [75] provides the MAE and the RMSE results related to comparison methods.
Table 12. Comparison between the proposed approach and other CARS techniques on De Paul Movie dataset.
Table 12 confirms that the proposed approach provides the best accuracy measures results when the CBMF method works in the best situation. The Mean Absolute Error and the Root Mean Square Error related to the Contextual Bias Matrix Factorization method are better than the accuracy values of the comparison methods.

4.5. CBMF Evaluation through the Normalized Discounted Cumulative Gain Metric

The final part of this section aims to introduce an additional test to evaluate the quality of the suggestions provided by the proposed approach. The Normalized Discounted Cumulative Gain (NDCG) [80,81] achieves this purpose and allows the evaluation of the Top-N Recommendation developed by CBMF.
To define the NDCG, the definitions of Discounted Cumulative Gain (DCG) and the Ideal Discounted Cumulative Gain (IDCG) are needed.
DCG N = p = 1 N r p log 2 p + 1
The DCG is represented in formula (16) where N is the number of the recommendation in the list provided by the proposed approach and r p consists of the relevance of the item at the position p. The IDCG represents DCG of the ideal ordering. Then, the NDCG is defined in formula (17).
NDCG N = DCG N IDCG N
Figure 3 shows the experimental results that aim to testify the quality of the suggestions. In particular, the NDCG results on DePaulMovie are 0.7643 , 0.7681 , and 0.7704 related to N = 5 , 10 , and 15, respectively. On LDOS-CoMoDa the results are 0.7079 , 0.6978 , and 0.7098 , and on Travel-STS they are 0.7145 , 0.7209 , and 0.7410 , respectively.
Figure 3. Results of the proposed approach on datasets DePaulMovie, LDOS-CoMoDa, and Travel-STS related to Normalized Discounted Cumulative Gain metric and the values N = 5 , 10 , 15 .
Table 13 presents the results obtained by the proposed approach and the comparison methods on datasets LDOS-CoMoDa and Travel-STS. The quality analysis of provided recommendation suggests that on LDOS-CoMoDa the best performance is obtained by the CAMF-CU method. Moreover, the User-Splitting and CBMF methods have similar results for the value N = 5 , but the first provides better results than CBMF for N = 10 and N = 15 values. Instead, the proposed approach results overcame those of CAMF-CI, CAMF-C, and Item-Splitting.
Table 13. Results on LDOS-CoMoDa and Travel-STS datasets related to Normalized Discounted Cumulative Gain metric and the values N = 5 , 10 , 15 .
The results of Travel-STS return that the CAMF-CI method provides the best recommendations quality. However, the result for the value N = 15 differs slightly from those of the proposed approach. Then, CBMF and Item-Splitting provide results in which CBMF overcame Item-Splitting for values N = 15 , but the NDCG coefficient of the proposed approach is lower than the Item-Splitting method for values N = 5 and N = 15 . Finally, the results of the proposed approach are better than those of the methods CAMF-CU, CAMF-C, and User-Splitting on the Travel-STS dataset.
These results confirm the difficulties of the CBMF method when there is unknown contextual information. However, the quality of the recommendation when the limits of the proposed approach arise are satisfactory.
Table 14 provides the results of the recommendation quality on the DePaulMovie dataset. In this case, the NDCG values of CBMF overcome the results of the others methods. These results confirm the accuracy results obtained in Table 12. In fact, on the DePaulMovie dataset, the proposed approach has the best results. These results suggest that the knowledge of all contextual information consists of the best application case of the proposed approach. However, this assertion should be confirmed through further studies on datasets similar to DePaulMovie.
Table 14. Results on DePaulMovie dataset related to Normalized Discounted Cumulative Gain metric and the values N = 5 , 10 , 15 .

5. Conclusions and Future Works

This paper describes the Contextual Bias Matrix Factorization method and tests it on DePaulMovie, LDOS-CoMoDa, Travel-STS, and InCarMusic datasets to determine the advantages and disadvantages of the proposed approach. In particular, in the best application case, the CBMF method returns better accuracy results than the comparison methods. Future works will focus on the evaluation of other metrics with different accuracy to evaluate other aspects of the recommendation method. Among all possible metrics, Novelty and Diversity will be tested. In particular, novel metrics that allow the evaluation of more aspects can be exploited [82]. Moreover, machine learning techniques will be exploited to calculate contextual biases. This technique should improve the deal with the scalability of the proposed approach. In particular, we will initially develop the update formulas related to Stochastic Gradient Descent for the Adaline method application in the case of regression, and then an Artificial Neural Network will be implemented. Moreover, the best structure of an Artificial Neural Network had to be studied for this recommendation method. For this purpose, we will move from MatLab to Python, developing the proposed approach through the appropriate libraries available.
Other future works concern the application of the proposed approach into a case of study for applications in the Cultural Heritage field.

Author Contributions

Conceptualization, M.L. and C.V.; methodology, M.L. and C.V.; software, D.S.; validation, D.S. and C.V.; formal analysis, C.V.; investigation, A.L.; resources, M.C.; data curation, A.L. and D.S.; writing—original draft preparation, M.L. and C.V.; writing—review and editing, M.L.; visualization, B.B.G.; supervision, M.C. and M.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

LDOS-CoMoDa dataset: https://www.lucami.org/en/research/ldos-comoda-dataset/ accessed on 17 March 2022; Travel-STS, DePaulMovie, InCarMusic: https://github.com/irecsys/CARSKit/tree/master/context-aware_data_sets accessed on 17 March 2022.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Erdeniz, S.; Menychtas, A.; Maglogiannis, I.; Felfernig, A.; Tran, T. Recommender systems for IoT enabled quantified-self applications. Evol. Syst. 2020, 11, 291–304. [Google Scholar] [CrossRef] [Green Version]
  2. Manasrah, A.; Aldomi, A.; Gupta, B. An optimized service broker routing policy based on differential evolution algorithm in fog/cloud environment. Clust. Comput. 2019, 22, 1639–1653. [Google Scholar] [CrossRef]
  3. Colace, F.; Lombardi, M.; Pascale, F.; Santaniello, D. A multi-level approach for forecasting critical events in smart cities. In Proceedings of the 24th International DMS Conference on Visualization and Visual Languages, San Francisco, CA, USA, 29–30 June 2018; pp. 31–35. [Google Scholar] [CrossRef]
  4. Bharathi, R.; Selvarani, R. Software reliability assessment of safety critical system using computational intelligence. Int. J. Softw. Sci. Comput. 2019, 11, 1–25. [Google Scholar] [CrossRef]
  5. Duan, Y.; Edwards, J.S.; Dwivedi, Y.K. Artificial intelligence for decision making in the era of Big Data–evolution, challenges and research agenda. Int. J. Inf. Manag. 2019, 48, 63–71. [Google Scholar] [CrossRef]
  6. Oussous, A.; Benjelloun, F.Z.; Lahcen, A.A.; Belfkih, S. Big Data technologies: A survey. J. King Saud Univ.-Comput. Inf. Sci. 2018, 30, 431–448. [Google Scholar] [CrossRef]
  7. Zhang, Q.; Yang, L.T.; Chen, Z.; Li, P. A survey on deep learning for big data. Inf. Fusion 2018, 42, 146–157. [Google Scholar] [CrossRef]
  8. Chen, M.S.; Han, J.; Yu, P. Data mining: An overview from a database perspective. IEEE Trans. Knowl. Data Eng. 1996, 8, 866–883. [Google Scholar] [CrossRef] [Green Version]
  9. Najafabadi, M.; Mohamed, A.; Mahrin, M. A survey on data mining techniques in recommender systems. Soft Comput. 2019, 23, 627–654. [Google Scholar] [CrossRef]
  10. Ricci, F.; Rokach, L.; Shapira, B. Recommender systems: Introduction and challenges. In Recommender Systems Handbook; Springer: Berlin/Heidelberg, Germany, 2015; pp. 1–34. [Google Scholar] [CrossRef]
  11. Casillo, M.; Conte, D.; Lombardi, M.; Santaniello, D.; Valentino, C. Recommender system for digital storytelling: A novel approach to enhance cultural heritage. In Proceedings of the International Conference on Pattern Recognition, Virtual, 10–15 January 2021; pp. 304–317. [Google Scholar] [CrossRef]
  12. George, G.; Lal, A. A personalized approach to course recommendation in higher education. Int. J. Semant. Web Inf. Syst. 2021, 17, 100–114. [Google Scholar] [CrossRef]
  13. Casillo, M.; Colace, F.; De Santo, M.; Lombardi, M.; Mosca, R.; Santaniello, D. A Recommender System for Enhancing Coastal Tourism. In Research and Innovation Forum 2020; Springer: Berlin/Heidelberg, Germany, 2021; pp. 113–122. [Google Scholar] [CrossRef]
  14. Wang, D.; Liang, Y.; Xu, D.; Feng, X.; Guan, R. A content-based recommender system for computer science publications. Knowl.-Based Syst. 2018, 157, 1–9. [Google Scholar] [CrossRef]
  15. Rutkowski, T.; Romanowski, J.; Woldan, P.; Staszewski, P.; Nielek, R.; Rutkowski, L. A content-based recommendation system using neuro-fuzzy approach. In Proceedings of the 2018 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), Rio de Janeiro, Brazil, 8–13 July 2018; pp. 1–8. [Google Scholar] [CrossRef]
  16. Casillo, M.; Conte, D.; Lombardi, M.; Santaniello, D.; Troiano, A.; Valentino, C. A Content-Based Recommender System for Hidden Cultural Heritage Sites Enhancing. In Proceedings of the Sixth International Congress on Information and Communication Technology, London, UK, 25–26 February 2021; pp. 97–109. [Google Scholar] [CrossRef]
  17. Lops, P.; De Gemmis, M.; Semeraro, G. Content-based recommender systems: State of the art and trends. In Recommender Systems Handbook; Springer: Berlin/Heidelberg, Germany, 2011; pp. 73–105. [Google Scholar] [CrossRef]
  18. Boubenia, M.; Belkhir, A.; Bouyakoub, F. Combining linked open data similarity and relatedness for cross OSN recommendation. Int. J. Semant. Web Inf. Syst. 2020, 16, 59–90. [Google Scholar] [CrossRef]
  19. Chen, R.; Hua, Q.; Chang, Y.S.; Wang, B.; Zhang, L.; Kong, X. A survey of collaborative filtering-based recommender systems: From traditional methods to hybrid methods based on social networks. IEEE Access 2018, 6, 64301–64320. [Google Scholar] [CrossRef]
  20. Clarizia, F.; Colace, F.; De Santo, M.; Lombardi, M.; Pascale, F.; Pietrosanto, A. E-learning and sentiment analysis: A case study. In Proceedings of the 6th International Conference on Information and Education Technology, Osaka, Japan, 6–8 January 2018; pp. 111–118. [Google Scholar] [CrossRef]
  21. Alyari, F.; Navimipour, N.J. Recommender systems: A systematic review of the state of the art literature and suggestions for future research. Kybernetes 2018. [Google Scholar] [CrossRef]
  22. Ning, X.; Desrosiers, C.; Karypis, G. A comprehensive survey of neighborhood-based recommendation methods. In Recommender Systems Handbook; Springer: Berlin/Heidelberg, Germany, 2015; pp. 37–76. [Google Scholar] [CrossRef] [Green Version]
  23. Gazdar, A.; Hidri, L. A new similarity measure for collaborative filtering based recommender systems. Knowl.-Based Syst. 2020, 188, 105058. [Google Scholar] [CrossRef]
  24. Deshpande, M.; Karypis, G. Item-based top-n recommendation algorithms. ACM Trans. Inf. Syst. 2004, 22, 143–177. [Google Scholar] [CrossRef]
  25. Pujahari, A.; Sisodia, D.S. Model-based collaborative filtering for recommender systems: An empirical survey. In Proceedings of the 2020 IEEE First International Conference on Power, Control and Computing Technologies (ICPC2T), Raipur, India, 3–5 January 2020; pp. 443–447. [Google Scholar] [CrossRef]
  26. Koren, Y.; Bell, R. Advances in collaborative filtering. In Recommender Systems Handbook; Springer: Berlin/Heidelberg, Germany, 2015; pp. 77–118. [Google Scholar] [CrossRef]
  27. Ramlatchan, A.; Yang, M.; Liu, Q.; Li, M.; Wang, J.; Li, Y. A survey of matrix completion methods for recommendation systems. Big Data Min. Anal. 2018, 1, 308–323. [Google Scholar] [CrossRef] [Green Version]
  28. Bokde, D.; Girase, S.; Mukhopadhyay, D. Matrix factorization model in collaborative filtering algorithms: A survey. Procedia Comput. Sci. 2015, 49, 136–146. [Google Scholar] [CrossRef] [Green Version]
  29. Indra, R.; Thangaraj, M. An integrated recommender system using semantic web with social tagging system. Int. J. Semant. Web Inf. Syst. 2019, 15, 47–67. [Google Scholar] [CrossRef]
  30. Shah, K.; Salunke, A.; Dongare, S.; Antala, K. Recommender systems: An overview of different approaches to recommendations. In Proceedings of the 2017 International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS), Coimbatore, India, 17–18 March 2017; pp. 1–4. [Google Scholar] [CrossRef]
  31. Casillo, M.; De Santo, M.; Lombardi, M.; Mosca, R.; Santaniello, D.; Valentino, C. Recommender Systems and Digital Storytelling To Enhance Tourism Experience in Cultural Heritage Sites. In Proceedings of the 2021 IEEE International Conference on Smart Computing (SMARTCOMP), Irvine, CA, USA, 23–27 August 2021; pp. 323–328. [Google Scholar] [CrossRef]
  32. Carbone, M.; Colace, F.; Lombardi, M.; Marongiu, F.; Santaniello, D.; Valentino, C. An Adaptive Learning Path Builder based on a Context Aware Recommender System. In Proceedings of the 2021 IEEE Frontiers in Education Conference (FIE), Lincoln, NE, USA, 13–16 October 2021. [Google Scholar] [CrossRef]
  33. Lika, B.; Kolomvatsos, K.; Hadjiefthymiades, S. Facing the cold start problem in recommender systems. Expert Syst. Appl. 2014, 41, 2065–2073. [Google Scholar] [CrossRef]
  34. Kumar, P.; Thakur, R.S. Recommendation system techniques and related issues: A survey. Int. J. Inf. Technol. 2018, 10, 495–501. [Google Scholar] [CrossRef]
  35. Takács, G.; Pilászy, I.; Németh, B.; Tikk, D. Scalable collaborative filtering approaches for large recommender systems. J. Mach. Learn. Res. 2009, 10, 623–656. [Google Scholar]
  36. Cacheda, F.; Carneiro, V.; Fernández, D.; Formoso, V. Comparison of collaborative filtering algorithms: Limitations of current techniques and proposals for scalable, high-performance recommender systems. ACM Trans. Web 2011, 5, 1–33. [Google Scholar] [CrossRef]
  37. Huang, Z.; Chen, H.; Zeng, D. Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Trans. Inf. Syst. 2004, 22, 116–142. [Google Scholar] [CrossRef] [Green Version]
  38. Portugal, I.; Alencar, P.; Cowan, D. The use of machine learning algorithms in recommender systems: A systematic review. Expert Syst. Appl. 2018, 97, 205–227. [Google Scholar] [CrossRef] [Green Version]
  39. Zhang, S.; Yao, L.; Sun, A.; Tay, Y. Deep learning based recommender system: A survey and new perspectives. ACM Comput. Surv. 2019, 52, 1–38. [Google Scholar] [CrossRef] [Green Version]
  40. Tarus, J.K.; Niu, Z.; Mustafa, G. Knowledge-based recommendation: A review of ontology-based recommender systems for e-learning. Artif. Intell. Rev. 2018, 50, 21–48. [Google Scholar] [CrossRef]
  41. Raza, S.; Ding, C. Progress in context-aware recommender systems—An overview. Comput. Sci. Rev. 2019, 31, 84–97. [Google Scholar] [CrossRef]
  42. Clarizia, F.; Colace, F.; De Santo, M.; Lombardi, M.; Pascale, F.; Santaniello, D. A context-aware chatbot for tourist destinations. In Proceedings of the 2019 15th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS), Sorrento, Italy, 26–29 November 2019; pp. 348–354. [Google Scholar] [CrossRef]
  43. Adomavicius, G.; Tuzhilin, A. Context-aware recommender systems. In Recommender Systems Handbook; Springer: Berlin/Heidelberg, Germany, 2011; pp. 217–253. [Google Scholar] [CrossRef]
  44. Abowd, G.D.; Dey, A.K.; Brown, P.J.; Davies, N.; Smith, M.; Steggles, P. Towards a better understanding of context and context-awareness. In Proceedings of the International Symposium on Handheld and Ubiquitous Computing, Karlsruhe, Germany, 27–29 September 1999; pp. 304–307. [Google Scholar] [CrossRef] [Green Version]
  45. Annunziata, G.; Colace, F.; De Santo, M.; Lemma, S.; Lombardi, M. Appoggiomarino: A context Aware app for e-citizenship. In Proceedings of the 18th International Conference on Enterprise Information Systems (ICEIS), Rome, Italy, 25–28 April 2016; Volume 2, pp. 273–281. [Google Scholar] [CrossRef]
  46. Casillo, M.; Colace, F.; Gupta, B.; Santaniello, D.; Valentino, C. Fake News Detection Using LDA Topic Modelling and K-Nearest Neighbor Classifier. In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 13116 LNCS; Springer: Montreal, QC, Canada, 2021; pp. 330–339. [Google Scholar] [CrossRef]
  47. Villegas, N.M.; Sánchez, C.; Díaz-Cely, J.; Tamura, G. Characterizing context-aware recommender systems: A systematic literature review. Knowl.-Based Syst. 2018, 140, 173–200. [Google Scholar] [CrossRef]
  48. Murciego, A.; Jiménez-Bravo, D.; Román, A.; Santana, J.; Moreno-García, M. Context-aware recommender systems in the music domain: A systematic literature review. Electronics 2021, 10, 1555. [Google Scholar] [CrossRef]
  49. Casillo, M.; Colace, F.; Conte, D.; Lombardi, M.; Santaniello, D.; Valentino, C. Context-aware recommender systems and cultural heritage: A survey. J. Ambient Intell. Humaniz. Comput. 2021, 1–19. [Google Scholar] [CrossRef]
  50. Ricci, G.; de Gemmis, M.; Semeraro, G. Matrix and tensor factorization techniques applied to recommender systems: A survey. Matrix 2012, 1. Available online: https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.404.1854&rep=rep1&type=pdf (accessed on 17 March 2022).
  51. Missaoui, S.; Kassem, F.; Viviani, M.; Agostini, A.; Faiz, R.; Pasi, G. LOOKER: A mobile, personalized recommender system in the tourism domain based on social media user-generated content. Pers. Ubiquitous Comput. 2019, 23, 181–197. [Google Scholar] [CrossRef]
  52. Shin, D.; Lee, J.w.; Yeon, J.; Lee, S.g. Context-aware recommendation by aggregating user context. In Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing, Vienna, Austria, 20–23 July 2009; pp. 423–430. [Google Scholar] [CrossRef]
  53. Chang, B.; Park, Y.; Park, D.; Kim, S.; Kang, J. Content-Aware Hierarchical Point-of-Interest Embedding Model for Successive POI Recommendation. In Proceedings of the IJCAI, Stockholm, Switzerland, 13–19 July 2018; pp. 3301–3307. [Google Scholar] [CrossRef] [Green Version]
  54. Xu, Z.; Chen, L.; Chen, G. Topic based context-aware travel recommendation method exploiting geotagged photos. Neurocomputing 2015, 155, 99–107. [Google Scholar] [CrossRef]
  55. Karatzoglou, A.; Amatriain, X.; Baltrunas, L.; Oliver, N. Multiverse recommendation: N-dimensional tensor factorization for context-aware collaborative filtering. In Proceedings of the fourth ACM Conference on Recommender Systems, Barcelona, Spain, 26–30 September 2010; pp. 79–86. [Google Scholar] [CrossRef]
  56. Kolda, T.G.; Bader, B.W. Tensor decompositions and applications. SIAM Rev. 2009, 51, 455–500. [Google Scholar] [CrossRef]
  57. De Lathauwer, L.; De Moor, B.; Vandewalle, J. A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 2000, 21, 1253–1278. [Google Scholar] [CrossRef] [Green Version]
  58. Baltrunas, L.; Ricci, F. Context-based splitting of item ratings in collaborative filtering. In Proceedings of the Third ACM Conference on Recommender Systems, New York, NY, USA, 23–25 October 2009; pp. 245–248. [Google Scholar] [CrossRef]
  59. Baltrunas, L.; Ricci, F. Experimental evaluation of context-dependent collaborative filtering using item splitting. User Model. User-Adapt. Interact. 2014, 24, 7–34. [Google Scholar] [CrossRef]
  60. Said, A.; De Luca, E.W.; Albayrak, S. Inferring contextual user profiles-improving recommender performance. In Proceedings of the 3rd RecSys Workshop on Context-Aware Recommender Systems, Chicago, IL, USA, 23 October 2011. [Google Scholar]
  61. Zheng, Y.; Mobasher, B.; Burke, R.D. The Role of Emotions in Context-aware Recommendation. Decis. RecSys 2013, 2013, 21–28. [Google Scholar]
  62. Baltrunas, L.; Ludwig, B.; Ricci, F. Matrix factorization techniques for context aware recommendation. In Proceedings of the Fifth ACM Conference on Recommender Systems, Chicago, IL, USA, 23–27 October 2011; pp. 301–304. [Google Scholar] [CrossRef] [Green Version]
  63. Jeong, S.Y.; Kim, Y.K. Deep Learning-Based Context-Aware Recommender System Considering Contextual Features. Appl. Sci. 2022, 12, 45. [Google Scholar] [CrossRef]
  64. Lakehal, A.; Alti, A.; Roose, P. Novel Semantic-Based Probabilistic Context Aware Approach for Situations Enrichment and Adaptation. Appl. Sci. 2022, 12, 732. [Google Scholar] [CrossRef]
  65. Polignano, M.; Narducci, F.; de Gemmis, M.; Semeraro, G. Towards Emotion-aware Recommender Systems: An Affective Coherence Model based on Emotion-driven Behaviors. Expert Syst. Appl. 2021, 170, 114382. [Google Scholar] [CrossRef]
  66. Sánchez-Moreno, D.; Zheng, Y.; Moreno-García, M. Time-aware music recommender systems: Modeling the evolution of implicit user preferences and user listening habits in a collaborative filtering approach. Appl. Sci. 2020, 10, 5324. [Google Scholar] [CrossRef]
  67. Wang, D.; Zhang, X.; Yu, D.; Xu, G.; Deng, S. CAME: Content- And Context-Aware Music Embedding for Recommendation. IEEE Trans. Neural Netw. Learn. Syst. 2021, 32, 1375–1388. [Google Scholar] [CrossRef]
  68. Wang, N.; Chen, L. User Bias in Beyond-Accuracy Measurement of Recommendation Algorithms. In Proceedings of the Fifteenth ACM Conference on Recommender Systems, Amsterdam, The Netherlands, 27 September–1 October 2021; pp. 133–142. [Google Scholar] [CrossRef]
  69. Dongarra, J.; Gates, M.; Haidar, A.; Kurzak, J.; Luszczek, P.; Tomov, S.; Yamazaki, I. The singular value decomposition: Anatomy of optimizing an algorithm for extreme scale. SIAM Rev. 2018, 60, 808–865. [Google Scholar] [CrossRef]
  70. Van der Vlugt, Y. Large-Scale SVD Algorithms for Latent Semantic Indexing, Recommender Systems and Image Processing; Delft Institute of Applied Mathematics: Delft, The Netherlands, 2018. [Google Scholar]
  71. Rodríguez, J.; Pérez, A.; Lozano, J. Sensitivity Analysis of k-Fold Cross Validation in Prediction Error Estimation. IEEE Trans. Pattern Anal. Mach. Intell. 2010, 32, 569–575. [Google Scholar] [CrossRef] [PubMed]
  72. Gunawardana, A.; Shani, G. Evaluating Recommender Systems; Springer: Berlin/Heidelberg, Germany, 2015; pp. 265–308. [Google Scholar] [CrossRef]
  73. Gunawardana, A.; Shani, G. A survey of accuracy evaluation metrics of recommendation tasks. J. Mach. Learn. Res. 2009, 10, 2935–2962. [Google Scholar]
  74. Herlocker, J.L.; Konstan, J.A.; Terveen, L.G.; Riedl, J.T. Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. (TOIS) 2004, 22, 5–53. [Google Scholar] [CrossRef]
  75. Zheng, Y.; Mobasher, B.; Burke, R. Carskit: A java-based context-aware recommendation engine. In Proceedings of the 2015 IEEE International Conference on Data Mining Workshop (ICDMW), Atlantic City, NJ, USA, 14–17 November 2015; pp. 1668–1671. [Google Scholar] [CrossRef]
  76. Ilarri, S.; Trillo-Lado, R.; Hermoso, R. Datasets for context-aware recommender systems: Current context and possible directions. In Proceedings of the 2018 IEEE 34th International Conference on Data Engineering Workshops (ICDEW), Paris, France, 16–19 April 2018; pp. 25–28. [Google Scholar] [CrossRef]
  77. Košir, A.; Odić, A.; Kunaver, M.; Tkalčič, M.; Tasič, J. LDOS-CoMoDa Dataset. 2013. Available online: https://www.lucami.org/en/research/ldos-comoda-dataset/ (accessed on 17 March 2022).
  78. Baltrunas, L.; Kaminskas, M.; Ludwig, B.; Moling, O.; Ricci, F.; Aydin, A.; Lüke, K.H.; Schwaiger, R. Incarmusic: Context-aware music recommendations in a car. In Proceedings of the International Conference on Electronic Commerce and Web Technologies, Toulouse, France, 30 August–1 September 2011; pp. 89–100. [Google Scholar] [CrossRef]
  79. Braunhofer, M.; Elahi, M.; Ricci, F. STS: A Context-Aware Mobile Recommender System for Places of Interest. In Proceedings of the UMAP Workshops, Aalborg, Denmark, 7–11 July 2014; pp. 75–80. [Google Scholar]
  80. Ali, Z.; Qi, G.; Muhammad, K.; Kefalas, P.; Khusro, S. Global citation recommendation employing generative adversarial network. Expert Syst. Appl. 2021, 180, 114888. [Google Scholar] [CrossRef]
  81. Rashed, A.; Grabocka, J.; Schmidt-Thieme, L. A Guided Learning Approach for Item Recommendation via Surrogate Loss Learning. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information, Virtual, 11–15 July 2021; pp. 605–613. [Google Scholar] [CrossRef]
  82. Parapar, J.; Radlinski, F. Towards Unified Metrics for Accuracy and Diversity for Recommender Systems. In Proceedings of the Fifteenth ACM Conference on Recommender Systems, Amsterdam, The Netherlands, 27 September–1 October 2021; pp. 75–84. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.