中文
相关论文

相关论文: Influence Maximization with Spontaneous User Adopt…

200 篇论文

We study cascades in social networks with the independent cascade (IC) model and the Susceptible-Infected-recovered (SIR) model. The well-studied IC model fails to capture the feature of node recovery, and the SIR model is a variant of the…

社会与信息网络 · 计算机科学 2025-03-18 Panfeng Liu , Guoliang Qiu , Biaoshuai Tao , Kuan Yang

As a widely observable social effect, influence diffusion refers to a process where innovations, trends, awareness, etc. spread across the network via the social impact among individuals. Motivated by such social effect, the concept of…

社会与信息网络 · 计算机科学 2020-12-24 Liang Ma

User recommendation systems enhance user engagement by encouraging users to act as inviters to interact with other users (invitees), potentially fostering information propagation. Conventional recommendation methods typically focus on…

信息检索 · 计算机科学 2025-08-20 Hongru Hou , Jiachen Sun , Wenqing Lin , Wendong Bi , Xiangrong Wang , Deqing Yang

Influence maximization (IM) is a combinatorial problem of identifying a subset of nodes called the seed nodes in a network (graph), which when activated, provide a maximal spread of influence in the network for a given diffusion model and a…

机器学习 · 计算机科学 2022-05-31 Sai Munikoti , Balasubramaniam Natarajan , Mahantesh Halappanavar

Influence maximization (IM) is a crucial optimization task related to analyzing complex networks in the real world, such as social networks, disease propagation networks, and marketing networks. Publications to date about the IM problem…

社会与信息网络 · 计算机科学 2024-05-16 Xilong Qu , Wenbin Pei , Yingchao Yang , Xirong Xu , Renquan Zhang , Qiang Zhang

In a social network, even about the same information the excitements between different pairs of users are different. If you want to spread a piece of new information and maximize the expected total amount of excitements, which seed users…

社会与信息网络 · 计算机科学 2016-10-26 Zhefeng Wang , Yu Yang , Jian Pei , Enhong Chen

We investigate the novel problem of voting-based opinion maximization in a social network: Find a given number of seed nodes for a target campaigner, in the presence of other competing campaigns, so as to maximize a voting-based score for…

社会与信息网络 · 计算机科学 2022-09-15 Arkaprava Saha , Xiangyu Ke , Arijit Khan , Laks V. S. Lakshmanan

In the context of influence propagation in a social graph, we can identify three orthogonal dimensions - the number of seed nodes activated at the beginning (known as budget), the expected number of activated nodes at the end of the…

离散数学 · 计算机科学 2011-11-08 Amit Goyal , Francesco Bonchi , Laks V. S. Lakshmanan , Suresh Venkatasubramanian

Research on influence maximization has often to cope with marketing needs relating to the propagation of information towards specific users. However, little attention has been paid to the fact that the success of an information diffusion…

社会与信息网络 · 计算机科学 2018-04-23 Antonio Caliò , Roberto Interdonato , Chiara Pulice , Andrea Tagarelli

We consider a ubiquitous scenario in the study of Influence Maximization (IM), in which there is limited knowledge about the topology of the diffusion network. We set the IM problem in a multi-round diffusion campaign, aiming to maximize…

机器学习 · 计算机科学 2024-06-19 Yuting Feng , Vincent Y. F. Tan , Bogdan Cautis

Online influence maximization has attracted much attention as a way to maximize influence spread through a social network while learning the values of unknown network parameters. Most previous works focus on single-item diffusion. In this…

机器学习 · 计算机科学 2022-03-03 Jinhang Zuo , Xutong Liu , Carlee Joe-Wong , John C. S. Lui , Wei Chen

Influence Maximization is an extensively-studied problem that targets at selecting a set of initial seed nodes in the Online Social Networks (OSNs) to spread the influence as widely as possible. However, it remains an open challenge to…

社会与信息网络 · 计算机科学 2017-08-08 Jing Tang , Xueyan Tang , Junsong Yuan

For the purpose of maximizing the spread of influence caused by a certain small number k of nodes in a social network, we are asked to find a k-subset of nodes (i.e., a seed set) with the best capacity to influence the nodes not in it. This…

社会与信息网络 · 计算机科学 2022-06-07 Enqiang Zhu , Haosen Wang , Yu Zhang , Kai Zhang , Chanjuan Liu

In this paper, we study the adversarial attacks on influence maximization under dynamic influence propagation models in social networks. In particular, given a known seed set S, the problem is to minimize the influence spread from S by…

社会与信息网络 · 计算机科学 2022-12-20 Lichao Sun , Xiaobin Rui , Wei Chen

Influence maximization is a problem of finding a small set of highly influential users, also known as seeds, in a social network such that the spread of influence under certain propagation models is maximized. In this paper, we consider…

社会与信息网络 · 计算机科学 2015-07-14 Wei Chen , Wei Lu , Ning Zhang

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…

社会与信息网络 · 计算机科学 2022-11-18 Aaryan Gupta , Inder Khatri , Arjun Choudhry , Pranav Chandhok , Dinesh Kumar Vishwakarma , Mukesh Prasad

A wide array of complex biological, social, and physical systems have recently been shown to be quantitatively described by Ising models, which lie at the intersection of statistical physics and machine learning. Here, we study the…

物理与社会 · 物理学 2018-04-19 Christopher W. Lynn , Daniel D. Lee

Research issues and data mining techniques for product recommendation and viral marketing have been widely studied. Existing works on seed selection in social networks do not take into account the effect of product recommendations in…

社会与信息网络 · 计算机科学 2016-02-16 Hui-Ju Hung , Hong-Han Shuai , De-Nian Yang , Liang-Hao Huang , Wang-Chien Lee , Jian Pei , Ming-Syan Chen

We consider influence maximization (IM) in social networks, which is the problem of maximizing the number of users that become aware of a product by selecting a set of "seed" users to expose the product to. While prior work assumes a known…

机器学习 · 计算机科学 2018-05-25 Sharan Vaswani , Branislav Kveton , Zheng Wen , Mohammad Ghavamzadeh , Laks Lakshmanan , Mark Schmidt

Influence maximization in temporal social networks presents unique challenges due to the dynamic interactions that evolve over time. Traditional diffusion models often fall short in capturing the real-world complexities of active-inactive…

社会与信息网络 · 计算机科学 2025-07-24 Aaqib Zahoor , Iqra Altaf Gillani , Janib ul Bashir