中文
相关论文

相关论文: A Behavioral Analysis on the Reselection of Seed N…

200 篇论文

Influence maximization is the task of selecting a small number of seed nodes in a social network to maximize the influence spread from these seeds. It has been widely investigated in the past two decades. In the canonical setting, the…

社会与信息网络 · 计算机科学 2022-02-21 Zhijie Zhang , Wei Chen , Xiaoming Sun , Jialin Zhang

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

For the purpose of propagating information and ideas through a social network, a seeding strategy aims to find a small set of seed users that are able to maximize the spread of the influence, which is termed as influence maximization…

社会与信息网络 · 计算机科学 2016-07-05 Guangmo Tong , Weili Wu , Shaojie Tang , Ding-Zhu Du

For maximizing influence spread in a social network, given a certain budget on the number of seed nodes, we investigate the effects of selecting and activating the seed nodes in multiple phases. In particular, we formulate an appropriate…

社会与信息网络 · 计算机科学 2015-02-24 Swapnil Dhamal , Prabuchandran K. J. , Y. Narahari

Influence maximization in social networks plays a vital role in applications such as viral marketing, epidemiology, product recommendation, opinion mining, and counter-terrorism. A common approach identifies seed nodes by first detecting…

社会与信息网络 · 计算机科学 2025-12-04 Motaz Ben Hassine

This paper studies the multi-cascade influence maximization problem, which explores strategies for launching one information cascade in a social network with multiple existing cascades. With natural extensions to the classic models, we…

社会与信息网络 · 计算机科学 2019-12-03 Guangmo Tong , Ruiqi Wang , Zheng Dong

We consider the problem of maximizing the spread of influence in a social network by choosing a fixed number of initial seeds --- a central problem in the study of network cascades. The majority of existing work on this problem, formally…

社会与信息网络 · 计算机科学 2016-09-22 Rico Angell , Grant Schoenebeck

The spread of influence in networks is a topic of great importance in many application areas. For instance, one would like to maximise the coverage, limiting the budget for marketing campaign initialisation and use the potential of social…

社会与信息网络 · 计算机科学 2020-09-11 Radosław Michalski , Jarosław Jankowski , Piotr Bródka

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 diffusion of information, norms, and practices across a social network can be initiated by compelling a small number of seed individuals to adopt first. Strategies proposed in previous work either assume full network information or…

物理与社会 · 物理学 2022-02-09 Jiamin Ou , Vincent Buskens , Arnout Van De Rijt , Debabrata Panja

A premise at a heart of network analysis is that entities in a network derive utilities from their connections. The {\em influence} of a seed set $S$ of nodes is defined as the sum over nodes $u$ of the {\em utility} of $S$ to $u$. {\em…

社会与信息网络 · 计算机科学 2016-02-02 Edith Cohen , Daniel Delling , Thomas Pajor , Renato F. Werneck

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 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 problem of finding optimal set of users for influencing others in the social network has been widely studied. Because it is NP-hard, some heuristics were proposed to find sub-optimal solutions. Still, one of the commonly used assumption…

社会与信息网络 · 计算机科学 2014-11-24 Radosław Michalski , Tomasz Kajdanowicz , Piotr Bródka , Przemysław Kazienko

The problem of selecting an optimal seed set to maximise influence in networks has been a subject of intense research in recent years. However, despite numerous works addressing this area, it remains a topic that requires further…

社会与信息网络 · 计算机科学 2025-04-16 Michał Czuba , Piotr Bródka

Finding a small subset of influential nodes to maximise influence spread in a complex network is an active area of research. Different methods have been proposed in the past to identify a set of seed nodes that can help achieve a faster…

社会与信息网络 · 计算机科学 2022-12-23 Abida Sadaf , Luke Mathieson , Piotr Bródka , Katarzyna Musial

We propose a distributionally robust model for the influence maximization problem. Unlike the classic independent cascade model \citep{kempe2003maximizing}, this model's diffusion process is adversarially adapted to the choice of seed set.…

社会与信息网络 · 计算机科学 2022-02-23 Louis Chen , Divya Padmanabhan , Chee Chin Lim , Karthik Natarajan

The problem of maximizing information diffusion, given a certain budget expressed in terms of the number of seed nodes, is an important topic in social networks research. Existing literature focuses on single phase diffusion where all seed…

社会与信息网络 · 计算机科学 2017-06-26 Swapnil Dhamal , Prabuchandran K. J. , Y. Narahari

Influence maximization is the task of finding a set of seed nodes in a social network such that the influence spread of these seed nodes based on certain influence diffusion model is maximized. Topic-aware influence diffusion models have…

社会与信息网络 · 计算机科学 2014-11-24 Wei Chen , Tian Lin , Cheng Yang

In this paper we consider an extension of the well-known Influence Maximization Problem in a social network which deals with finding a set of k nodes to initiate a diffusion process so that the total number of influenced nodes at the end of…

社会与信息网络 · 计算机科学 2019-04-19 Kübra Tanınmış , Necati Aras , İ. K. Altınel
‹ 上一页 1 2 3 10 下一页 ›