MADS‐UC: Finding Key Users in Online Social Networks Through Users Activation Activeness and Combination Weighting MCDM
Authors:
- 23 January 2026
- journal article
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 38 (3)
Abstract
In online social networks, identifying influential users is crucial for maintaining network stability and accelerating information dissemination. However, most of the existing research evaluate the influence of users according to the topological structure of local or global networks, which ignores the historical information and social interactions of users. In this work, we introduce a novel algorithm called MADS‐UC to pinpoint the influential super‐spreaders of information. Specifically, three kinds of activation influence between each pair of users are defined to better portray the mutual interactions with each other, and the proposed measure makes full consideration of the topological and historical information of networks, and the social interactions of users. Then, a hybrid multi‐attribute decision‐making algorithm is put forward to evaluate the influence of users, while the obtained three kinds of activation influence are introduced as basic indicators, and the weight for each indicator is determined from both subjective and objective dimensions. Finally, to achieve a good balance between algorithm accuracy and time complexity, the influential users are identified by considering the interactions between a user and other users within its influence range. We collect seven real‐world datasets from the Sina Weibo platform in 2024 about mobile product Honor, and a series of experiments is conducted to validate the effectiveness of the MADS‐UC algorithm. Experimental results show that MADS‐UC surpasses six widely used algorithms in robustness, sensitivity analysis, and distinguishing capability, which is useful in accelerating the dissemination of information in the product marketing process.Keywords
Funding Information
- National Office for Philosophy and Social Sciences (21BGL217)
- National Office for Philosophy and Social Sciences (25BGL062)
This publication has 64 references indexed in Scilit:
- A swarm intelligence-based vaccination strategy for preventing epidemic spreadingApplied Soft Computing, 2025
- Finding influential nodes via graph embedding and hybrid centrality in complex networksChaos, Solitons & Fractals, 2025
- Locating influential nodes in hypergraphs via fuzzy collective influenceCommunications in Nonlinear Science and Numerical Simulation, 2025
- Opinion convergence and management: Opinion dynamics in interactive group decision-makingEuropean Journal of Operational Research, 2024
- A new community-based algorithm based on a “peak-slope-valley” structure for influence maximization on social networksChaos, Solitons & Fractals, 2023
- AOGC: An improved gravity centrality based on an adaptive truncation radius and omni-channel paths for identifying key nodes in complex networksChaos, Solitons & Fractals, 2022
- An algorithm for ranking the nodes of multiplex networks with data based on the PageRank conceptApplied Mathematics and Computation, 2021
- Identifying influential spreaders by weight degree centrality in complex networksChaos, Solitons & Fractals, 2016
- Social contagion theory: examining dynamic social networks and human behaviorStatistics in Medicine, 2012
- Centrality in social networks conceptual clarificationSocial Networks, 1978