Abstract

In this work, we consider the joint behavior of an information diffusion process integrated with a recommender system (RecSys) over an online social network (OSN), where the typical users' resilience to information varies, leading to potential information overloads. We assume that each user has a threshold over the information that she can process in a meaningful way, and exceeding it could lead to user dissatisfaction or the user remaining idle. In order to efficiently tackle this issue, while considering complex user constraints, we consider two types of users' capacity to information, that is, capacity for distinct items and capacity for duplicate items. In this setting, we aim to allocate the items in the OSN in order to maximize users' total relevance to the former while ensuring that no user exceeds any type of capacity. We show that this problem is NP-complete and present various heuristic methods to address it. A novel framework, called socially constrained recommendations (SCoRe), is developed for the final assignment of items to users, consisting of a two-step procedure. We present and evaluate two different approaches for each step and discuss the usability of SCoRe for the efficient diffusion of items in the network while respecting the users' constraints.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.