English
Related papers

Related papers: Offline and Online Models of Budget Allocation for…

200 papers

The greedy algorithm for monotone submodular function maximization subject to cardinality constraint is guaranteed to approximate the optimal solution to within a $1-1/e$ factor. Although it is well known that this guarantee is essentially…

Data Structures and Algorithms · Computer Science 2022-02-15 Aviad Rubinstein , Junyao Zhao

Now-a-days, Online Social Networks (OSNs) are extensively used by different commercial houses for viral marketing. The key problem that arises in this context is to choose a limited number of highly influential users as the initial adopters…

Social and Information Networks · Computer Science 2026-01-23 Poonam Sharma , Suman Banerjee

While social networks are widely used as a media for information diffusion, attackers can also strategically employ analytical tools, such as influence maximization, to maximize the spread of adversarial content through the networks. We…

Social and Information Networks · Computer Science 2020-11-04 Feiran Jia , Kai Zhou , Charles Kamhoua , Yevgeniy Vorobeychik

The optimal allocation of resources for maximizing influence, spread of information or coverage, has gained attention in the past years, in particular in machine learning and data mining. But in applications, the parameters of the problem…

Machine Learning · Computer Science 2017-06-14 Matthew Staib , Stefanie Jegelka

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…

Machine Learning · Computer Science 2019-11-26 Xiaojin Zhang

The rise of Online Social Networks (OSNs) has caused an insurmountable amount of interest from advertisers and researchers seeking to monopolize on its features. Researchers aim to develop strategies for determining how information is…

Machine Learning · Statistics 2018-03-09 Trisha Lawrence

Constrained $k$-submodular maximization is a general framework that captures many discrete optimization problems such as ad allocation, influence maximization, personalized recommendation, and many others. In many of these applications,…

Data Structures and Algorithms · Computer Science 2023-05-26 Fabian Spaeh , Alina Ene , Huy L. Nguyen

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…

Social and Information Networks · Computer Science 2020-11-23 George Panagopoulos , Fragkiskos D. Malliaros , Michalis Vazirgiannis

Influence maximization (IM) is a classic problem that aims to identify a small group of critical individuals, known as seeds, who can influence the largest number of users in a social network through word-of-mouth. This problem finds…

Social and Information Networks · Computer Science 2024-10-23 Yiqian Huang , Shiqi Zhang , Laks V. S. Lakshmanan , Wenqing Lin , Xiaokui Xiao , Bo Tang

The effectiveness of advertising in e-commerce largely depends on the ability of merchants to bid on and win impressions for their targeted users. The bidding procedure is highly complex due to various factors such as market competition,…

Information Retrieval · Computer Science 2023-12-29 Artem Betlei , Mariia Vladimirova , Mehdi Sebbar , Nicolas Urien , Thibaud Rahier , Benjamin Heymann

The majority of influence maximization (IM) studies focus on targeting influential seeders to trigger substantial information spread in social networks. In this paper, we consider a new and complementary problem of how to further increase…

Social and Information Networks · Computer Science 2017-06-27 Yishi Lin , Wei Chen , John C. S. Lui

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…

Social and Information Networks · Computer Science 2015-02-24 Swapnil Dhamal , Prabuchandran K. J. , Y. Narahari

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…

Social and Information Networks · Computer Science 2021-06-15 Haipeng Chen , Wei Qiu , Han-Ching Ou , Bo An , Milind Tambe

How would admissions look like in a university program for influencers? In the realm of social network analysis, influence maximization and link prediction stand out as pivotal challenges. Influence maximization focuses on identifying a set…

Social and Information Networks · Computer Science 2025-07-08 Marina Lin , Laura P. Schaposnik , Raina Wu

Today's top advertisers typically manage hundreds of campaigns simultaneously and consistently launch new ones throughout the year. A crucial challenge for marketing managers is determining the optimal allocation of limited budgets across…

Machine Learning · Statistics 2024-09-04 Lin Ge , Yang Xu , Jianing Chu , David Cramer , Fuhong Li , Kelly Paulson , Rui Song

Information diffusion and virus propagation are fundamental processes taking place in networks. While it is often possible to directly observe when nodes become infected with a virus or adopt the information, observing individual…

Data Structures and Algorithms · Computer Science 2015-03-17 Manuel Gomez-Rodriguez , Jure Leskovec , Andreas Krause

Influence maximization is the problem of finding a small subset of nodes in a network that can maximize the diffusion of information. Recently, it has also found application in HIV prevention, substance abuse prevention, micro-finance…

Artificial Intelligence · Computer Science 2021-07-09 Dexun Li , Meghna Lowalekar , Pradeep Varakantham

As social networks are constantly changing and evolving, methods to analyze dynamic social networks are becoming more important in understanding social trends. However, due to the restrictions imposed by the social network service…

Social and Information Networks · Computer Science 2018-01-09 Kaan Bingöl , Bahaeddin Eravcı , Çağrı Özgenç Etemoğlu , Hakan Ferhatosmanoğlu , Buğra Gedik

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…

Social and Information Networks · Computer Science 2016-02-02 Edith Cohen , Daniel Delling , Thomas Pajor , Renato F. Werneck

We study the $r$-complex contagion influence maximization problem. In the influence maximization problem, one chooses a fixed number of initial seeds in a social network to maximize the spread of their influence. In the $r$-complex…

Social and Information Networks · Computer Science 2022-06-15 Grant Schoenebeck , Biaoshuai Tao , Fang-Yi Yu