Identifying Influential Communicators based on Correlation and Minimum Distance in Social Media Data Streams
- 28 August 2023
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Abstract
Twitter has become a crucial social networking platform for users to receive and exchange information about current events. Identifying the most influential users in social networks is pivotal for the efficient propagation of information. However, traditional influencer identification models often fall short of assessing users' influence comprehensively and neglect overlapping influence, which greatly restrains their efficiency and accuracy in identifying key users. To address such issues, we propose a method for identifying key users based on correlation and minimum distance (CM-UDM). This method can evaluate users' influence based on their individual, global, local, and propagation path characteristics in social networks. Additionally, we propose a key user decision graph in order to address the problem of overlapping users' influence. We have conducted experiments using one classical dataset and three real Twitter datasets, where the performance of our proposed method in identifying highly influential users is demonstrated.Keywords
Funding Information
- Jiangsu University
This publication has 20 references indexed in Scilit:
- Influence maximization problem by leveraging the local traveling and node labeling method for discovering most influential nodes in social networksPhysica A: Statistical Mechanics and its Applications, 2022
- QoS prediction for smart service management and recommendation based on the location of mobile usersNeurocomputing, 2022
- A dynamic algorithm based on cohesive entropy for influence maximization in social networksExpert Systems with Applications, 2021
- EHC: Extended H-index Centrality measure for identification of users’ spreading influence in complex networksPhysica A: Statistical Mechanics and its Applications, 2019
- Identifying and ranking influential spreaders in complex networks by neighborhood corenessPhysica A: Statistical Mechanics and its Applications, 2014
- Ranking spreaders by decomposing complex networksPhysics Letters A, 2013
- A PageRank-Based Heuristic Algorithm for Influence Maximization in the Social Network2012
- Identification of influential spreaders in complex networksNature Physics, 2010
- Rethinking centrality: Methods and examplesSocial Networks, 1989
- Centrality in social networks conceptual clarificationSocial Networks, 1978