@article {860, title = {An evaluation review of user similarity metrics in sparse collaborative filtering datasets}, journal = {International Journal of Data Science and Analytics}, year = {2025}, abstract = {

Collaborative filtering (CF) is one of the most prominent recommender system (RecSys) techniques of the recent years. CF generates rating predictions for the items that the user has not evaluated yet, using the evaluations of users with similar likings to the same items. Therefore, in CF the task of finding these users (which can be considered as reliable recommenders) is of high importance, while this task is especially challenging on sparse datasets. To this end, many user similarity metrics have been introduced and used in the literature, such as the Vector (or Cosine) Similarity metric, the Spearman rank correlation, the Pearson Correlation Coefficient (PCC), and others. For a CF RecSys, the use of the most efficient similarity metric is of great importance. This paper assesses the effectiveness of 15 user similarity metrics in sparse CF datasets, by conducting an extensive set of experiments. These experiments include 10 sparse CF datasets with diverse item domains, two neighbour selection approaches, two rating prediction formulas, and three rating prediction accuracy metrics. The evaluation results show that the metrics that achieve the best prediction results are found to be the Spearman rank correlation, followed by the Adjusted Rand Index, the Constrained PCC, and the Chebysev distance. Interestingly, the most widely used similarity metrics in CF research, i.e. the PCC and the Cosine Similarity, are not among the best performing metrics.

}, keywords = {collaborative filtering, Evaluation review, Recommender Systems, Sparse Datasets, User similarity metrics}, issn = {2364-4168}, doi = {10.1007/s41060-025-00846-4}, author = {Sgardelis, Kiriakos and Margaris, Dionisis and Spiliotopoulos, Dimitris and Vassilakis, Costas} } @booklet {846, title = {Experimental results for Evaluating User Similarity Metrics in Sparse Collaborative Filtering Datasets (version 2)}, year = {2025}, abstract = {

In this technical report, we present the experimental findings from evaluating 15 user similarity metrics when applied in sparse collaborative filtering (CF) datasets.

}, keywords = {collaborative filtering, Evaluation, Sparse Datasets, User similarity metrics}, url = {https://soda.dit.uop.gr/sites/soda.dit.uop.gr/files/publications/technical-reports/soda-TR-24001-v2.pdf}, author = {Kiriakos Sgardelis and Dionisis Margaris and Dimitris Spiliotopoulos and Costas Vassilakis} } @article {852, title = {From Rating Predictions to Reliable Recommendations in Collaborative Filtering: The Concept of Recommendation Reliability Classes}, journal = {Big Data and Cognitive Computing}, volume = {9}, year = {2025}, pages = {106}, abstract = {

Recommender systems aspire to provide users with recommendations that have a high probability to be accepted. This is accomplished by producing rating predictions for products that they have not evaluated and afterwards, the products having the highest prediction scores are recommended to them. Collaborative filtering is a popular recommender system technique which generates rating prediction scores by blending the ratings that users with similar likings have previously set to these products. However, predictions may entail errors, which will either lead to recommending products that the users would not accept or failing to recommend products that the users would really accept. The first case is considered much more critical, since the recommender system will significantly lose reliability and consequently interest. In this paper, after performing a study on rating prediction confidence factors in collaborative filtering (a) we introduce the concept of prediction reliability classes, (b) we rank these classes in relation to the utility of the rating predictions belonging to each class and (c) we present a collaborative filtering recommendation algorithm which exploits these reliability classes for prediction formulation. The efficacy of the presented algorithm is evaluated through an extensive multi-parameter evaluation process, which demonstrates that it significantly enhances recommendation quality.

}, keywords = {collaborative filtering, Evaluation, Rating Predictions, Recommender Systems, reliability classes, reliable recommendations}, issn = {2504-2289}, doi = {10.3390/bdcc9040106}, author = {Dionisis Margaris and Costas Vassilakis and Spiliotopoulos, Dimitris} } @article {854, title = {Using Prediction Confidence Factors to Enhance Collaborative Filtering Recommendation Quality}, journal = {Technologies}, volume = {13}, year = {2025}, pages = {181}, abstract = {

Recommender systems suggest items that users are likely to accept by predicting ratings for items they have not already rated. Collaborative filtering is a widely used method that produces these predictions, based on the ratings of similar users, termed as near neighbors. However, in many cases, prediction errors occur and, therefore, the recommender system ends up either recommending unwanted products or missing out on products the user would actually desire. As a result, the quality of the recommendations that are produced is of major importance. In this paper, we introduce an advanced collaborative filtering recommendation algorithm that upgrades the quality of the recommendations that are produced by considering, along with the rating prediction value of the items computed by the plain collaborative filtering procedure, a number of confidence factors that each rating prediction fulfills. The presented algorithm maintains high recommendation coverage, and can be applied to every collaborative filtering dataset, since it is based only on the very basic information. Based on the application of the algorithm on widely used recommender systems datasets, the proposed algorithm significantly upgrades the recommendation quality, surpassing the performance of state-of-the-art research works that also consider confidence factors.

}, keywords = {Algorithm, collaborative filtering, prediction confidence factors, recommendation quality, Recommender Systems}, issn = {2227-7080}, doi = {https://doi.org/10.3390/technologies13050181}, url = {https://doi.org/10.3390/technologies13050181}, author = {Dionisis Margaris and Spiliotopoulos, Dimitris and Sgardelis, Kiriakos and Costas Vassilakis} } @article {833, title = {Experimental results for Evaluating User Similarity Metrics in Sparse Collaborative Filtering Datasets}, number = {TR-24001}, year = {2024}, month = {03/2024}, institution = {SODA lab}, type = {Technical Report}, address = {Tripolis, Greece}, keywords = {collaborative filtering, Evaluation, Sparse Datasets, User similarity metrics}, issn = {SODA-TR-24001}, author = {Kiriakos Sgardelis and Dionisis Margaris and Dimitris Spiliotopoulos and Costas Vassilakis} } @article {841, title = {Exploiting Rating Prediction Certainty for Recommendation Formulation in Collaborative Filtering}, journal = {Big Data and Cognitive Computing}, volume = {8}, year = {2024}, pages = {53}, abstract = {

Collaborative filtering is a popular recommender system (RecSys) method that produces rating prediction values for products by combining the ratings that close users have already given to the same products. Afterwards, the products that achieve the highest prediction values are recommended to the user. However, as expected, prediction estimation may contain errors, which, in the case of RecSys, will lead to either not recommending a product that the user would actually like (i.e., purchase, watch, or listen) or to recommending a product that the user would not like, with both cases leading to degraded recommendation quality. Especially in the latter case, the RecSys would be deemed unreliable. In this work, we design and develop a recommendation algorithm that considers both the rating prediction values and the prediction confidence, derived from features associated with rating prediction accuracy in collaborative filtering. The presented algorithm is based on the rationale that it is preferable to recommend an item with a slightly lower prediction value, if that prediction seems to be certain and safe, over another that has a higher value but of lower certainty. The proposed algorithm prevents low-confidence rating predictions from being included in recommendations, ensuring the recommendation quality and reliability of the RecSys.

}, keywords = {Algorithm, collaborative filtering, confidence, Evaluation, Rating Predictions, Recommender Systems, Uncertainty}, issn = {2504-2289}, doi = {10.3390/bdcc8060053}, author = {Dionisis Margaris and Sgardelis, Kiriakos and Spiliotopoulos, Dimitris and Costas Vassilakis} } @conference {839, title = {Improving Recommendation Quality in Collaborative Filtering by Including Prediction Confidence Factors}, booktitle = {Proceedings of the 20th International Conference on Web Information Systems and Technologies (WEBIST 24)}, year = {2024}, publisher = {SCITEPRESS Digital Library}, organization = {SCITEPRESS Digital Library}, abstract = {

Collaborative filtering is a prevalent recommender system technique which generates rating predictions based on the rating values given by the users{\textquoteright} near neighbours. Consequently, for each user, the items scoring the highest prediction values are recommended to them. Unfortunately, predictions inherently entail errors, which, in the case of recommender systems, manifest as unsuccessful recommendations. However, along with each rating prediction value, prediction confidence factors can be computed. As a result, items having low prediction confidence factor values, can be either declined for recommendation or have their recommendation priority demoted. In the former case, some users may receive fewer recommended items or even none, especially when using a sparse dataset. In this paper, we present an algorithm that determines the items to be recommended by considering both the rating prediction values and confidence factors of predictions, allowing for predictions with higher confidence factors to outrank predictions with higher value, but lower confidence. The presented algorithm achieves to enhance the recommendation quality, while at the same time retaining the number of recommendations for each user.

}, keywords = {Algorithm, Certainty factors, collaborative filtering, Rating Predictions, Recommender Systems}, author = {Kiriakos Sgardelis and Dionisis Margaris and Dimitris Spiliotopoulos and Costas Vassilakis and Stefanos Ougiaroglou} } @article {820, title = {Rating Prediction Quality Enhancement in Low-Density Collaborative Filtering Datasets}, journal = {Big Data and Cognitive Computing}, volume = {7}, year = {2023}, month = {mar}, pages = {59}, abstract = {

Collaborative filtering has proved to be one of the most popular and successful rating prediction techniques over the last few years. In collaborative filtering, each rating prediction, concerning a product or a service, is based on the rating values that users that are considered {\textquotedblleft}close{\textquotedblright} to the user for whom the prediction is being generated have given to the same product or service. In general, {\textquotedblleft}close{\textquotedblright} users for some user u correspond to users that have rated items similarly to u and these users are termed as {\textquotedblleft}near neighbors{\textquotedblright}. As a result, the more reliable these near neighbors are, the more successful predictions the collaborative filtering system will compute and ultimately, the more successful recommendations the recommender system will generate. However, when the dataset{\textquoteright}s density is relatively low, it is hard to find reliable near neighbors and hence many predictions fail, resulting in low recommender system reliability. In this work, we present a method that enhances rating prediction quality in low-density collaborative filtering datasets, by considering predictions whose features are associated with high prediction accuracy as additional ratings. The presented method{\textquoteright}s efficacy and applicability are substantiated through an extensive multi-parameter evaluation process, using widely acceptable low-density collaborative filtering datasets.

}, keywords = {collaborative filtering, Evaluation, low density datasets, personalization, rating prediction quality, Recommender Systems, reliability}, doi = {10.3390/bdcc7020059}, url = {https://www.mdpi.com/2504-2289/7/2/59}, author = {Dionisis Margaris and Costas Vassilakis and Dimitris Spiliotopoulos and Stefanos Ougiaroglou} } @conference {812, title = {Persona Finetuning for Online Gaming using Personalisation Techniques}, booktitle = {Proceedings of the 2022 HCII Conference}, year = {2022}, abstract = {

Automatic persona generation has been shown to have specific measurable benefits for application creators and users. In most situations, personas are adequately descriptive and diversified to achieve user type accuracy and coverage. For specific market segments, such as online gaming, using personas may accurately describe existing user base but not changing habit and need that are introduced by the fluidity of the offerings and the delivery methods. Changes in the ways that applications are marketed, such as new payment methods, for example, subscription models, pay-to-play and pay-to-win, payment-driven-gamification, seriously affect user needs and result in direct impact on user acceptance. This work utilises structured user needs from online gaming players to augment personas using personalisation techniques. The personas are finetuned and dediversified to result in concise personas, based on user needs that successfully convey information for creators and users alike.

}, keywords = {collaborative filtering, Data-driven methods, Diversification, Online Gaming, Persona, Personalisation, Usability evaluation, User study}, author = {Dimitris Spiliotopoulos and Dionisis Margaris and Kostas N. Koutrakis and Panos Philippopoulos and Costas Vassilakis} } @article {813, title = {On Producing Accurate Rating Predictions in Sparse Collaborative Filtering Datasets}, journal = {Information}, volume = {13}, year = {2022}, month = {jun}, pages = {302}, abstract = {

The typical goal of a collaborative filtering algorithm is the minimisation of the deviation between rating predictions and factual user ratings so that the recommender system offers suggestions for appropriate items, achieving a higher prediction value. The datasets on which collaborative filtering algorithms are applied vary in terms of sparsity, i.e., regarding the percentage of empty cells in the user{\textendash}item rating matrices. Sparsity is an important factor affecting rating prediction accuracy, since research has proven that collaborative filtering over sparse datasets exhibits a lower accuracy. The present work aims to explore, in a broader context, the factors related to rating prediction accuracy in sparse collaborative filtering datasets, indicating that recommending the items that simply achieve higher prediction values than others, without considering other factors, in some cases, can reduce recommendation accuracy and negatively affect the recommender system{\textquoteright}s success. An extensive evaluation is conducted using sparse collaborative filtering datasets. It is found that the number of near neighbours used for the prediction formulation, the rating average of the user for whom the prediction is generated and the rating average of the item concerning the prediction can indicate, in many cases, whether the rating prediction produced is reliable or not.

}, keywords = {accuracy, collaborative filtering, Evaluation, Personalisation, Rating prediction, Recommender Systems, reliability, Sparse Datasets}, doi = {https://doi.org/10.3390/info13060302}, author = {Dionisis Margaris and Costas Vassilakis and Dimitris Spiliotopoulos} } @article {797, title = {On Addressing the Low Rating Prediction Coverage in Sparse Datasets Using Virtual Ratings}, journal = {SN Computer Science}, volume = {2}, year = {2021}, month = {May}, pages = {255}, abstract = {

Collaborative filtering-based recommendation systems consider users{\textquoteright} likings and interests, articulated as ratings within a database to offer personalized recommendations. Unfortunately, many collaborative filtering datasets exhibit the {\textquoteleft}{\textquoteleft}grey sheep{\textquoteright}{\textquoteright} phenomenon, a state where no near neighbours can be found for certain users. This phenomenon is extremely frequent in datasets where users, on average, have rated only a small percentage of the available items, which are termed as sparse datasets. This paper addresses the {\textquoteleft}{\textquoteleft}grey sheep{\textquoteright}{\textquoteright} problem by proposing the virtual ratings concept and introduces an algorithm for virtual rating creation on the basis of actual ratings. The novelty behind this concept is that the introduction of the virtual ratings effectively reduces the user{\textendash}item rating matrix sparsity, thus alleviating the aforementioned problem. The proposed algorithm, which is termed as CFVR, has been extensively evaluated and the results show that it achieves to considerably improve the capability of a collaborative filtering system to formulate tailored recommendations for each user, when operating on sparse datasets, while at the same time improves rating prediction quality.

}, keywords = {collaborative filtering, Cosine Similarity, Evaluation, Pearson Correlation Coefficient, Recommender Systems, Sparse Datasets, Virtual ratings}, issn = {2661-8907}, doi = {10.1007/s42979-021-00668-8}, url = {https://doi.org/10.1007/s42979-021-00668-8}, author = {Dionisis Margaris and Spiliotopoulos, Dimitris and Karagiorgos, Gregory and Costas Vassilakis and Vasilopoulos, Dionysios} } @article {803, title = {Augmenting Black Sheep Neighbour Importance for Enhancing Rating Prediction Accuracy in Collaborative Filtering}, journal = {Applied Sciences}, volume = {11}, year = {2021}, month = {sep}, pages = {8369}, abstract = {

In this work, an algorithm for enhancing the rating prediction accuracy in collaborative filtering, which does not need any supplementary information, utilising only the users{\textquoteright} ratings on items, is presented. This accuracy enhancement is achieved by augmenting the importance of the opinions of {\textquoteleft}black sheep near neighbours{\textquoteright}, which are pairs of near neighbours with opinion agreement on items that deviates from the dominant community opinion on the same item. The presented work substantiates that the weights of near neighbours can be adjusted, based on the degree to which the target user and the near neighbour deviate from the dominant ratings for each item. This concept can be utilized in various other CF algorithms. The experimental evaluation was conducted on six datasets broadly used in CF research, using two user similarity metrics and two rating prediction error metrics. The results show that the proposed technique increases rating prediction accuracy both when used independently and when combined with other CF algorithms. The proposed algorithm is designed to work without the requirements to utilise any supplementary sources of information, such as user relations in social networks and detailed item descriptions. The aforesaid point out both the efficacy and the applicability of the proposed work.

}, keywords = {black sheep users, collaborative filtering, Evaluation, rating prediction accuracy}, doi = {10.3390/app11188369}, url = {https://doi.org/10.3390/app11188369}, author = {Dionisis Margaris and Dimitris Spiliotopoulos and Costas Vassilakis} } @inbook {808, title = {Identifying Reliable Recommenders in Users{\textquoteright} Collaborating Filtering and Social Neighbourhoods}, booktitle = {Lecture Notes in Social Networks}, year = {2021}, pages = {51{\textendash}76}, publisher = {Springer International Publishing}, organization = {Springer International Publishing}, abstract = {

Recommender systems increasingly use information sourced from social networks to improve the quality of their recommendations. However, both recommender systems and social networks exhibit phenomena under which information for certain users or items is limited, such as the cold start and the grey sheep phenomena in collaborative filtering systems and the isolated users in social networks. In the context of a social network-aware collaborative filtering, where the collaborating filtering- and social network{\textendash}based neighbourhoods are of varying density and utility for recommendation formulation, the ability to identify the most reliable recommenders from each neighbourhood for each user and appropriately combine the information associated with them in the recommendation computation process can significantly improve the quality and accuracy of the recommendations offered. In this chapter, we report on our extensions on earlier works in this area which comprise of (1) the development of an algorithm for discovering the most reliable recommenders of a social network recommender system and (2) the development and evaluation of a new collaborative filtering algorithm that synthesizes the opinions of a user{\textquoteright}s identified recommenders to generate successful recommendations for the particular user. The proposed algorithm introduces significant gains in rating prediction accuracy (4.9\% on average, in terms of prediction MAE reduction and 4.2\% on average, in terms of prediction RMSE reduction) and outperforms other algorithms. The proposed algorithm, by design, utilizes only basic information from the collaborative filtering domain (user{\textendash}item ratings) and the social network domain (user relationships); therefore, it can be easily applied to any social network recommender system dataset.

}, keywords = {collaborative filtering, Evaluation, Limited Information, Near Neighbours, Rating prediction, Recommender Systems, Social Networks}, doi = {10.1007/978-3-030-67044-3_3}, author = {Dionisis Margaris and Dimitris Spiliotopoulos and Costas Vassilakis} } @article {779, title = {An Algorithm for Density Enrichment of Sparse Collaborative Filtering Datasets Using Robust Predictions as Derived Ratings}, journal = {Algorithms}, volume = {13}, year = {2020}, month = {07/2020}, pages = {174}, abstract = {

Collaborative filtering algorithms formulate personalized recommendations for a user, first by analysing already entered ratings to identify other users with similar tastes to the user (termed as near neighbours), and then using the opinions of the near neighbours to predict which items the target user would like. However, in sparse datasets, too few near neighbours can be identified, resulting in low accuracy predictions and even a total inability to formulate personalized predictions. This paper addresses the sparsity problem by presenting an algorithm that uses robust predictions, that is predictions deemed as highly probable to be accurate, as derived ratings. Thus, the density of sparse datasets increases, and improved rating prediction coverage and accuracy are achieved. The proposed algorithm, termed as CFDR, is extensively evaluated using (1) seven widely-used collaborative filtering datasets, (2) the two most widely-used correlation metrics in collaborative filtering research, namely the Pearson correlation coefficient and the cosine similarity, and (3) the two most widely-used error metrics in collaborative filtering, namely the mean absolute error and the root mean square error. The evaluation results show that, by successfully increasing the density of the datasets, the capacity of collaborative filtering systems to formulate personalized and accurate recommendations is considerably improved.

}, keywords = {collaborative filtering, density enrichment, derived ratings, rating prediction accuracy, rating prediction coverage, Recommender Systems, robust predictions, Sparse Datasets}, doi = {https://doi.org/10.3390/a13070174}, author = {Dionisis Margaris and Dimitris Spiliotopoulos and Gregory Karagiorgos and Costas Vassilakis} } @article {margaris-IJBDI-2019-b, title = {Improving collaborative filtering{\textquoteright}s rating prediction accuracy by considering users{\textquoteright} dynamic rating variability}, journal = {International Journal of Big Data Intelligence}, volume = {7}, year = {2020}, chapter = {59--71}, abstract = {

Users that populate ratings databases, follow different marking practices, in the sense that some are stricter, while others are more lenient. Similarly, users{\textquoteright} rating practices may also differ in rating variability, in the sense that some users may be entering ratings close to their mean, while other users may be entering more extreme ratings, close to the limits of the rating scale. While this aspect has been recently addressed through the computation and exploitation of an overall rating variability measure per user, the fact that user rating practices may vary along the user{\textquoteright}s rating history time axis may render the use of the overall rating variability measure inappropriate for performing the rating prediction adjustment. In this work, we (1) propose an algorithm that considers two variability metrics per user, the global (overall) and the local one, with the latter representing the user{\textquoteright}s variability at prediction time, (2) present alternative methods for computing a user{\textquoteright}s local variability and (3) evaluate the performance of the proposed algorithm in terms of rating prediction quality and compare it against the state-of-the-art algorithm that employs a single variability metric in the rating prediction computation process.

}, keywords = {collaborative filtering, Cosine Similarity, Evaluation, Pearson Correlation Coefficient, prediction accuracy, users{\textquoteright} ratings dynamic variability}, doi = {10.1504/ijbdi.2020.107373}, author = {Dionisis Margaris and Costas Vassilakis} } @article {margaris-IJBDI-2019-a, title = {Improving collaborative filtering{\textquoteright}s rating prediction coverage in sparse datasets by exploiting the {\textquotedblleft}friend of a friend{\textquotedblright} concept}, journal = {International Journal of Big Data Intelligence}, volume = {7}, year = {2020}, chapter = {47}, abstract = {

Collaborative filtering computes personalized recommendations by taking into account ratings expressed by users. Collaborative filtering algorithms firstly identify people having similar tastes, by examining the likeness of already entered ratings. Users with highly similar tastes are termed {\textquotedblleft}near neighbours{\textquotedblright} and recommendations for a user are based on her near neighbours{\textquoteright} ratings. However, for a number of users no near neighbours can be found, a problem termed as the {\textquotedblleft}gray sheep{\textquotedblright} problem. This problem is more intense in sparse datasets, i.e. datasets with relatively small number of ratings, compared to the number of users and items. In this work, we propose an algorithm for alleviating this problem by exploiting the friend of a friend (FOAF) concept. The proposed algorithm, CFfoaf, has been evaluated against eight widely used sparse datasets and under two widely used collaborative filtering correlation metrics, namely the Pearson Correlation Coefficient and the Cosine Similarity and has been proven to be particularly effective in increasing the percentage of users for which personalized recommendations can be formulated in the context of sparse datasets, while at the same time improving rating prediction quality.

}, keywords = {collaborative filtering, Cosine Similarity, Evaluation, friend-of-a-friend, Pearson Correlation Coefficient, prediction accuracy, Recommender Systems, Sparse Datasets}, issn = {2053-1389}, doi = {10.1504/ijbdi.2020.106178}, author = {Dionisis Margaris and Costas Vassilakis} } @article {775, title = {What makes a review a reliable rating in recommender systems?}, journal = {Information Processing \& Management}, volume = {57}, year = {2020}, month = {04/2020}, pages = {102304}, abstract = {

The way that users provide feedback on items regarding their satisfaction varies among systems: in some systems, only explicit ratings can be entered; in other systems textual reviews are accepted; and in some systems, both feedback types are accommodated. Recommender systems can readily exploit explicit ratings in the rating prediction and recommendation formulation process, however textual reviews -which in the context of many social networks are in abundance and significantly outnumber numeric ratings- need to be converted to numeric ratings. While numerous approaches exist that calculate a user{\textquoteright}s rating based on the respective textual review, all such approaches may introduce errors, in the sense that the process of rating calculation based on textual reviews involves an uncertainty level, due to the characteristics of the human language, and therefore the calculated ratings may not accurately reflect the actual ratings that the corresponding user would enter. In this work (1) we examine the features of textual reviews, which affect the reliability of the review-to-rating conversion procedure, (2) we compute a confidence level for each rating, which reflects the uncertainty level for each conversion process, (3) we exploit this metric both in the users{\textquoteright} similarity computation and in the prediction formulation phases in recommender systems, by presenting a novel rating prediction algorithm and (4) we validate the accuracy of the presented algorithm in terms of (i) rating prediction accuracy, using widely-used recommender systems datasets and (ii) recommendations generated for social network user satisfaction and precision, where textual reviews are abundant.

}, keywords = {collaborative filtering, Confidence level, Feature selection, Rating prediction using textual information, Recommender Systems}, doi = {https://doi.org/10.1016/j.ipm.2020.102304}, author = {Dionisis Margaris and Costas Vassilakis and Dimitris Spiliotopoulos} } @article {722, title = {Handling uncertainty in social media textual information for improving venue recommendation formulation quality in social networks}, journal = {Social Network Analysis and Mining}, volume = {9}, year = {2019}, month = {Oct}, pages = {64}, abstract = {One of the major problems that social media front is to continuously produce successful, user-targeted information, in the form of recommendations, which are produced by applying methods from the area of recommender systems. One of the most important applications of recommender systems in social networks is venue recommendation, targeted by the majority of the leading social networks (Facebook, TripAdvisor, OpenTable, etc.). However, recommender systems{\textquoteright} algorithms rely only on the existence of numeric ratings which are typically entered by users, and in the context of social networks, this information is scarce, since many social networks allow only reviews, rather than explicit ratings. Even if explicit ratings are supported, users may still resort to expressing their views and rating their experiences through submitting posts, which is the predominant user practice in social networks, rather than entering explicit ratings. User posts contain textual information, which can be exploited to compute derived ratings, and these derived ratings can be used in the recommendation process in the lack of explicitly entered ratings. Emerging recommender systems encompass this approach, without however tackling the fact that the ratings computed on the basis of textual information may be inaccurate, due to the very nature of the computation process. In this paper, we present an approach which extracts features of the textual information, a widely available source of information in venue category, to compute a confidence metric for the ratings that are computed from texts; then, this confidence metric is used in the user similarity computation and venue rating prediction formulation process, along with the computed rating. Furthermore, we propose a venue recommendation method that considers the generated venue rating predictions, along with venue QoS, similarity and spatial distance metrics in order to generate venue recommendations for social network users. Finally, we validate the accuracy of the rating prediction method and the user satisfaction from the recommendations generated by the recommendation formulation algorithm. Conclusively, the introduction of the confidence level significantly improves rating prediction accuracy, leverages the ability to generate personalized recommendations for users and increases user satisfaction.}, keywords = {collaborative filtering, Confidence level, Rating prediction, Recommender Systems, Social Networks, Textual information, Uncertainty, Venue recommendation formulation}, issn = {1869-5469}, doi = {10.1007/s13278-019-0610-x}, url = {https://doi.org/10.1007/s13278-019-0610-x}, author = {Dionisis Margaris and Costas Vassilakis and Spiliotopoulos, Dimitris} } @conference {margarisIISA_CIRPaC, title = {Improving Collaborative Filtering{\textquoteright}s Rating Prediction Accuracy by Introducing the Common Item Rating Past Criterion}, booktitle = {Proceedings of the 10th International Conference on Information, Intelligence, Systems and Applications (IISA2019)}, year = {2019}, month = {jul}, abstract = {Collaborative filtering computes personalized recommendations by taking into account ratings expressed by users. Collaborative filtering algorithms firstly identify people having similar tastes, by examining the likeness of already entered ratings. Users with highly similar tastes are termed {\textquotedblleft}near neighbors{\textquotedblright} and recommendations for a user are based on his near neighbors{\textquoteright} ratings. In order to measure similarity between users, so as to determine a user{\textquoteright}s NNs, a similarity metric is used. Insofar, similarity metrics proposed in the literature either consider all user ratings equally or take into account temporal variations within the users{\textquoteright} or items{\textquoteright} ratings history. However users{\textquoteright} ratings are co-shaped according to the experiences that they had in the past; therefore if two users enter similar (or dissimilar) ratings for an item while having experienced {\textendash}to a large extent the same items in the past, this constitutes stronger evidence about user similarity (or dissimilarity). Insofar however, no similarity metric takes into account this aspect. In this work, we (1) propose an algorithm that considers the common item rating past in the rating prediction computation process, aiming to improve rating prediction quality, and (2) evaluate the proposed algorithm against seven widely used datasets, both dense and sparse, and considering two widely used user similarity metrics.}, keywords = {collaborative filtering, Common Item Rating Past Criterion, Cosine Similarity, Evaluation, Items{\textquoteright} Rating Sequence, Pearson Correlation Coeffi-cient}, author = {Dionisis Margaris and Dionysios Vasilopoulos and Costas Vassilakis and Dimitris Spiliotopoulos} } @conference {margaris_iisa2019_VNNs, title = {Improving Collaborative Filtering{\textquoteright}s Rating Prediction Coverage in Sparse Datasets through the Introduction of Virtual Near Neighbors}, booktitle = {Proceedings of the 10th International Conference on Information, Intelligence, Systems and Applications (IISA2019)}, year = {2019}, month = {jul}, abstract = {Collaborative filtering creates personalized recommendations by considering ratings entered by users. Collaborative filtering algorithms initially detect users whose likings are alike, by ex-ploring the similarity between ratings that have insofar been submitted. Users having a high degree of similarity regarding their ratings are termed near neighbors, and in order to formu-late a recommendation for a user, her near neighbors{\textquoteright} ratings are extracted and form the basis for the recommendation. Col-laborative filtering algorithms however exhibit the problem commonly referred to as {\textquotedblleft}gray sheep{\textquotedblright}: this pertains to the case where for some users no near neighbors can be identified, and hence no personalized recommendations can be computed. The {\textquotedblleft}gray sheep{\textquotedblright} problem is more severe in sparse datasets, i.e. datasets where the number of ratings is small, compared to the number of items and users. In this paper, we address the {\textquotedblleft}gray sheep{\textquotedblright} problem by introducing the concept of virtual near neighbors and a related algorithm for their creation on the basis of the existing ones. We evaluate the proposed algorithm, which is termed as CFVNN, using eight widely used datasets and consid-ering two correlation metrics which are widely used in Collabo-rative Filtering research, namely the Pearson Correlation Coef-ficient and the Cosine Similarity. The results show that the pro-posed algorithm considerably leverages the capability of a Col-laborative Filtering system to compute personalized recommen-dations in the context of sparse datasets, tackling thus efficiently the {\textquotedblleft}gray sheep{\textquotedblright} problem. In parallel, the CFVNN algorithm achieves improvements in rating prediction quality, as this is expressed through the Mean Absolute Error and the Root Mean Square Error metrics.}, keywords = {collaborative filtering, Cosine Similarity, Evaluation, Pearson Correlation Coefficient, Sparse Datasets, Virtual Near Neighbors}, author = {Dionisis Margaris and Dionysios Vasilopoulos and Costas Vassilakis and Dimitris Spiliotopoulos} } @conference {716, title = {Improving Collaborative Filtering{\textquoteright}s Rating Prediction Quality by Exploiting the Item Adoption Eagerness Information}, booktitle = {Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence}, year = {2019}, publisher = {ACM}, organization = {ACM}, abstract = {Collaborative filtering computes personalized recommendations by taking into account ratings expressed by users. Collaborative filtering algorithms firstly identify people having similar tastes, who are termed as {\textquotedblleft}near neighbors" and recommendations for a user, are based on his near neighbors{\textquoteright} ratings. On the other hand, people exhibit different levels of eagerness to adopt new products: according to this characteristic, there is a set of users, termed as {\textquotedblleft}Early Adopters", who are prone to start using a product or technology as soon as it becomes available, in contrast to the majority of users, who prefer to start using items once they reach maturity; this important aspect of user behavior is not taken into account by existing algorithms. In this work, we (1) propose an algorithm that considers the eagerness shown by users to adopt products, aiming to improve rating prediction quality and (2) evaluate the proposed algorithm against seven widely used datasets.}, keywords = {collaborative filtering, Cosine Similarity, Evaluation, item adoption eagerness, Pearson Correlation Coefficient, rating prediction quality}, isbn = {978-1-4503-6934-3}, doi = {10.1145/3350546.3352544}, author = {Dionisis Margaris and Dimitris Spiliotopoulos and Costas Vassilakis} } @conference {Margaris_2019_asonam, title = {Social Relations versus Near Neighbours: Reliable Recommenders in Limited Information Social Network Collaborative Filtering for Online Advertising}, booktitle = {Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2019)}, year = {2019}, month = {aug}, abstract = {Online advertising benefits by recommender systems since the latter analyse reviews and rating of products, providing useful insight of the buyer perception of products and services. When traditional recommender system information is enriched with social network information, more successful recommendations are produced, since more users{\textquoteright} aspects are taken into consid-eration. However, social network information may be unavaila-ble since some users may not have social network accounts or may not consent to their use for recommendations, while rating data may be unavailable due to the cold start phenomenon. In this paper, we propose an algorithm that combines limited col-laborative filtering information, comprised only of users{\textquoteright} ratings on items, with limited social network information, com-prised only of users{\textquoteright} social relations, in order to improve (1) prediction accuracy and (2) prediction coverage in collaborative filtering recommender systems, at the same time. The proposed algorithm considerably improves rating prediction accuracy and coverage, while it can be easily integrated in recommender systems.}, keywords = {collaborative filtering, Evaluation, Limited Information, Near Neighbours, Online Advertising, Pearson Correlation Coefficient, Social Networks}, author = {Dionisis Margaris and Dimitris Spiliotopoulos and Costas Vassilakis} } @article {margaris2018a, title = {Exploiting Rating Abstention Intervals for Addressing Concept Drift in Social Network Recommender Systems}, journal = {Informatics}, volume = {5}, number = {2}, year = {2018}, month = {apr}, pages = {21 pages}, abstract = {One of the major problems that social networks face is the continuous production of successful, user-targeted information in the form of recommendations, which are produced exploiting technology from the field of recommender systems. Recommender systems are based on information about users{\textquoteright} past behavior to formulate recommendations about their future actions. However, as time goes by, social network users may change preferences and likings: they may like different types of clothes, listen to different singers or even different genres of music and so on. This phenomenon has been termed as concept drift. In this paper: (1) we establish that when a social network user abstains from rating submission for a long time, it is a strong indication that concept drift has occurred and (2) we present a technique that exploits the abstention interval concept, to drop from the database ratings that do not reflect the current social network user{\textquoteright}s interests, thus improving prediction quality.}, keywords = {collaborative filtering, concept drift, Evaluation, Recommender Systems, shift of interest, Social Networks}, doi = {10.3390/informatics5020021}, url = {http://www.mdpi.com/2227-9709/5/2/21}, author = {Dionisis Margaris and Costas Vassilakis} } @conference {margarisDatacom2018a, title = {Improving Collaborative Filtering{\textquoteright}s Rating Prediction Accuracy by Considering Users{\textquoteright} Rating Variability}, booktitle = {2018 IEEE 16th Intl Conf on Dependable, Autonomic and Secure Computing, 16th Intl Conf on Pervasive Intelligence and Computing, 4th Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech)}, year = {2018}, publisher = {IEEE}, organization = {IEEE}, abstract = {When rating predictions are computed in user-user collaborative filtering, each individual rating is typically adjusted by the mean of the ratings entered by the specific user. This practice takes into account the fact that users follow different rating practices, in the sense that some are stricter when rating items, while others are more lenient. However, users{\textquoteright} rating practices may also differ in rating variability, in the sense that some user may be entering ratings close to her mean, while another user may be entering more extreme ratings, close to the limits of the rating scale. In this work, we (1) propose an algorithm that considers users{\textquoteright} ratings variability in the rating prediction computation process, aiming to improve rating prediction quality and (2) evaluate the proposed algorithm against seven widely used datasets considering three widely used variability measures and two user similarity metrics. The proposed algorithm, using the {\textquotedblleft}mean absolute deviation around the mean{\textquotedblright} variability measure, has been found to intro-duce considerable gains in rating prediction accuracy, in every dataset and under both user similarity metrics tested.}, keywords = {collaborative filtering, Cosine Similarity, Evaluation, Pearson Correlation Coefficient, Users{\textquoteright} Ratings Variability}, doi = {10.1109/DASC/PiCom/DataCom/CyberSciTec.2018.00145}, url = {https://ieeexplore.ieee.org/document/8512012}, author = {Dionisis Margaris and Costas Vassilakis} } @conference {margarisDatacom2018b, title = {Improving Collaborative Filtering{\textquoteright}s Rating Prediction Coverage in Sparse Datasets by Exploiting User Dissimilarity}, booktitle = {2018 IEEE 16th Intl Conf on Dependable, Autonomic and Secure Computing, 16th Intl Conf on Pervasive Intelligence and Computing, 4th Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech)}, year = {2018}, month = {aug}, publisher = {IEEE}, organization = {IEEE}, abstract = {Collaborative filtering systems analyze the ratings databases to identify users with similar likings and preferences, termed as near neighbors, and then generate rating predictions for a user by examining the ratings of his near neighbors for items that the user has not yet rated; based on rating predictions, recommenda-tions are then formulated. However, these systems are known to exhibit the {\textquotedblleft}gray sheep{\textquotedblright} problem, i.e. the situation where no near neighbors can be identified for a number of users, and hence no recommendation can be formulated for them. This problem is more intense in sparse datasets, i.e. datasets with relatively small number of ratings, compared to the number of users and items. In this work, we propose a method for alleviating this problem by exploiting user dissimilarity, under the assumption that if some users have exhibited opposing preferences in the past, they are likely to do so in the future. The proposed method has been eval-uated against seven widely used datasets and has been proven to be particularly effective in increasing the percentage of users for which personalized recommendations can be formulated in the context of sparse datasets, while at the same time maintaining or slightly improving rating prediction quality.}, keywords = {collaborative filtering, Evaluation, Negative Correlation, Pearson Correlation Coefficient, Sparse Datasets, User-User Correlation}, doi = {10.1109/dasc/picom/datacom/cyberscitec.2018.00150}, url = {https://ieeexplore.ieee.org/document/8512017}, author = {Dionisis Margaris and Costas Vassilakis} } @article {margaris-soca-17, title = {Exploiting Internet of Things information to enhance venues{\textquoteright} recommendation accuracy}, journal = {Service Oriented Computing and Applications}, volume = {todb}, year = {2017}, month = {aug}, pages = {393{\textendash}409}, publisher = {Springer Nature}, abstract = {In this paper, we introduce a novel recommendation algorithm, which exploits data sourced from web services provided by the Internet of Things in order to produce more accurate venue recommendations. The proposed algorithm provides added value for the web services offered by the Internet of Things and enhances the state-of-the-art in this algorithm category by taking into account (a) web of things data regarding the contexts of the user and the context of the venues to be recommended (restaurants, movie theatres, etc.), such as the user{\textquoteright}s geographical position, road traffic and weather conditions, (b) qualitative aspects of the venues, such as price, atmosphere or service, (c) the semantic similarity of venues and (d) the influencing factors between social network users, derived from user participation in social networks. The combination of these features leads to more accurate and better user-targeted recommendations. We also present a framework which incorporates the above characteristics, and we evaluate the presented algorithm, both in terms of performance and recommendation quality.}, keywords = {collaborative filtering, Evaluation, Internet of Things, performance, Recommendation Applications, Social Networks, Web services}, doi = {10.1007/s11761-017-0216-y}, url = {https://link.springer.com/article/10.1007/s11761-017-0216-y}, author = {Dionisis Margaris and Costas Vassilakis} } @inbook {marg16d, title = {Knowledge-Based Leisure Time Recommendations in Social Networks}, booktitle = {Current Trends on Knowledge-Based Systems}, series = {Intelligent Systems Reference Library}, year = {2017}, pages = {23{\textendash}48}, publisher = {Springer International Publishing}, organization = {Springer International Publishing}, chapter = {Knowledge-Based Leisure Time Recommendations in Social Networks}, abstract = {We introduce a novel knowledge-based recommendation algorithm for leisure time information to be used in social networks, which enhances the state-of-the-art in this algorithm category by taking into account (a) qualitative aspects of the recommended places (restaurants, museums, tourist attractions etc.), such as price, service and atmosphere, (b) influencing factors between social network users, (c) the semantic and geographical distance between locations and (d) the semantic categorization of the places to be recommended. The combination of these features leads to more accurate and better user-targeted leisure time recommendations.}, keywords = {Attribute constraints, collaborative filtering, Knowledge-based Recommender Systems, Semantic Information, Social Networks}, doi = {10.1007/978-3-319-51905-0_2}, author = {Dionisis Margaris and Costas Vassilakis and P. Georgiadis}, editor = {Giner Alor Hernandez and Rafael Valencia Garcia} } @article {margaris-csimq-2017, title = {Using Time Clusters for Following Users{\textquoteright} Shifts in Rating Practices}, journal = {Complex Systems Informatics and Modeling Quarterly}, volume = {13}, year = {2017}, abstract = {Users that enter ratings for items follow different rating practices, in the sense that, when rating items, some users are more lenient, while others are stricter. This aspect is taken into account by the most widely used similarity metric in user-user collaborative filtering, namely, the Pearson Correlation, which adjusts each individual user rating by the mean value of the ratings entered by the specific user, when computing similarities. However, a user{\textquoteright}s rating practices change over time, i.e. a user could start as strict and subsequently become lenient or vice versa. In that sense, the practice of using a single mean value for adjusting users{\textquoteright} ratings is inadequate, since it fails to follow such shifts in users{\textquoteright} rating practices, leading to decreased rating prediction accuracy. In this work, we address this issue by using the concept of dynamic averages introduced earlier and we extend earlier work by (1) introducing the concept of rating time clusters and (2) presenting a novel algorithm for calculating dynamic user averages and exploiting them in user-user collaborative, filtering implementations. The proposed algorithm incorporates the aforementioned concept and is able to follow more successfully shifts in users{\textquoteright} rating practices. It has been evaluated using numerous datasets, and has been found to introduce significant gains in rating prediction accuracy, while outperforming the dynamic average computation approaches that are presented earlier.}, keywords = {collaborative filtering, Dynamic Average, Rating Abstention Interval, Rating Time Clusters, Ratings{\textquoteright} Timestamps, Recommender Systems}, issn = {2255-9922}, doi = {10.7250/csimq.2017-13.02}, author = {Dionisis Margaris and Costas Vassilakis} } @conference {marg15a, title = {A Collaborative Filtering Algorithm with Clustering for Personalized Web Service Selection in Business Processes}, booktitle = {Proceedings of RCIS 2015}, year = {2015}, month = {5}, abstract = {Recommender systems aim to propose items that are expected to be of interest to the users. As one of the most successful approaches to building recommender systems, collaborative filtering exploits the known preferences of a group of users to formulate recommendations or predictions of the unknown preferences for other users. In many cases, collaborative filtering algorithms handle complex items, which are described using hierarchical tree structures containing rich semantic information. In order to make accurate recommendations on such items, the related algorithms must examine all aspects of the available semantic information. Thus, when collaborative filtering techniques are employed to adapt the execution of business processes, they must take into account the services{\textquoteright} Quality of Service parameters, so as to generate recommendations tailored to the individual user needs. In this paper, we present a collaborative filtering-based algorithm which takes into account the web services{\textquoteright} QoS parameters in order to tailor the execution of business processes to the preferences of users. An offline clustering technique is also introduced for supporting the efficient and scalable execution of proposed algorithm under the presence of large repositories of sparse data.}, keywords = {business processes, clustering, collaborative filtering, hierarchical tree, performance, Quality of service, Web services}, doi = {10.1109/RCIS.2015.7128877}, author = {Dionisis Margaris and P. Georgiadis and Costas Vassilakis} }