A new technique for influence maximization on social networks using a moth-flame optimization algorithm

Abstract

In our modern digital era, social networks have seamlessly integrated into the fabric of our daily lives. These digital platforms serve as vital channels for communication, exchanging information, and cultivating valuable connections. The propagation of information within these social networks has emerged as a central focus for numerous sectors, including politics, marketing, research, education, and finance. Diverse models have been employed to depict the dynamics of information dissemination across these networks. Nevertheless, the notion of influence holds profound significance for both businesses and individuals. Influence maximization, particularly within the context of social networks, has garnered considerable attention owing to its potential to reach and impact a broad audience. This intricate challenge is commonly referred to as the “influence maximization problem,” a problem well-known for its NP-hard complexity. This paper proposes a cutting-edge technique that leverages the Moth-Flame Optimization Algorithm to enhance influence maximization. Influence maximization is an important issue in network analysis, which widely occurs in social networks. Influence can be seen as a cascading effect, where the actions of a few trigger a chain reaction, ultimately reaching a large portion of the network. Identifying these “influencers” is crucial for efficient resource allocation and information dissemination. One of the important issues in finding the maximum influence is choosing the best vertex among all the vertices in the graph. This research presents a new method to find the maximum influence in social networks based on the Moth-Flame Algorithm (MFA). The proposed method aims to find the maximum influence in the social network graph that has a good fitness degree. The algorithm can identify potential influencers. Our simulations across multiple networks have unequivocally showcased the superiority of this algorithm as the preeminent and scalable solution to the influence maximization problem. The experimental outcomes clearly delineate that the employment of the MFA (Maximal First Activation) approach effectively diminishes the execution time required to approximate the maximum influence. The proposed technique improved the accuracy and excucation time by 3.140 % and 12.2 % compared to other methods.