{"title":"Predicting Participation Shift of Users at the Next Stage in Social Networks","authors":"Yichao Zhang;Zejian Wang;Huangxin Zhuang;Lei Song;Guanghui Wen;Jihong Guan;Shuigeng Zhou","doi":"10.1109/TNSE.2024.3523300","DOIUrl":null,"url":null,"abstract":"In online social networks, numerous studies have demonstrated the challenge of predicting who will eventually engage in an information cascade with its initial part. Take a step back. Can we predict who will engage in the cascade at the next stage if the lifetime of cascades is divided into a certain number of stages? Although numerous attempts have been made to solve this problem, how to extract useful information from the historical cascades spreading within a sub-network and the connections among users remains an open question. This paper proposes a simple but efficient unsupervised agent-based model, the triple ranking model, which integrates exposure time ranking, social gravity ranking, and cascade similarity ranking. The rankings, a key component of our model, have been successful in characterizing the social impact of shifted users, temporal information, and sequential cascade information, demonstrating the generalizability of our approach. To test the contributions of the features in supervised frameworks, we fuse them with two graph neural networks, the graph convolutional network (GCN) and graph attention network (GAT). Our experimental results on three Twitter networks unequivocally show that the proposed algorithm outperforms the tested state-of-art algorithms across a series of performance metrics. Notably, its time complexity is also lower than theirs, further underscoring its superiority. The observations demonstrate that the rankings effectively abstract the features hidden in the information cascades and in the topology of social networks, paving the way for further studies on posting engagement.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 2","pages":"1066-1079"},"PeriodicalIF":6.7000,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10829773/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
In online social networks, numerous studies have demonstrated the challenge of predicting who will eventually engage in an information cascade with its initial part. Take a step back. Can we predict who will engage in the cascade at the next stage if the lifetime of cascades is divided into a certain number of stages? Although numerous attempts have been made to solve this problem, how to extract useful information from the historical cascades spreading within a sub-network and the connections among users remains an open question. This paper proposes a simple but efficient unsupervised agent-based model, the triple ranking model, which integrates exposure time ranking, social gravity ranking, and cascade similarity ranking. The rankings, a key component of our model, have been successful in characterizing the social impact of shifted users, temporal information, and sequential cascade information, demonstrating the generalizability of our approach. To test the contributions of the features in supervised frameworks, we fuse them with two graph neural networks, the graph convolutional network (GCN) and graph attention network (GAT). Our experimental results on three Twitter networks unequivocally show that the proposed algorithm outperforms the tested state-of-art algorithms across a series of performance metrics. Notably, its time complexity is also lower than theirs, further underscoring its superiority. The observations demonstrate that the rankings effectively abstract the features hidden in the information cascades and in the topology of social networks, paving the way for further studies on posting engagement.
期刊介绍:
The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.