skip to main content
10.1145/1774088.1774314acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

OASNET: an optimal allocation approach to influence maximization in modular social networks

Published: 22 March 2010 Publication History

Abstract

Influence maximization in a social network is to target a given number of nodes in the network such that the expected number of activated nodes from these nodes is maximized. A social network usually exhibits some degree of modularity. Previous research efforts that made use of this topological property are restricted to random networks with two communities. In this paper, we firstly transform the influence maximization problem in a modular social network to an optimal resource allocation problem in the same network. We assume that the communities of the social network are disconnected. We then propose a recursive relation for finding such an optimal allocation. We prove that finding an optimal allocation in a modular social network is NP-hard and propose a new optimal dynamic programming algorithm to solve the problem. We name our new algorithm OASNET (Optimal Allocation in a Social NETwork). We compare OASNET with equal allocation, proportional allocation, random allocation and selecting top degree nodes without any allocation strategy on both synthetic and real world datasets. Experimental results show that OASNET outperforms these four heuristics.

References

[1]
M. Boguñá, R. Pastor-Satorras, A. Díaz-Guilera, and A. Arenas. Models of social networks based on social distance attachment. Phys. Rev. E, 70(5):056122, Nov 2004.
[2]
A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Phys. Rev. E, 70(6):066111, Dec 2004.
[3]
P. Domingos and M. Richardson. Mining the network value of customers. In KDD, pages 57--66, 2001.
[4]
P. A. Estévez, P. A. Vera, and K. Saito. Selecting the most influential nodes in social networks. In IJCNN, pages 2397--2402, 2007.
[5]
A. Galstyan, V. Musoyan, and P. Cohen. Maximizing influence propagation in networks with community structure. Phys. Rev. E, 79(5):056102, 2009.
[6]
M. Granovetter. Threshold models of collective behavior. The American Journal of Sociology, 83(6):1420--1443, 1978.
[7]
B. L. Jacob Goldenberg and E. Muller. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters, 12:211--223, 2001.
[8]
D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137--146, 2003.
[9]
M. Kimura, K. Saito, and H. Motoda. Minimizing the spread of contamination by blocking links in a network. In AAAI, pages 1175--1180, 2008.
[10]
M. Kimura, K. Saito, and R. Nakano. Extracting influential nodes for information diffusion on a social network. In AAAI, pages 1371--1376, 2007.
[11]
M. E. J. Newman. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences of the United States of America, 98(2):404--409, 2001.
[12]
M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167, 2003.
[13]
M. Richardson and P. Domingos. Mining knowledge-sharing sites for viral marketing. In KDD, pages 61--70, 2002.

Cited By

View all
  • (2025)A community-based simulated annealing approach with a new structure-based neighborhood search to identify influential nodes in social networksSoft Computing10.1007/s00500-025-10490-629:3(1567-1585)Online publication date: 17-Feb-2025
  • (2024)Community-Diversified Influence Maximization Based on Community-Aware Closeness2024 5th International Conference on Artificial Intelligence and Computer Engineering (ICAICE)10.1109/ICAICE63571.2024.10864288(1178-1185)Online publication date: 8-Nov-2024
  • (2023)An Adaptive Community-Based Influence Maximization Algorithm in Social Networks2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC)10.1109/SMC53992.2023.10394427(1813-1819)Online publication date: 1-Oct-2023
  • Show More Cited By

Index Terms

  1. OASNET: an optimal allocation approach to influence maximization in modular social networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SAC '10: Proceedings of the 2010 ACM Symposium on Applied Computing
    March 2010
    2712 pages
    ISBN:9781605586397
    DOI:10.1145/1774088
    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 ACM 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 History

    Published: 22 March 2010

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. influence maximization
    2. modular social network
    3. optimal allocation

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    SAC'10
    Sponsor:
    SAC'10: The 2010 ACM Symposium on Applied Computing
    March 22 - 26, 2010
    Sierre, Switzerland

    Acceptance Rates

    SAC '10 Paper Acceptance Rate 364 of 1,353 submissions, 27%;
    Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

    Upcoming Conference

    SAC '25
    The 40th ACM/SIGAPP Symposium on Applied Computing
    March 31 - April 4, 2025
    Catania , Italy

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 01 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2025)A community-based simulated annealing approach with a new structure-based neighborhood search to identify influential nodes in social networksSoft Computing10.1007/s00500-025-10490-629:3(1567-1585)Online publication date: 17-Feb-2025
    • (2024)Community-Diversified Influence Maximization Based on Community-Aware Closeness2024 5th International Conference on Artificial Intelligence and Computer Engineering (ICAICE)10.1109/ICAICE63571.2024.10864288(1178-1185)Online publication date: 8-Nov-2024
    • (2023)An Adaptive Community-Based Influence Maximization Algorithm in Social Networks2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC)10.1109/SMC53992.2023.10394427(1813-1819)Online publication date: 1-Oct-2023
    • (2023)Maximizing the Influence of Social Networks Based on Graph Attention Networks2023 3rd Asia-Pacific Conference on Communications Technology and Computer Science (ACCTCS)10.1109/ACCTCS58815.2023.00054(396-403)Online publication date: Feb-2023
    • (2023)Overlapping community‐based particle swarm optimization algorithm for influence maximization in social networksCAAI Transactions on Intelligence Technology10.1049/cit2.12158Online publication date: 23-Jan-2023
    • (2023)K++ ShellComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2023.109916234:COnline publication date: 1-Oct-2023
    • (2023)Opinion Maximization in Signed Social Networks Using Centrality Measures and Clustering TechniquesDistributed Computing and Intelligent Technology10.1007/978-3-031-24848-1_9(125-140)Online publication date: 8-Jan-2023
    • (2022)Local-Forest Method for Superspreaders Identification in Online Social NetworksEntropy10.3390/e2409127924:9(1279)Online publication date: 11-Sep-2022
    • (2022)Influence maximization based on network representation learning in social networkIntelligent Data Analysis10.3233/IDA-21614926:5(1321-1340)Online publication date: 1-Jan-2022
    • (2022)ComIM: A community-based algorithm for influence maximization under the weighted cascade model on social networksIntelligent Data Analysis10.3233/IDA-20556626:1(205-220)Online publication date: 13-Jan-2022
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media