Multi-criteria influence maximization (MCIM) method is an iterative hybrid method that selects \(k\) influential nodes using the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) [2]. In MCIM, an \(N \times 4\) decision matrix \(R\) is constructed as
\[
R = \begin{bmatrix}
d_1 & IDS_1 & -DO_1 & -IDO_1 \\
d_2 & IDS_2 & -DO_2 & -IDO_2 \\
\vdots & \vdots & \vdots & \vdots \\
d_N & IDS_N & -DO_N & -IDO_N \\
\end{bmatrix},
\]
where \(d_i\) is the degree of node \(i\), \(IDS_i\) is the entropy-based ranking measure (ERM) [3], and \(DO_i\) and \(IDO_i\) denote the direct overlap and indirect overlap of node \(i\), respectively:
\[
DO_i = \sum_{j \in \mathcal{N}(i)} s_j,
\quad
IDO_i = \sum_{j \in \mathcal{N}(i)} s_j \, |\mathcal{N}(i) \cap \mathcal{N}(j)|,
\]
with \(s_j = 1\) if node \(j\) is in the seed set \(S\) and \(s_j = 0\) otherwise.
Initially, the seed set \(S\) contains the nodes with the highest degree, which are then removed from the decision matrix \(R\). At each iteration, the most important node \(u\) is selected from \(R\) using the TOPSIS method. The selected node \(u\) is added to \(S\) and removed from \(R\), and the values of \(DO\) and \(IDO\) for the remaining nodes are updated accordingly. This process continues until either \(|S| = k\), meaning \(k\) nodes have been selected, or \(S = \mathcal{N}\), meaning all nodes have been added to the seed set.

References

[1] Shvydun, S. (2025). Zoo of Centralities: Encyclopedia of Node Metrics in Complex Networks. arXiv: 2511.05122 https://doi.org/10.48550/arXiv.2511.05122
[2] Zareie, A., Sheikhahmadi, A., & Khamforoosh, K. (2018). Influence maximization in social networks based on TOPSIS. Expert Systems with Applications, 108, 96-107. doi: 10.1016/j.eswa.2018.05.001.
[3] Zareie, A., Sheikhahmadi, A., & Fatemi, A. (2017). Influential nodes ranking in complex networks: An entropy-based approach. Chaos, Solitons & Fractals, 104, 485-494. doi: 10.1016/j.chaos.2017.09.010.