@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 = {<p>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.</p>
},
	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 {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}
}
@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}
}
