Identifying Influential Users in Unknown Social Networks for Adaptive Incentive Allocation Under Budget Restriction

• URL: http://arxiv.org/abs/2107.05992v2
• Date: Wed, 14 Jul 2021 13:16:25 GMT
• Title: Identifying Influential Users in Unknown Social Networks for Adaptive Incentive Allocation Under Budget Restriction
• Authors: Shiqing Wu, Weihua Li, Hao Shen, Quan Bai
• Abstract summary: Incentivization has been proven to be a more proactive way to affect users' behaviors. We propose a novel algorithm for exploring influential users in unknown networks. We design an adaptive incentive allocation approach that determines incentive values based on users' preferences and their influence ability.
• Score: 24.793013471521924
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In recent years, recommendation systems have been widely applied in many domains. These systems are impotent in affecting users to choose the behavior that the system expects. Meanwhile, providing incentives has been proven to be a more proactive way to affect users' behaviors. Due to the budget limitation, the number of users who can be incentivized is restricted. In this light, we intend to utilize social influence existing among users to enhance the effect of incentivization. Through incentivizing influential users directly, their followers in the social network are possibly incentivized indirectly. However, in many real-world scenarios, the topological structure of the network is usually unknown, which makes identifying influential users difficult. To tackle the aforementioned challenges, in this paper, we propose a novel algorithm for exploring influential users in unknown networks, which can estimate the influential relationships among users based on their historical behaviors and without knowing the topology of the network. Meanwhile, we design an adaptive incentive allocation approach that determines incentive values based on users' preferences and their influence ability. We evaluate the performance of the proposed approaches by conducting experiments on both synthetic and real-world datasets. The experimental results demonstrate the effectiveness of the proposed approaches.

Related papers

• Exploiting Preference Elicitation in Interactive and User-centered Algorithmic Recourse: An Initial Exploration [12.24579785420358]
  Algorithmic Recourse aims to provide actionable explanations, or recourse plans, to overturn potentially unfavourable decisions taken by automated machine learning models. We propose an interaction paradigm based on a guided interaction pattern aimed at both eliciting the users' preferences and heading them toward effective recourse interventions.
  arXiv  Detail & Related papers  (2024-04-08T08:00:05Z)
• Effect of recommending users and opinions on the network connectivity and idea generation process [0.1843404256219181]
  This study investigates how recommendation systems influence the impact of personal behavioral traits on social network dynamics. It explores the interplay between homophily, users' openness to novel ideas, and recommendation-driven exposure to new opinions.
  arXiv  Detail & Related papers  (2024-01-29T19:22:24Z)
• Decoding the Silent Majority: Inducing Belief Augmented Social Graph with Large Language Model for Response Forecasting [74.68371461260946]
  SocialSense is a framework that induces a belief-centered graph on top of an existent social network, along with graph-based propagation to capture social dynamics. Our method surpasses existing state-of-the-art in experimental evaluations for both zero-shot and supervised settings.
  arXiv  Detail & Related papers  (2023-10-20T06:17:02Z)
• Debiasing Recommendation by Learning Identifiable Latent Confounders [49.16119112336605]
  Confounding bias arises due to the presence of unmeasured variables that can affect both a user's exposure and feedback. Existing methods either (1) make untenable assumptions about these unmeasured variables or (2) directly infer latent confounders from users' exposure. We propose a novel method, i.e., identifiable deconfounder (iDCF), which leverages a set of proxy variables to resolve the aforementioned non-identification issue.
  arXiv  Detail & Related papers  (2023-02-10T05:10:26Z)
• Influential Recommender System [12.765277278599541]
  We present Influential Recommender System (IRS), a new recommendation paradigm that aims to proactively lead a user to like a given objective item. IRS progressively recommends to the user a sequence of carefully selected items (called an influence path) We show that IRN significantly outperforms the baseline recommenders and demonstrates its capability of influencing users' interests.
  arXiv  Detail & Related papers  (2022-11-18T03:04:45Z)
• Personalizing Intervened Network for Long-tailed Sequential User Behavior Modeling [66.02953670238647]
  Tail users suffer from significantly lower-quality recommendation than the head users after joint training. A model trained on tail users separately still achieve inferior results due to limited data. We propose a novel approach that significantly improves the recommendation performance of the tail users.
  arXiv  Detail & Related papers  (2022-08-19T02:50:19Z)
• Preference Enhanced Social Influence Modeling for Network-Aware Cascade Prediction [59.221668173521884]
  We propose a novel framework to promote cascade size prediction by enhancing the user preference modeling. Our end-to-end method makes the user activating process of information diffusion more adaptive and accurate.
  arXiv  Detail & Related papers  (2022-04-18T09:25:06Z)
• GAC: A Deep Reinforcement Learning Model Toward User Incentivization in Unknown Social Networks [3.3946853660795884]
  We propose an end-to-end reinforcement learning-based framework, named Geometric Actor-Critic (GAC), to discover effective incentive allocation policies. We use three real-world social network datasets to evaluate the performance of the proposed GAC.
  arXiv  Detail & Related papers  (2022-03-17T19:41:49Z)
• Relational Graph Neural Networks for Fraud Detection in a Super-App environment [53.561797148529664]
  We propose a framework of relational graph convolutional networks methods for fraudulent behaviour prevention in the financial services of a Super-App. We use an interpretability algorithm for graph neural networks to determine the most important relations to the classification task of the users. Our results show that there is an added value when considering models that take advantage of the alternative data of the Super-App and the interactions found in their high connectivity.
  arXiv  Detail & Related papers  (2021-07-29T00:02:06Z)
• ABEM: An Adaptive Agent-based Evolutionary Approach for Mining Influencers in Online Social Networks [1.6128569396451058]
  A key step in evolutionary influence in online social networks is the identification of a small number of users, known as influencers. The evolving nature of the structure of these networks makes it difficult to locate and identify these influencers. We propose an adaptive agent-based approach to address this problem in the context of both static and dynamic networks.
  arXiv  Detail & Related papers  (2021-04-14T00:31:08Z)
• DiffNet++: A Neural Influence and Interest Diffusion Network for Social Recommendation [50.08581302050378]
  Social recommendation has emerged to leverage social connections among users for predicting users' unknown preferences. We propose a preliminary work of a neural influence diffusion network (i.e., DiffNet) for social recommendation (Diffnet) In this paper, we propose DiffNet++, an improved algorithm of Diffnet that models the neural influence diffusion and interest diffusion in a unified framework.
  arXiv  Detail & Related papers  (2020-01-15T08:45:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.