Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Algorithms for Online Influencer Marketing

Algorithms for Online Influencer Marketing Influence maximization is the problem of finding influential users, or nodes, in a graph so as to maximize the spread of information. It has many applications in advertising and marketing on social networks. In this article, we study a highly generic version of influence maximization, one of optimizing influence campaigns by sequentially selecting “spread seeds” from a set of influencers, a small subset of the node population, under the hypothesis that, in a given campaign, previously activated nodes remain persistently active. This problem is in particular relevant for an important form of online marketing, known as influencer marketing, in which the marketers target a sub-population of influential people, instead of the entire base of potential buyers. Importantly, we make no assumptions on the underlying diffusion model, and we work in a setting where neither a diffusion network nor historical activation data are available. We call this problem online influencer marketing with persistence (in short, OIMP). We first discuss motivating scenarios and present our general approach. We introduce an estimator on the influencers’ remaining potential – the expected number of nodes that can still be reached from a given influencer – and justify its strength to rapidly estimate the desired value, relying on real data gathered from Twitter. We then describe a novel algorithm, GT-UCB, relying on probabilistic upper confidence bounds on the remaining potential. We show that our approach leads to high-quality spreads on both simulated and real datasets. Importantly, it is orders of magnitude faster than state-of-the-art influence maximization methods, making it possible to deal with large-scale online scenarios. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Knowledge Discovery from Data (TKDD) Association for Computing Machinery

Algorithms for Online Influencer Marketing

Download PDF
30 pages

Loading next page...
 
/lp/association-for-computing-machinery/algorithms-for-online-influencer-marketing-rW0fpQGURM
Publisher
Association for Computing Machinery
Copyright
Copyright © 2018 ACM
ISSN
1556-4681
eISSN
1556-472X
DOI
10.1145/3274670
Publisher site
See Article on Publisher Site

Abstract

Influence maximization is the problem of finding influential users, or nodes, in a graph so as to maximize the spread of information. It has many applications in advertising and marketing on social networks. In this article, we study a highly generic version of influence maximization, one of optimizing influence campaigns by sequentially selecting “spread seeds” from a set of influencers, a small subset of the node population, under the hypothesis that, in a given campaign, previously activated nodes remain persistently active. This problem is in particular relevant for an important form of online marketing, known as influencer marketing, in which the marketers target a sub-population of influential people, instead of the entire base of potential buyers. Importantly, we make no assumptions on the underlying diffusion model, and we work in a setting where neither a diffusion network nor historical activation data are available. We call this problem online influencer marketing with persistence (in short, OIMP). We first discuss motivating scenarios and present our general approach. We introduce an estimator on the influencers’ remaining potential – the expected number of nodes that can still be reached from a given influencer – and justify its strength to rapidly estimate the desired value, relying on real data gathered from Twitter. We then describe a novel algorithm, GT-UCB, relying on probabilistic upper confidence bounds on the remaining potential. We show that our approach leads to high-quality spreads on both simulated and real datasets. Importantly, it is orders of magnitude faster than state-of-the-art influence maximization methods, making it possible to deal with large-scale online scenarios.

Journal

ACM Transactions on Knowledge Discovery from Data (TKDD) – Association for Computing Machinery

Published: Dec 19, 2018

Keywords: Influencer marketing

References

  • Influencer Marketing
    Brown, D.; (Eds, N. Hayes
  • Debunking the myths of influence maximization: An in-depth benchmarking study
    Arora, A.; Galhotra, S.; Ranu, S.
  • Topic-aware social influence propagation models
    Barbieri, N.; Bonchi, F.; Manco, G.
  • Efficient methods for influence-based network-oblivious community detection
    Barbieri, N.; Bonchi, F.; Manco, G.
  • On the concentration of the missing mass
    Berend, D.; Kontorovich, A.
  • Concentration Inequalities: A Nonasymptotic Theory of Independence
    Boucheron, S.; Lugosi, G.; Massart, P.; Ledoux, M.
  • Influence Marketing: How to Create, Manage, and Measure Brand Influencers in Social Media Marketing
    Brown, D.; Fiorella, S.
  • Regret analysis of stochastic and nonstochastic multi-armed bandit problems
    Bubeck, S.; Cesa-Bianchi, N.
  • Optimal discovery with probabilistic expert advice: Finite time analysis and macroscopic optimality
    Bubeck, S.; Ernst, D.; Garivier, A.
  • Robust influence maximization
    Chen, W.; Lin, T.; Tan, Z.; Zhao, M.; Zhou, X.
  • Combinatorial multi-armed bandit and its extension to probabilistically triggered arms
    Chen, W.; Wang, Y.; Yuan, Y.; Wang, Q.
  • Uncover topic-sensitive information diffusion networks
    Du, N.; Song, L.; Woo, H.; Zha, H.
  • Networks, Crowds, and Markets -- Reasoning About a Highly Connected World
    Easley, D.; Kleinberg, J.
  • The New Influencers: A Marketer’s Guide to the New Social Media
    Gillin, P.
  • Uncovering the temporal dynamics of diffusion networks
    Gomez-Rodriguez, M.; Balduzzi, D.; Schölkopf, B.
  • Inferring networks of diffusion and influence
    Gomez-Rodriguez, M.; Leskovec, J.; Krause, A.
  • Structure and dynamics of information pathways in online media
    Gomez-Rodriguez, M.; Leskovec, J.; Schölkopf, B.
  • The population frequencies of species and the estimation of population parameters
    Good, I. J.
  • Learning influence probabilities in social networks
    Goyal, A.; Bonchi, F.; Lakshmanan, L.
  • Distinguishing between topical and non-topical information diffusion mechanisms in social media
    Grabowicz, P.; Ganguly, N.; Gummadi, K.
  • Robust influence maximization
    He, X.; Kempe, D.
  • Tardos
    Kempe, D.; Kleinberg, J.; É,
  • Effective large-scale online influence maximization
    Lagrée, P.; Cappé, O.; Cautis, B.; Maniu, S.
  • Influencer Marketing 2
    Lee, K.
  • Online influence maximization
    Lei, S.; Maniu, S.; Mo, L.; Cheng, R.; Senellart, P.
  • Rotting bandits
    Levine, N.; Crammer, K.; Mannor, S.
  • Algorithme de bandit et obsolescence : un modèle pour la recommandation
    Louëdec, J.; Rossi, L.; Chevalier, M.; Garivier, A.; Mothe, J.
  • Concentration inequalities for the missing mass and for histogram rule error
    McAllester, D.; Ortiz, L.
  • On the convergence rate of good-turing estimators
    McAllester, D.; Schapire, R.
  • DivRank: The interplay of prestige and diversity in information networks
    Mei, Q.; Guo, J.; Radev, D.
  • Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks
    Nguyen, H. T.; Thai, M. T.; Dinh, T. N.
  • Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations
    Ohsaka, N.; Akiba, T.; Yoshida, Y.; Kawarabayashi, K.
  • Differences in the mechanics of information diffusion across topics: Idioms, political hashtags, and complex contagion on Twitter
    Romero, D.; Meeder, B.; Kleinberg, J.
  • A model-free approach to infer the diffusion network from event cascade
    Rong, Y.; Zhu, Q.; Cheng, H.
  • Prediction of information diffusion probabilities for independent cascade model
    Saito, K.; Nakano, R.; Kimura, M.
  • How to Prepare Brands for Influencer Fatigue
    Sletten, C.
  • Influence maximization in near-linear time: A martingale approach
    Tang, Y.; Shi, Y.; Xiao, X.
  • Influence maximization: Near-optimal time complexity meets practical efficiency
    Tang, Y.; Xiao, X.; Shi, Y.
  • Diffusion independent semi-bandit influence maximization
    Vaswani, S.; Kveton, B.; Wen, Z.; Ghavamzadeh, M.; Lakshmanan, L.; Schmidt, M.
  • MMRate: Inferring multi-aspect diffusion networks with multi-pattern cascades
    Wang, S.; Hu, X.; Yu, P.; Li, Z.
  • Six Degrees: The Science of a Connected Age
    Watts, D.
  • Influentials, networks, and public opinion formation
    Watts, D.; Dodds, P.
  • Online influence maximization under independent cascade model with semi-bandit feedback
    Wen, Z.; Kveton, B.; Valko, M.; Vaswani, S.