A hybrid algorithm based on Community Detection and Multi-Attribute Decision-Making for Influence Maximization
Masoud Jalayer, Morvarid Azheian, Mehrdad Mohammad Ali Kermani

TL;DR
This paper introduces a hybrid influence maximization algorithm combining community detection and MADM (TOPSIS) to efficiently identify key nodes for maximizing influence spread in complex networks, outperforming traditional methods.
Contribution
The paper proposes a novel hybrid algorithm, GTaCB, integrating community detection and TOPSIS for influence maximization, demonstrating superior performance over existing greedy algorithms.
Findings
GTaCB outperforms traditional algorithms in diffusion quality.
GTaCB achieves faster influence spread in most tested networks.
Performance improves with increased initial nodes or infection probability.
Abstract
The influence maximization problem is trying to identify a set of K nodes by which the spread of influence, diseases, or information is maximized. The optimization of influence by finding such a set is an NP-hard problem and a key issue in analyzing complex networks. In this paper, a new greedy and hybrid approach based on a community detection algorithm and a MADM technique (TOPSIS) is proposed to cope with the problem, called, Greedy TOPSIS and Community-Based (GTaCB) algorithm. The paper concisely introduces community detection and the TOPSIS technique, then it presents the pseudo-code of the proposed algorithm. Afterward, it compares the performance of the solution which is found by GTaCB with some well-known greedy algorithms, based on Degree Centrality, Closeness Centrality, Betweenness Centrality, PageRank as well as TOPSIS, from two aspects: diffusion quality and diffusion…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
