中文
相关论文

相关论文: Influence Maximization Meets Efficiency and Effect…

200 篇论文

Influence maximization is among the most fundamental algorithmic problems in social influence analysis. Over the last decade, a great effort has been devoted to developing efficient algorithms for influence maximization, so that identifying…

社会与信息网络 · 计算机科学 2020-03-24 Naoto Ohsaka

Due to much closer to real application scenarios,the budgeted influence maximization (BIM) problem has attracted great attention among researchers. As a variant of the influence maximization (IM) problem, the BIM problem aims at mining…

社会与信息网络 · 计算机科学 2022-03-23 Jianshe Wu , Junjun Gao , Hongde Zhu , Zulei Zhang

Influence maximization (IM) is an important topic in network science where a small seed set is chosen to maximize the spread of influence on a network. Recently, this problem has attracted attention on temporal networks where the network…

社会与信息网络 · 计算机科学 2023-07-04 Eric Yanchenko , Tsuyoshi Murata , Petter Holme

We address the problem of influence maximization when the social network is accompanied by diffusion cascades. In prior works, such information is used to compute influence probabilities, which is utilized by stochastic diffusion models in…

社会与信息网络 · 计算机科学 2020-11-23 George Panagopoulos , Fragkiskos D. Malliaros , Michalis Vazirgiannis

The influence maximization paradigm has been used by researchers in various fields in order to study how information spreads in social networks. While previously the attention was mostly on efficiency, more recently fairness issues have…

社会与信息网络 · 计算机科学 2021-11-10 Ruben Becker , Gianlorenzo D'Angelo , Sajjad Ghobadi , Hugo Gilbert

The problem of finding the optimal set of source nodes in a diffusion network that maximizes the spread of information, influence, and diseases in a limited amount of time depends dramatically on the underlying temporal dynamics of the…

社会与信息网络 · 计算机科学 2012-05-09 Manuel Gomez Rodriguez , Bernhard Schölkopf

We study the task of selecting $k$ nodes, in a social network of size $n$, to seed a diffusion with maximum expected spread size, under the independent cascade model with cascade probability $p$. Most of the previous work on this problem…

社会与信息网络 · 计算机科学 2022-05-24 Dean Eckles , Hossein Esfandiari , Elchanan Mossel , M. Amin Rahimian

The influence maximization (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…

社会与信息网络 · 计算机科学 2021-06-15 Haipeng Chen , Wei Qiu , Han-Ching Ou , Bo An , Milind Tambe

Influence diffusion and influence maximization in large-scale online social networks (OSNs) have been extensively studied, because of their impacts on enabling effective online viral marketing. Existing studies focus on social networks with…

社会与信息网络 · 计算机科学 2012-12-04 Yanhua Li , Wei Chen , Yajun Wang , Zhi-Li Zhang

Finding the most influential nodes in a network is a computationally hard problem with several possible applications in various kinds of network-based problems. While several methods have been proposed for tackling the influence…

社会与信息网络 · 计算机科学 2022-08-17 Elia Cunegatti , Giovanni Iacca , Doina Bucur

Influence maximization (IM) is one of the most important problems in social network analysis. Its objective is to find a given number of seed nodes that maximize the spread of information through a social network. Since it is an NP-hard…

社会与信息网络 · 计算机科学 2020-10-27 Jihoon Ko , Kyuhan Lee , Kijung Shin , Noseong Park

We study the problem of online influence maximization in social networks. In this problem, a learner aims to identify the set of "best influencers" in a network by interacting with it, i.e., repeatedly selecting seed nodes and observing…

机器学习 · 计算机科学 2019-07-17 Qingyun Wu , Zhige Li , Huazheng Wang , Wei Chen , Hongning Wang

We identify influential early adopters that achieve a target behavior distribution for a resource constrained social network with multiple costly behaviors. This problem is important for applications ranging from collective behavior change…

社会与信息网络 · 计算机科学 2013-03-26 Kaushik Sarkar , Hari Sundaram

The Influence Maximization (IM) problem is a well-known NP-hard combinatorial problem over graphs whose goal is to find the set of nodes in a network that spreads influence at most. Among the various methods for solving the IM problem,…

社会与信息网络 · 计算机科学 2024-05-17 Stefano Genetti , Eros Ribaga , Elia Cunegatti , Quintino Francesco Lotito , Giovanni Iacca

Influence Maximization (IM), which aims to select a set of users from a social network to maximize the expected number of influenced users, is an evergreen hot research topic. Its research outcomes significantly impact real-world…

社会与信息网络 · 计算机科学 2025-03-28 Taotao Cai , Quan Z. Sheng , Xiangyu Song , Jian Yang , Shuang Wang , Wei Emma Zhang , Jia Wu , Philip S. Yu

We consider the problem of selecting $k$ seed nodes in a network to maximize the minimum probability of activation under an independent cascade beginning at these seeds. The motivation is to promote fairness by ensuring that even the least…

Influence maximization in networks is a central problem in machine learning and causal inference, where an intervention on a subset of individuals triggers a diffusion process through the network. Existing approaches typically optimize…

统计方法学 · 统计学 2026-03-13 Renjie Cao , Zhuoxin Yan , Xinyan Su , Zhiheng Zhang

In social online platforms, identifying influential seed users to maximize influence spread is a crucial as it can greatly diminish the cost and efforts required for information dissemination. While effective, traditional methods for…

社会与信息网络 · 计算机科学 2025-01-03 Huyen Nguyen , Hieu Dam , Nguyen Do , Cong Tran , Cuong Pham

Public opinion governance in social networks is critical for public health campaigns, political elections, and commercial marketing. In this paper, we addresse the problem of maximizing overall opinion in social networks by strategically…

社会与信息网络 · 计算机科学 2026-03-12 Gengyu Wang , Runze Zhang , Zhongzhi Zhang

We consider the problem of selecting a seed set to maximize the expected number of influenced nodes in the social network, referred to as the \textit{influence maximization} (IM) problem. We assume that the topology of the social network is…

机器学习 · 计算机科学 2019-11-26 Xiaojin Zhang