中文
相关论文

相关论文: Optimal Influencer Marketing Campaign Under Budget…

200 篇论文

Social marketing is becoming increasingly important in contemporary business. Central to social marketing is quantifying how consumers choose between alternatives and how they influence each other. This work considers a new but simple…

社会与信息网络 · 计算机科学 2014-05-05 Jeremy Chen

Mixed-integer nonlinear optimization encompasses a broad class of problems that present both theoretical and computational challenges. We propose a new type of method to solve these problems based on a branch-and-bound algorithm with convex…

最优化与控制 · 数学 2024-07-19 Deborah Hendrych , Hannah Troppens , Mathieu Besançon , Sebastian Pokutta

Given a social network of users with selection cost, the \textsc{Budgeted Influence Maximization Problem} (\emph{BIM Problem} in short) asks for selecting a subset of the nodes (known as \emph{seed nodes}) within an allocated budget for…

社会与信息网络 · 计算机科学 2021-04-15 Suman Banerjee

Influence maximization, defined as a problem of finding a set of seed nodes to trigger a maximized spread of influence, is crucial to viral marketing on social networks. For practical viral marketing on large scale social networks, it is…

社会与信息网络 · 计算机科学 2014-02-18 Suqi Cheng , Huawei Shen , Junming Huang , Guoqing Zhang , Xueqi Cheng

Social networks have been popular platforms for information propagation. An important use case is viral marketing: given a promotion budget, an advertiser can choose some influential users as the seed set and provide them free or discounted…

社会与信息网络 · 计算机科学 2016-11-15 Yixin Bao , Xiaoke Wang , Zhi Wang , Chuan Wu , Francis C. M. Lau

Viral marketing campaigns target primarily those individuals who are central in social networks and hence have social influence. Marketing events, however, may attract diverse audience. Despite the importance of event marketing, the…

社会与信息网络 · 计算机科学 2022-01-04 Balázs R. Sziklai , Balázs Lengyel

We investigate a class of nonconvex optimization problems characterized by a feasible set consisting of level-bounded nonconvex regularizers, with a continuously differentiable objective. We propose a novel hybrid approach to tackle such…

最优化与控制 · 数学 2024-10-28 Xiangyu Yang , Hao Wang , Yichen Zhu , Xiao Wang

Businesses need content. In various forms and formats and for varied purposes. In fact, the content marketing industry is set to be worth $412.88 billion by the end of 2021. However, according to the Content Marketing Institute, creating…

We consider a class of optimal advertising problems under uncertainty for the introduction of a new product into the market, on the line of the seminal papers of Vidale and Wolfe, 1957, and Nerlove and Arrow, 1962. The main features of our…

最优化与控制 · 数学 2024-04-29 Fausto Gozzi , Federica Masiero , Mauro Rosestolato

Frank-Wolfe methods (FW) have gained significant interest in the machine learning community due to its ability to efficiently solve large problems that admit a sparse structure (e.g. sparse vectors and low-rank matrices). However the…

机器学习 · 统计学 2018-03-22 Edward Cheung , Yuying Li

We tackle robust optimization problems under objective uncertainty in the oracle model, i.e., when the deterministic problem is solved by an oracle. The oracle-based setup is favorable in many situations, e.g., when a compact formulation of…

最优化与控制 · 数学 2024-12-06 Mathieu Besançon , Jannis Kurtz

With 1.3 billion users, Instagram (IG) has also become a business tool. IG influencer marketing, expected to generate $33.25 billion in 2022, encourages companies and influencers to create trending content. Various methods have been…

社会与信息网络 · 计算机科学 2023-01-18 Pier Paolo Tricomi , Marco Chilese , Mauro Conti , Ahmad-Reza Sadeghi

The idea of social advertising (or social promotion) is to select a group of influential individuals (a.k.a \emph{seeds}) to help promote some products or ideas through an online social networks. There are two major players in the social…

数据结构与算法 · 计算机科学 2021-10-01 Shaojie Tang , Jing Yuan

In this paper, we propose the amphibious influence maximization (AIM) model that combines traditional marketing via content providers and viral marketing to consumers in social networks in a single framework. In AIM, a set of content…

社会与信息网络 · 计算机科学 2015-07-14 Wei Chen , Fu Li , Tian Lin , Aviad Rubinstein

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,…

信息检索 · 计算机科学 2023-12-29 Artem Betlei , Mariia Vladimirova , Mehdi Sebbar , Nicolas Urien , Thibaud Rahier , Benjamin Heymann

Influence maximization (IM) has garnered a lot of attention in the literature owing to applications such as viral marketing and infection containment. It aims to select a small number of seed users to adopt an item such that adoption…

社会与信息网络 · 计算机科学 2020-12-08 Prithu Banerjee , Wei Chen , Laks V. S. Lakshmanan

The problem of influence maximization is to select the most influential individuals in a social network. With the popularity of social network sites, and the development of viral marketing, the importance of the problem has been increased.…

社会与信息网络 · 计算机科学 2019-04-30 Maryam Adineh , Mostafa Nouri-Baygi

Several behavioral, social, and public health interventions, such as suicide/HIV prevention or community preparedness against natural disasters, leverage social network information to maximize outreach. Algorithmic influence maximization…

社会与信息网络 · 计算机科学 2020-12-17 Aida Rahmattalabi , Shahin Jabbari , Himabindu Lakkaraju , Phebe Vayanos , Max Izenberg , Ryan Brown , Eric Rice , Milind Tambe

Given a social network with nonuniform selection cost of the users, the problem of \textit{Budgeted Influence Maximization} (BIM in short) asks for selecting a subset of the nodes within an allocated budget for initial activation, such that…

社会与信息网络 · 计算机科学 2020-04-09 Suman Banerjee , Mamata Jenamani , Dilip Kumar Pratihar

In many online learning problems the computational bottleneck for gradient-based methods is the projection operation. For this reason, in many problems the most efficient algorithms are based on the Frank-Wolfe method, which replaces…

机器学习 · 计算机科学 2020-02-17 Elad Hazan , Edgar Minasyan