Predicting Participation Shift of Users at the Next Stage in Social Networks

IF 6.7 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Yichao Zhang;Zejian Wang;Huangxin Zhuang;Lei Song;Guanghui Wen;Jihong Guan;Shuigeng Zhou
{"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.
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信