Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

The best hop diffusion method for dynamic relationships under the independent cascade model

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

The goal of the influence maximization problem is to identify a seed set that maximizes the number of users who will be impacted. This issue is critical to the spread of information in social networks. The greedy and heuristic algorithms are two prominent algorithms for this problem. The greedy algorithms are usually effective but they have high computational complexity. The heuristic algorithms are tendly efficient while the accuracy is low. The major goal of this study is to strike a compromise between efficacy and efficiency in selecting k influential nodes to maximize influence propagation while keeping the expense of doing so to a minimal. This paper proposes an improved heuristic algorithm, called the Best Hop for Independent Cascade Model (BHICM). This approach presents a dynamic relationship strategy between propagation probability and hop count that avoids processing the seed node’s neighbors. Afterwards, the proposed algorithm defines the diffusion score as the criterion for selecting seed nodes, which ensures its accuracy and efficiency. According to experimental results on four genuine social networks, the proposed approach exceeds all comparison algorithms in terms of accuracy while maintaining an acceptable running time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Cho SJIJOE (2020) Unethical Viral Marketing in Social Network Service, Publisher, City

  2. Tang J, Tang X, Yuan JJSNA (2018) Mining, An efficient and effective hop-based approach for influence maximization in social networks, Publisher, City

  3. Rui X, Meng F, Wang Z, Yuan GJAI (2019) A reversed node ranking approach for influence maximization in social networks, Publisher, City

  4. Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: A martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. 1539–1554

  5. Cui L, Hu H, Yu S, Yan Q, Ming Z, Wen Z, N.J.J.o.N Lu, C. (2018) Applications, DDSE: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks, Publisher, City,

  6. Guo L, Zhang D, Cong G, Wu W, K.-L.J.I.T.o.K. Tan, D. (2016) Engineering, Influence maximization in trajectory databases, Publisher, City

  7. Yadav A, Wilder B, Rice E, Petering R, Craddock J, Yoshioka-Maxwell A, Hemler M, Onasch-Vera L, Tambe M, Woo D (2017) Influence maximization in the field: The arduous journey from emerging to deployed application, In: Proceedings of the 16th conference on autonomous agents and multiagent systems. 150–158

  8. Shang J, Zhou S, Li X, Liu L, Wu HJK-BS (2017)CoFIM: A community-based framework for influence maximization on large-scale networks, Publisher, City,

  9. Guille A, Hacid H, Favre C, Zighed DAJASR (2013) Information diffusion in online social networks: A survey, Publisher, City

  10. Kim D, Hyeon D, Oh J, Han W-S, Yu HJIS (2017) Influence maximization based on reachability sketches in dynamic graphs, Publisher, City

  11. Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. 61-70

  12. Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. 137-146

  13. Trivedi N, Singh AJPCS (2020) Efficient influence maximization in social-networks under independent cascade model, Publisher, City

  14. Li P, Liu K, Li K, Liu J, Zhou DJPASM (2021) i. Applications, Estimating user influence ranking in independent cascade model, Publisher, City

  15. Li X, Wang P, Xu X-J, G.J.J.o.P Xiao D (2019) Computing, Universal behavior of the linear threshold model on weighted networks, Publisher, City

  16. Domingos P, Richardson M (2001) Mining the network value of customers. Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, In 57-66

  17. MJAJOS Granovetter (1978)Threshold models of collective behavior, Publisher, City

  18. Rahimkhani K, Aleahmad A, Rahgozar M, Moeini AJESWA (2015) A fast algorithm for finding most influential people based on the linear threshold model, Publisher, City

  19. Goyal A, Lu W, Lakshmanan LV (2011) Simpath: An efficient algorithm for influence maximization under the linear threshold model, In: 2011 IEEE 11th international conference on data mining. IEEE. 211–220

  20. Li W, Kang Q, Kong H, Liu C, Kang YJSNA (2020) Mining, A novel iterated greedy algorithm for detecting communities in complex network, Publisher, City

  21. Abu-Khzam FN, Lamaa K (201) Efficient heuristic algorithms for positive-influence dominating set in social networks, In: IEEE INFOCOM 2018-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE. 610–615

  22. Aldawish R, Kurdi HJPCS (2020) A Modified Degree Discount Heuristic for Influence Maximization in Social Networks, Publisher, City

  23. Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks, In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. 199–208

  24. Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks, In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. 1029–1038

  25. Nguyen D.-L, Nguyen T.-H, Do T.-H, Yoo MJWPC (2017) Probability-based multi-hop diffusion method for influence maximization in social networks, Publisher, City

  26. Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks, In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. 420–429

  27. Li C, Yang C, Giannetti C (2019) Segmentation and generalisation for writing skills transfer from humans to robots, Publisher, City

  28. Li C, Yang C, Wan J, Annamalai A, Cangelosi A (2017) Neural learning and kalman filtering enhanced teaching by demonstration for a baxter robot, In: 2017 23rd International Conference on Automation and Computing (ICAC). IEEE . 1–6

  29. Sittel P, Fiege N, Wickerson J, Zipf P (2021) Optimal and heuristic approaches to modulo scheduling with rational initiation intervals in hardware synthesis. Publisher, City

  30. He Q, Wang X, Lei Z, Huang M, Cai Y, Ma LJAM (2019) Computation, TIFIM: A two-stage iterative framework for influence maximization in social networks, Publisher, City

  31. Gaye I, Mendy G, Ouya S, Diop I, Seck D (2016) Multi-diffusion degree centrality measure to maximize the influence spread in the multilayer social networks, In: International Conference on e-Infrastructure and e-Services for Developing Countries, Springer. 53–65

  32. Berahmand K, Samadi N, Sheikholeslami SM (2018)Effect of rich-club on diffusion in complex networks, Publisher, City

  33. Aghaee Z, Beni HA, Kianian S, Vahidipour M (2020) A Heuristic Algorithm Focusing on the Rich-Club Phenomenon for the Influence Maximization Problem in Social Networks, In: 2020 6th international conference on web research (ICWR), IEEE, , pp. 119–125

  34. Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks, In: Proceedings of the 19th international conference on World wide web, pp. 641–650

  35. Ripeanu M, Foster I, Iamnitchi AJAPC (2002) Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design, Publisher, City

  36. Leskovec J (2014) A. Krevl, SNAP Datasets, Stanford large network dataset collection

  37. Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, In pp. 177-187

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China [Grant No.71772107], Shandong Nature Science Foundation of China [Grant No.ZR2020MF044].

Author information

Authors and Affiliations

  1. Shandong Province Key Laboratory of Wisdom Mine Information Technology, College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, 266590, China

    Liqing Qiu, Yuying Liu & Xiuliang Duan

Authors
  1. Liqing Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuying Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiuliang Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liqing Qiu.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Qiu, L., Liu, Y. & Duan, X. The best hop diffusion method for dynamic relationships under the independent cascade model. Appl Intell 52, 17315–17325 (2022). https://doi.org/10.1007/s10489-022-03460-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-022-03460-0

Keywords

Search

Navigation