Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3035918.3035924acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article
Open access

Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study

Published: 09 May 2017 Publication History

Abstract

Influence maximization (IM) on social networks is one of the most active areas of research in computer science. While various IM techniques proposed over the last decade have definitely enriched the field, unfortunately, experimental reports on existing techniques fall short in validity and integrity since many comparisons are not based on a common platform or merely discussed in theory. In this paper, we perform an in-depth benchmarking study of IM techniques on social networks. Specifically, we design a benchmarking platform, which enables us to evaluate and compare the existing techniques systematically and thoroughly under identical experimental conditions. Our benchmarking results analyze and diagnose the inherent deficiencies of the existing approaches and surface the open challenges in IM even after a decade of research. More fundamentally, we unearth and debunk a series of myths and establish that there is no single state-of-the-art technique in IM. At best, a technique is the state of the art in only one aspect.

References

[1]
arXiv. http://www.arxiv.org.
[2]
SNAP Datasets. https://snap.stanford.edu/data/.
[3]
C. Borgs, M. Brautbar, J. Chayes, and B. Lucier. Maximizing social influence in nearly optimal time. In SODA, pages 946--957, 2014.
[4]
W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD, pages 1029--1038, 2010.
[5]
W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD, pages 199--208, 2009.
[6]
W. Chen, Y. Yuan, and L. Zhang. Scalable influence maximization in social networks under the linear threshold model. In ICDM, pages 88--97, 2010.
[7]
S. Cheng, H. Shen, J. Huang, W. Chen, and X. Cheng. IMRank: influence maximization via finding self-consistent ranking. In SIGIR, pages 475--484, 2014.
[8]
S. Cheng, H. Shen, J. Huang, G. Zhang, and X. Cheng. Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In CIKM, pages 509--518, 2013.
[9]
E. Cohen, D. Delling, T. Pajor, and R. F. Werneck. Sketch-based influence maximization and computation: Scaling up with guarantees. In CIKM, pages 629--638, 2014.
[10]
S. Galhotra, A. Arora, and S. Roy. Holistic influence maximization: Combining scalability and efficiency with opinion-aware models. In SIGMOD, 2016.
[11]
S. Galhotra, A. Arora, S. Virinchi, and S. Roy. ASIM: A scalable algorithm for influence maximization under the independent cascade model. In WWW (Companion Volume), 2015.
[12]
A. Goyal, F. Bonchi, and L. V. Lakshmanan. Learning influence probabilities in social networks. In WSDM, pages 241--250, 2010.
[13]
A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. A data-based approach to social influence maximization. PVLDB, 5:73--84, 2011.
[14]
A. Goyal, W. Lu, and L. V. Lakshmanan. CELF : Optimizing the greedy algorithm for influence maximization in social networks. In WWW (Companion Volume), pages 47--48, 2011.
[15]
A. Goyal, W. Lu, and L. V. Lakshmanan. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In ICDM, pages 211--220, 2011.
[16]
K. Jung, W. Heo, and W. Chen. IRIE: Scalable and robust influence maximization in social networks. In ICDM, pages 918--923, 2012.
[17]
D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137--146, 2003.
[18]
J. Kim, S.-K. Kim, and H. Yu. Scalable and parallelizable processing of influence maximization for large-scale social networks? In ICDE, pages 266--277, 2013.
[19]
K. Kutzkov, A. Bifet, F. Bonchi, and A. Gionis. STRIP: Stream learning of influence probabilities. In KDD, pages 275--283, 2013.
[20]
J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. Cost-effective outbreak detection in networks. In KDD, pages 420--429, 2007.
[21]
Q. Liu, B. Xiang, E. Chen, H. Xiong, F. Tang, and J. X. Yu. Influence maximization over large-scale social networks: A bounded linear approach. In CIKM, pages 171--180, 2014.
[22]
G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of approximations for maximizing submodular set functions. Mathematical Programming, 14(1):265--294, 1978.
[23]
H. T. Nguyen, M. T. Thai, and T. N. Dinh. Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In SIGMOD, pages 695--710, 2016.
[24]
N. Ohsaka, T. Akiba, Y. Yoshida, and K. Kawarabayashi. Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In AAAI, pages 138--144, 2014.
[25]
L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: bringing order to the web. 1999.
[26]
Y. Tang, Y. Shi, and X. Xiao. Influence maximization in near-linear time: A martingale approach. In SIGMOD, pages 1539--1554, 2015.
[27]
Y. Tang, X. Xiao, and Y. Shi. Influence maximization: Near-optimal time complexity meets practical efficiency. In SIGMOD, pages 75--86, 2014.
[28]
V. V. Vazirani. Approximation Algorithms. 2001.
[29]
H. Zhang, T. N. Dinh, and M. T. Thai. Maximizing the spread of positive influence in online social networks. In ICDCS, pages 317--326, 2013.

Cited By

View all
  • (2024)A New Algorithm Framework for the Influence Maximization Problem Using Graph ClusteringInformation10.3390/info1502011215:2(112)Online publication date: 14-Feb-2024
  • (2024)A Benchmark Study of Deep-RL Methods for Maximum Coverage Problems over GraphsProceedings of the VLDB Endowment10.14778/3681954.368202917:11(3666-3679)Online publication date: 1-Jul-2024
  • (2024)Adaptive Content-Aware Influence Maximization via Online Learning to RankACM Transactions on Knowledge Discovery from Data10.1145/365198718:6(1-35)Online publication date: 12-Apr-2024
  • Show More Cited By

Index Terms

  1. Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SIGMOD '17: Proceedings of the 2017 ACM International Conference on Management of Data
      May 2017
      1810 pages
      ISBN:9781450341974
      DOI:10.1145/3035918
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication Notes

      Badge change: Article originally badged under Version 1.0 guidelines https://www.acm.org/publications/policies/artifact-review-badging

      Publication History

      Published: 09 May 2017

      Permissions

      Request permissions for this article.

      Check for updates

      Badges

      Author Tag

      1. in-depth benchmarking study

      Qualifiers

      • Research-article

      Conference

      SIGMOD/PODS'17
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 785 of 4,003 submissions, 20%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)236
      • Downloads (Last 6 weeks)20
      Reflects downloads up to 12 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)A New Algorithm Framework for the Influence Maximization Problem Using Graph ClusteringInformation10.3390/info1502011215:2(112)Online publication date: 14-Feb-2024
      • (2024)A Benchmark Study of Deep-RL Methods for Maximum Coverage Problems over GraphsProceedings of the VLDB Endowment10.14778/3681954.368202917:11(3666-3679)Online publication date: 1-Jul-2024
      • (2024)Adaptive Content-Aware Influence Maximization via Online Learning to RankACM Transactions on Knowledge Discovery from Data10.1145/365198718:6(1-35)Online publication date: 12-Apr-2024
      • (2024)IMine: A CUSTOMIZABLE FRAMEWORK FOR INFLUENCE MINING IN COMPLEX NETWORKSAdvances in Complex Systems10.1142/S021952592450004827:01n02Online publication date: 27-Jun-2024
      • (2024)A hybrid dynamic memetic algorithm for the influence maximization problem in social networksInternational Journal of Modern Physics C10.1142/S0129183124501924Online publication date: 17-Aug-2024
      • (2024)Generalized hop‐based approaches for identifying influential nodes in social networksExpert Systems10.1111/exsy.13649Online publication date: 4-Jun-2024
      • (2024)Reconnecting the Estranged Relationships: Optimizing the Influence Propagation in Evolving NetworksIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3316268(1-14)Online publication date: 2024
      • (2024)Finding Influential Individuals in Social Networks Using Deep Reinforcement Learning to Tune the Neighborhood Selection Operator in the Variable Neighborhood Search Algorithm2024 10th International Conference on Web Research (ICWR)10.1109/ICWR61162.2024.10533378(112-118)Online publication date: 24-Apr-2024
      • (2024)Efficient Intervention in the Spread of Misinformation in Social NetworksIEEE Access10.1109/ACCESS.2024.345983012(133489-133498)Online publication date: 2024
      • (2024)GCNT: Identify influential seed set effectively in social networks by integrating graph convolutional networks with graph transformersJournal of King Saud University - Computer and Information Sciences10.1016/j.jksuci.2024.10218336:8(102183)Online publication date: Oct-2024
      • Show More Cited By

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Get Access

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media