skip to main content
10.1145/3582197.3582204acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicitConference Proceedingsconference-collections
research-article

Information spreading in mobile social networks: identifying the influential nodes using FPSO algorithm

Published: 30 March 2023 Publication History

Abstract

The most influential nodes are capable of generating maximum influence and widest information spread to their connected nodes in mobile social networks. Hence identifying high influential users plays an important role in monitoring network public opinion. However, influence maximization is an open and challenging issue, and existing works only focus on online social networks but fail to characterize the user social relations and social behavior. In this paper, firstly, we present a novel method based on location and preference relationships to calculate the social influence of users, and the initial nodes are identified by community partition. Secondly, according to the stochastic information spreading process in MSNs, we propose the Fluctuate Particle Swarm Optimization (FPSO)-algorithm to solve the problem of changing communication relationship between users at the optimization stage. Finally, we use extensive experiments on the real datasets to prove the effectiveness of the proposed FPSO-algorithm. The experimental evaluation shows that in the real networks, our proposal achieves better performance than other related methods.

References

[1]
[1] H. Sun, S. Zhang, J. Huang, L. He, X. Jiang and Z. Duan, “A personalized event-participant arrangement framework based on user interests in social network,” Computer Networks.
[2]
[2] D. Kempe, J. Kleinberg and E. Tardos, “Maximizing the spread of influence through a social network,” Internet Conference Knowledge Discovery Data Ming, pp. 137-146, 2017.
[3]
[3] S.-S. Singh, A. Kumar, K. Singh and B. Biswas, “IM‐SSO: Maximizing influence in social networks using social spider optimization,” Concurrency and Computation: Practice and Experience, vol. 32, no. 2, 2020.
[4]
[4] X. Rui, F. Meng, Z. Wang and G. Yuan, “A reversed node ranking approach for influence maximization in social networks,” Applied Intelligence, vol. 49, no. 7, pp. 2684-2698, 2019.
[5]
[5] G. Song, X. Zhou, Y. Wang and K. Xie, “Influence maximization on large-scale mobile social network: A divide-and-conquer method,” IEEE Transactions on Parallel and Distributed Systems, vol. 26, no. 5, pp. 1379-1392, 2015.
[6]
[6] X. Zhang, L. Xu, and Z Xu “Influence maximization based on network motifs in mobile social networks,” IEEE Transactions on Network Science and Engineering.
[7]
[7] W. K. Lai, Y. U. Chen and T.-Y. Wu, “Analysis and evaluation of random-based message propagation models on the social networks,” Computer Networks.
[8]
[8] Y. Wang, J. Wang, H. Wang, R. Zhang and M. Li, “Users’ mobility enhances information diffusion in online social networks,” Information Sciences, vol. 546, pp. 329-346, 2021.
[9]
[9] C. Sang and S. Liao, “Modeling and simulation of information dissemination model considering user’s awareness behavior in mobile social networks,” Physica A: Statistical Mechanics and its Applications, vol. 537, pp. 0378-4371, 2020.
[10]
[10] Z. Wang, C. Sun, J. Xi and X. Li, “Influence maximization in social graphs based on community structure and node coverage gain,” Future Generation Computer Systems, vol. 118, pp. 327-338, 2021.
[11]
[11] Z. Mao, Y. Jiang, X. Di and Y. Woldeyohannes, “Joint head selection and airtime allocation for data dissemination in mobile social networks,” Computer Networks. 2019. 106990.
[12]
[12] J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” Proceedings of IEEE International Conference on Neural Networks, vol. 4, no. 2, pp. 1942-1948, 1995.
[13]
[13] X. Xu, J. Li, M. Zhou, J. Xu and J. Cao, “Accelerated two-stage particle swarm optimization for clustering not-well-separated data,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 50, no. 11, pp. 4212-4223, 2020.
[14]
[14] Q. Cai, M. Gong, B. Shen, L. Ma and L. Jiao, “Discrete particle swarm optimization for identifying community structures in signed social networks,” Neural Networks, vol. 58, pp. 4-13, 2014.
[15]
[15] M. Gong, J. Yan, B. Shen, L. Ma and Q. Cai, “Influence maximization in social networks based on discrete particle swarm optimization,” Information Sciences, vol. 367, pp. 600-614, 2016.
[16]
[16] W. Chiu, G. Yen and T. Juan, Minimum Manhattan distance approach to multiple criteria decision making in multiobjective optimization problems, IEEE Transactions on Evolutionary Computation, vol. 20, no. 6, pp. 972-985, 2016.
[17]
[17] M. Kendall, “A new measure of rank correlation,” Biometrika, vol. 30, no. (1/2), pp. 81-93, 1983.
[18]
[18] J. Li, Y. Zhou, J. Wu and Z. Ma, “Complex dynamics of a simple epidemic model with a nonlinear incidence,” Discrete and continuous dynamical systems, vol. 8, no. 1, pp. 161-173, 2007.
[19]
[19] P. Bródka, K. Skibicki, P. Kazienko and K. Musial, “A degree centrality in multi-layered social network,” CASoN 2011, pp. 237-242, 2011.
[20]
[20] K. Nakajima, K. Iwasaki, T. Matsumura and K. Shudo, K. “Estimating top-k betweenness centrality nodes in online social networks,” ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018, pp. 1128-1135, 2018.
[21]
[21] P. H. Du, H. C. Nguyen, K. K. Nguyen and N. H. Nguyen, “An efficient parallel algorithm for computing the closeness centrality in social networks,” SoICT 2018, pp. 456-462, 2018.
[22]
[22] J. N. Zhan, S. Gurung and S. P. K. Parsa, “Identification of top-K nodes in large networks using Katz centrality,” Journal of Big Data.

Index Terms

  1. Information spreading in mobile social networks: identifying the influential nodes using FPSO algorithm
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Other conferences
      ICIT '22: Proceedings of the 2022 10th International Conference on Information Technology: IoT and Smart City
      December 2022
      385 pages
      ISBN:9781450397438
      DOI:10.1145/3582197
      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].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 30 March 2023

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. FPSO-algorithm
      2. community partition
      3. influence maximization
      4. mobile social networks
      5. social characteristics learning

      Qualifiers

      • Research-article
      • Research
      • Refereed limited

      Conference

      ICIT 2022
      ICIT 2022: IoT and Smart City
      December 23 - 25, 2022
      Shanghai, China

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 25
        Total Downloads
      • Downloads (Last 12 months)9
      • Downloads (Last 6 weeks)1
      Reflects downloads up to 16 Feb 2025

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format.

      HTML Format

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media