A Spreader Ranking Algorithm for Extremely Low-budget Influence Maximization in Social Networks using Community Bridge Nodes

• URL: http://arxiv.org/abs/2211.09657v1
• Date: Thu, 17 Nov 2022 16:53:47 GMT
• Title: A Spreader Ranking Algorithm for Extremely Low-budget Influence Maximization in Social Networks using Community Bridge Nodes
• Authors: Aaryan Gupta, Inder Khatri, Arjun Choudhry, Pranav Chandhok, Dinesh Kumar Vishwakarma, Mukesh Prasad
• Abstract summary: The aim of Influence Maximisation (IM) is to identify certain nodes in the network which can help maximize the spread of certain information. We propose a community structures-based approach, which employs a K-Shell algorithm in order to generate a score for the connections between seed nodes and communities. We choose the Independent Cascade (IC) model to simulate information spread and evaluate it on four evaluation metrics.
• Score: 12.691905338833372
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In recent years, social networking platforms have gained significant popularity among the masses like connecting with people and propagating ones thoughts and opinions. This has opened the door to user-specific advertisements and recommendations on these platforms, bringing along a significant focus on Influence Maximisation (IM) on social networks due to its wide applicability in target advertising, viral marketing, and personalized recommendations. The aim of IM is to identify certain nodes in the network which can help maximize the spread of certain information through a diffusion cascade. While several works have been proposed for IM, most were inefficient in exploiting community structures to their full extent. In this work, we propose a community structures-based approach, which employs a K-Shell algorithm in order to generate a score for the connections between seed nodes and communities for low-budget scenarios. Further, our approach employs entropy within communities to ensure the proper spread of information within the communities. We choose the Independent Cascade (IC) model to simulate information spread and evaluate it on four evaluation metrics. We validate our proposed approach on eight publicly available networks and find that it significantly outperforms the baseline approaches on these metrics, while still being relatively efficient.

Related papers

• Influence Maximization via Graph Neural Bandits [54.45552721334886]
  We set the IM problem in a multi-round diffusion campaign, aiming to maximize the number of distinct users that are influenced. We propose the framework IM-GNB (Influence Maximization with Graph Neural Bandits), where we provide an estimate of the users' probabilities of being influenced.
  arXiv  Detail & Related papers  (2024-06-18T17:54:33Z)
• Fair Information Spread on Social Networks with Community Structure [2.9613974659787132]
  Influence maximiza- tion (IM) algorithms aim to identify individuals who will generate the greatest spread through the social network if provided with information. This work relies on fitting a model to the social network which is then used to determine a seed allocation strategy for optimal fair information spread.
  arXiv  Detail & Related papers  (2023-05-15T16:51:18Z)
• Collaborative Mean Estimation over Intermittently Connected Networks with Peer-To-Peer Privacy [86.61829236732744]
  This work considers the problem of Distributed Mean Estimation (DME) over networks with intermittent connectivity. The goal is to learn a global statistic over the data samples localized across distributed nodes with the help of a central server. We study the tradeoff between collaborative relaying and privacy leakage due to the additional data sharing among nodes.
  arXiv  Detail & Related papers  (2023-02-28T19:17:03Z)
• Cross-Network Social User Embedding with Hybrid Differential Privacy Guarantees [81.6471440778355]
  We propose a Cross-network Social User Embedding framework, namely DP-CroSUE, to learn the comprehensive representations of users in a privacy-preserving way. In particular, for each heterogeneous social network, we first introduce a hybrid differential privacy notion to capture the variation of privacy expectations for heterogeneous data types. To further enhance user embeddings, a novel cross-network GCN embedding model is designed to transfer knowledge across networks through those aligned users.
  arXiv  Detail & Related papers  (2022-09-04T06:22:37Z)
• A Community-Aware Framework for Social Influence Maximization [40.842329580198324]
  We consider the Influence Maximization (IM) problem: 'if we can try to convince a subset of individuals in a social network to adopt a new product or innovation, and the goal is to trigger a large cascade of further adoptions, which set of individuals should we target' We propose a community-aware divide-and-conquer strategy that involves (i) learning the inherent community structure of the social network, (ii) generating candidate solutions by solving the influence problem for each community, and (iii) selecting the final set of individuals from the candidate solutions using a novel progressive budgeting scheme.
  arXiv  Detail & Related papers  (2022-07-18T20:43:17Z)
• 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)
• Contextual Bandits for Advertising Campaigns: A Diffusion-Model Independent Approach (Extended Version) [73.59962178534361]
  We study an influence problem in which little is assumed to be known about the diffusion network or about the model that determines how information may propagate. In this setting, an explore-exploit approach could be used to learn the key underlying diffusion parameters, while running the campaign. We describe and compare two methods of contextual multi-armed bandits, with upper-confidence bounds on the remaining potential of influencers.
  arXiv  Detail & Related papers  (2022-01-13T22:06:10Z)
• CLAIM: Curriculum Learning Policy for Influence Maximization in Unknown Social Networks [14.695979686066062]
  We propose CLAIM - Curriculum LeArning Policy for Influence Maximization to improve the sample efficiency of RL methods. We conduct experiments on real-world datasets and show that our approach can outperform the current best approach.
  arXiv  Detail & Related papers  (2021-07-08T04:52:50Z)
• Contingency-Aware Influence Maximization: A Reinforcement Learning Approach [52.109536198330126]
  influence (IM) problem aims at finding a subset of seed nodes in a social network that maximize the spread of influence. In this study, we focus on a sub-class of IM problems, where whether the nodes are willing to be the seeds when being invited is uncertain, called contingency-aware IM. Despite the initial success, a major practical obstacle in promoting the solutions to more communities is the tremendous runtime of the greedy algorithms.
  arXiv  Detail & Related papers  (2021-06-13T16:42:22Z)
• A multilevel clustering technique for community detection [0.0]
  This study presents a novel detection method based on a scalable framework to identify related communities in a network. We propose a multilevel clustering technique (MCT) that leverages structural and textual information to identify local communities termed microcosms. The approach offers a better understanding and clarity toward describing how low-level communities evolve and behave on Twitter.
  arXiv  Detail & Related papers  (2021-01-16T23:26:44Z)
• 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.