Articles | Open Access |

INFLUENCE MAX: AN EFFICIENT ALGORITHM FOR MAXIMIZING INFLUENCE IN NETWORKS

Bolun Yuan , University of Fribourg, Fribourg, Switzerland

Abstract

Influence maximization, the identification of pivotal nodes within a network to maximize the spread of information or behaviors, plays a vital role in various domains, including social networks, marketing, and epidemiology. This paper presents "Influence Max," an innovative algorithm designed to efficiently identify influential nodes by considering the influence propagation range. Influence Max leverages the concept of influence propagation range, focusing on nodes that can reach a wide audience within a network. Through comprehensive evaluations on diverse network datasets, Influence Max demonstrates superior performance in terms of influence maximization when compared to existing methods. This algorithm offers a practical and scalable solution for influence maximization tasks, contributing to advancements in network analysis and decision-making processes.

Keywords

Influence Maximization, Network Analysis, Influence Propagation Range

References

Adamic, L. A.; Glance, N. (2005): The political blogosphere and the 2004 US election: divided they blog. Proceedings of the 3rd International Workshop on Link Discovery, pp. 36-43.

Chen, S.; Fan, J.; Li, G.; Feng, J.; Tan, K. L. et al. (2015): Online topic-aware influence maximization. Proceedings of the VLDB Endowment, vol. 8, no. 6, pp. 666-677.

Chen, W.; Wang, C.; Wang, Y. (2010): Scalable influence maximization for prevalent viral marketing in large-scale social networks. Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029-1038.

Chen, W.; Wang, Y.; Yang, S. (2009): Efficient influence maximization in social networks. Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199-208.

Cornnejols, G.; Fisher, M.; Nemhauser, G. (1977): Location of bank accounts of optimize float: an analytic study of exact and approximate algorithm. Management Science, vol. 23, pp. 789-810.

Dünker, D.; Kunegis, J. (2015): Social networking by proxy: analysis of dogster, catster and hamsterster. Proceedings of the 24th International Conference on World Wide Web, pp. 361-362.

Gehrke, J.; Ginsparg, P.; Kleinberg, J. (2003): Overview of the 2003 kdd cup. ACM SIGKDD Explorations Newsletter, vol. 5, no. 2, pp. 149-151.

Goldenberg, J.; Libai, B.; Muller, E. (2001): Talk of the network: a complex system looks at the underlying process of word-of-mouth. Marketing Letters, vol. 12, no. 3, pp. 211-223.

Article Statistics

Downloads

Download data is not yet available.

Copyright License

Download Citations

How to Cite

INFLUENCE MAX: AN EFFICIENT ALGORITHM FOR MAXIMIZING INFLUENCE IN NETWORKS. (2024). International Journal of IoT, 4(01), 01-04. https://www.academicpublishers.org/journals/index.php/ijiot/article/view/213