@article {818, title = {Disruptive Technologies for Parliaments: A Literature Review}, journal = {Future Internet}, volume = {15}, year = {2023}, month = {feb}, pages = {66}, abstract = {

Exploitation and use of disruptive technologies, such as the Internet of Things, recommender systems, and artificial intelligence, with an ambidextrous balance, are a challenge, nowadays. Users of the technologies, and stakeholders, could be part of a new organisational model that affects business procedures and processes. Additionally, the use of inclusive participatory organisational models is essential for the effective adoption of these technologies. Such models aim to transform organisational structures, as well. Public organisations, such as the parliament, could utilise information systems{\textquoteright} personalisation techniques. As there are a lot of efforts to define the framework, the methodology, the techniques, the platforms, and the suitable models for digital technologies adoption in public organisations, this paper aims to provide a literature review for disruptive technology inclusive use in parliaments. The review emphasises the assessment of the applicability of the technologies, their maturity and usefulness, user acceptance, their performance, and their correlation to the adoption of relevant innovative, inclusive organisational models. It is argued that the efficient digital transformation of democratic institutions, such as parliaments, with the use of advanced e-governance tools and disruptive technologies, requires strategic approaches for adoption, acceptance, and inclusive service adaptation.

}, keywords = {artificial intelligence, digital transformation, inclusiveness, Internet of Things, parliament, Recommender Systems}, doi = {https://doi.org/10.3390/fi15020066}, url = {https://www.mdpi.com/1999-5903/15/2/66}, author = {Dimitris Koryzis and Dionisis Margaris and Costas Vassilakis and Konstantinos Kotis and Dimitris Spiliotopoulos} } @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 {830, title = {A User Interface for Tuning QoS parameters in Recommendation-Based Business Process Scenario Adaptation}, booktitle = {Proceedings of the 19th International Conference on Web Information Systems and Technologies (WEBIST 2023)}, year = {2023}, abstract = {

The Web Services Business Process Execution Language (BPEL) is a special-purpose language that orchestrates web services into a high-level business process. A typical BPEL scenario contains invocations to preselected web services, along with their parameters. However, many recent research works support dynamic service selection, based on user-set policies and criteria. Furthermore, users may request a service recommendation, in which case functionally equivalent service offerings by different providers will be considered by the personalization module. Along with the recommendation request, users provide the policy parameters, which include minimum and maximum bounds for the non-functional attributes concerning the service, and the system exploits these bounds to select and use the optimal candidate services. However, in many real-life cases, a person will accept/purchase a product or a service that exceeds the threshold(s) that initially he/she has set, e.g. if the overhead is marginal or the offer is deemed appealing, or no satisfactory service candidates are identified using the initial settings. In this paper, we present and evaluate a specialized User Interface that allows the user to review service candidates marginally exceeding the specified bounds, and consider them while making the final service selection.

}, keywords = {adaptation, business processes, Personalisation, Recommendation, Recommender Systems, UI, Web services, WS-BPEL}, author = {Kiriakos Sgardelis and Dionisis Margaris and Dimitris Spiliotopoulos 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} } @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 {771, title = {An Adaptive Social Network-Aware Collaborative Filtering Algorithm for Improved Rating Prediction Accuracy}, journal = {IEEE Access}, volume = {8}, year = {2020}, pages = {68301{\textendash}68310}, abstract = {When information from traditional recommender systems is augmented with information about user relationships that social networks store, more successful recommendations can be produced. However, this information regarding user relationships may not always be available, since some users may not consent to the use of their social network information for recommendations or may not have social network accounts at all. Moreover, the rating data (categories and characteristics of products) may be unavailable for a recommender system. In this paper, we present an algorithm that can be applied in any social network-aware recommender system that utilizes the users{\textquoteright} ratings on items and users{\textquoteright} social relations. The proposed algorithm addresses the issues of limited social network information or limited collaborative filtering information for some users by adapting its behavior, taking into account the density and utility of each user{\textquoteright}s social network and collaborative filtering neighborhoods. Through this adaptation, the proposed algorithm achieves considerable improvement in rating prediction accuracy. Furthermore, the proposed algorithm can be easily implemented in recommender systems}, keywords = {Performance evaluation, Recommender Systems, Social computing}, issn = {2169-3536}, doi = {10.1109/access.2020.2981567}, author = {Dionisis Margaris and Anna Kobusinska 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 {723, title = {A Fine-grained Social Network Recommender System}, journal = {Social Network Analysis and Mining}, volume = {10}, year = {2020}, abstract = {Recommender systems have greatly evolved in recent years and have become an integral part of the Web. From e-commerce sites to mobile apps, our daily routine revolves around a series of {\textquotedblleft}small{\textquotedblright} decisions that are influenced by such recommendations. In a similar manner, online social networks recommend only a subset of the massive amount of content published by a user{\textquoteright}s friends. However, the prevalent approach for the content selection process in such systems is driven by the amount of interaction between the user and the friend who published the content. As a result, content of interest is often lost due to weak social ties. In this paper, we present a fine-grained recommender system for social ecosystems, designed to recommend media content (e.g., music videos, online clips) published by the user{\textquoteright}s friends. The system design was driven by the findings of our qualitative user study that explored the value and requirements of a recommendation component within a social network. The core idea behind the proposed approach was to leverage the abundance of preexisting information in each user{\textquoteright}s account for creating interest profiles, to calculate similarity scores at a fine-grained level for each friend. The intuition behind the proposed method was to find consistent ways to obtain information representations that can identify overlapping interests in very specific sub-categories (e.g., two users{\textquoteright} music preferences may only coincide on hard rock). While the system is intended as a component of the social networking service, we developed a proof-of-concept implementation for Facebook and explored the effectiveness of our underlying mechanisms for content analysis. Our experimental evaluation demonstrates the effectiveness of our approach, as the recommended content of interest was both overlooked by the existing Facebook engine and not contained in the users{\textquoteright} Facebook News Feed. We also conducted a user study for exploring the usability aspects of the prototype and found that it offers functionality that could significantly improve user experience in popular services.}, keywords = {Content Analysis, Interest Profiles, Recommender Systems, Social Networks, Usability}, issn = {1869-5469}, doi = {10.1007/s13278-019-0621-7}, author = {Markos Aivazoglou and Antonios Roussos and Dionisis Margaris and Costas Vassilakis and Sotiris Ioannidis and Jason Polakis and Dimitris Spiliotopoulos} } @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} }