{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:18:45Z","timestamp":1774120725152,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T00:00:00Z","timestamp":1712016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T00:00:00Z","timestamp":1712016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJSP2106"],"award-info":[{"award-number":["JPMJSP2106"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["23H03451"],"award-info":[{"award-number":["23H03451"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["21K12042"],"award-info":[{"award-number":["21K12042"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003051","name":"New Energy and Industrial Technology Development Organization","doi-asserted-by":"publisher","award":["JPNP20017"],"award-info":[{"award-number":["JPNP20017"]}],"id":[{"id":"10.13039\/501100003051","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Predicting what becomes popular on social media is crucial because it helps us understand future topics and public interests based on massive social data. Previous studies mainly focused on picking specific features and checking past statistic numbers, ignoring the hidden impact of messages passing along the complex relationships among different entities. People talk and connect with others on social media; thus, it is essential to consider how information spreads when studying social media networks. This work proposes a multi-layer temporal graph neural network (GNN) framework for predicting what will be popular on social media networks. This framework takes into account the way information spreads among different entities. The proposed method involves multi-layer relations and temporal information within a sequence of social media network snapshots. It learns the temporal representations of target entities in each snapshot and predicts how the popularity of a particular entity will change in future snapshots. The proposed method is evaluated with real-world data across four popularity trend prediction tasks. The experimental results prove that the proposed method performs better than various baselines, including traditional machine learning regression approaches, prior methods for popularity trend prediction, and other GNN models.<\/jats:p>","DOI":"10.1007\/s40747-024-01402-6","type":"journal-article","created":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T05:01:38Z","timestamp":1712034098000},"page":"4713-4729","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Predicting popularity trend in social media networks with multi-layer temporal graph neural networks"],"prefix":"10.1007","volume":"10","author":[{"given":"Ruidong","family":"Jin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2336-7409","authenticated-orcid":false,"given":"Xin","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3818-7830","authenticated-orcid":false,"given":"Tsuyoshi","family":"Murata","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,2]]},"reference":[{"key":"1402_CR1","doi-asserted-by":"crossref","unstructured":"Wu L, Sun P, Fu Y, Hong R, Wang X, Wang M (2019) A neural influence diffusion model for social recommendation. In: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval. pp 235\u2013244","DOI":"10.1145\/3331184.3331214"},{"key":"1402_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100286","volume":"37","author":"P Chunaev","year":"2020","unstructured":"Chunaev P (2020) Community detection in node-attributed social networks: a survey. Comput Sci Rev 37:100286","journal-title":"Comput Sci Rev"},{"issue":"5","key":"1402_CR3","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1093\/comjnl\/bxaa168","volume":"65","author":"H Wang","year":"2022","unstructured":"Wang H, Gao Q, Li H, Wang H, Yan L, Liu G (2022) A structural evolution-based anomaly detection method for generalized evolving social networks. Comput J 65(5):1189\u20131199","journal-title":"Comput J"},{"issue":"9\u201310","key":"1402_CR4","doi-asserted-by":"publisher","first-page":"6279","DOI":"10.1007\/s11042-019-08291-9","volume":"79","author":"D Rousidis","year":"2020","unstructured":"Rousidis D, Koukaras P, Tjortjis C (2020) Social media prediction: a literature review. Multimed Tools Appl 79(9\u201310):6279\u20136311","journal-title":"Multimed Tools Appl"},{"key":"1402_CR5","doi-asserted-by":"crossref","unstructured":"Altshuler Y, Pan W, Pentland A (2012) Trends prediction using social diffusion models. In: Social Computing, Behavioral-Cultural Modeling and Prediction: 5th International Conference, SBP 2012, College Park, MD, USA, April 3-5, 2012. Proceedings 5. Springer, pp 97\u2013104","DOI":"10.1007\/978-3-642-29047-3_12"},{"key":"1402_CR6","doi-asserted-by":"publisher","first-page":"1350024","DOI":"10.1142\/S0219525913500240","volume":"16","author":"A Zeng","year":"2013","unstructured":"Zeng A, Gualdi S, Medo M, Zhang Y-C (2013) Trend prediction in temporal bipartite networks: the case of movielens, netflix, and digg. Adv Complex Syst 16:1350024","journal-title":"Adv Complex Syst"},{"key":"1402_CR7","doi-asserted-by":"crossref","unstructured":"Cao Q, Shen H, Gao J, Wei B, Cheng X (2020) Popularity prediction on social platforms with coupled graph neural networks. In: Proceedings of the 13th International Conference on Web Search and Data Mining. pp 70\u201378","DOI":"10.1145\/3336191.3371834"},{"key":"1402_CR8","doi-asserted-by":"crossref","unstructured":"Li C, Zhou F, Luo X, Trajcevski G (2021) Kernel-based structural-temporal cascade learning for popularity prediction. In: 2021 IEEE Global Communications Conference (GLOBECOM). pp 1\u20136","DOI":"10.1109\/GLOBECOM46510.2021.9685636"},{"issue":"9","key":"1402_CR9","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai H, Zheng VW, Chang KC-C (2018) A comprehensive survey of graph embedding: problems, techniques and applications. IEEE Trans Knowl Data Eng 30(9):1616\u20131637","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"1402_CR10","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","volume":"31","author":"P Cui","year":"2018","unstructured":"Cui P, Wang X, Pei J, Zhu W (2018) A survey on network embedding. IEEE Trans Knowl Data Eng 31(5):833\u2013852","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1402_CR11","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Philip SY (2020) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst 32(1):4\u201324","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"7","key":"1402_CR12","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inf Sci Technol"},{"key":"1402_CR13","doi-asserted-by":"crossref","unstructured":"Sankar A, Wu Y, Gou L, Zhang W, Yang H (2020) Dysat: Deep neural representation learning on dynamic graphs via self-attention networks. In: WSDM2020, pp 519\u2013527","DOI":"10.1145\/3336191.3371845"},{"key":"1402_CR14","doi-asserted-by":"crossref","unstructured":"Gao C, Zhu J, Zhang F, Wang Z, Li X (2022) A novel representation learning for dynamic graphs based on graph convolutional networks. IEEE Trans Cybern","DOI":"10.1109\/TCYB.2022.3159661"},{"key":"1402_CR15","doi-asserted-by":"crossref","unstructured":"Jin R, Liu X, Murata T (2023) Predicting potential real-time donations in youtube live streaming services via continuous-time dynamic graphs. Mach Learn 1\u201335","DOI":"10.1007\/s10994-023-06449-z"},{"key":"1402_CR16","doi-asserted-by":"crossref","unstructured":"Dong Y, Chawla NV, Swami A (2017) Metapath2vec: Scalable representation learning for heterogeneous networks. In: KDD, pp 135\u2013144","DOI":"10.1145\/3097983.3098036"},{"key":"1402_CR17","doi-asserted-by":"crossref","unstructured":"Wang X, Ji H, Shi C, Wang B, Ye Y, Cui P, Yu PS (2019) Heterogeneous graph attention network. In: WWW, pp 2022\u20132032","DOI":"10.1145\/3308558.3313562"},{"key":"1402_CR18","doi-asserted-by":"crossref","unstructured":"Zhang C, Song D, Huang C, Swami A, Chawla NV (2019) Heterogeneous graph neural network. In: KDD, pp 793\u2013803","DOI":"10.1145\/3292500.3330961"},{"key":"1402_CR19","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/j.ins.2021.04.070","volume":"570","author":"N Chairatanakul","year":"2021","unstructured":"Chairatanakul N, Liu X, Murata T (2021) Pgra: projected graph relation-feature attention network for heterogeneous information network embedding. Inf Sci 570:769\u2013794","journal-title":"Inf Sci"},{"key":"1402_CR20","unstructured":"Kipf TN, Welling, M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907"},{"key":"1402_CR21","unstructured":"Zhang M, Chen Y (2018) Link prediction based on graph neural networks. In: NeurIPS2018. NIPS\u201918, pp 5171\u20135181"},{"key":"1402_CR22","doi-asserted-by":"crossref","unstructured":"Zhang M, Cui Z, Neumann M, Chen Y (2018) An end-to-end deep learning architecture for graph classification. In: AAAI2018","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"1402_CR23","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. Adv Neural Inf Process Syst 30"},{"key":"1402_CR24","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2018) Graph attention networks. arXiv preprint arXiv:1710.10903v3"},{"key":"1402_CR25","unstructured":"Kipf TN, Welling, M (2016) Variational graph auto-encoders. arXiv preprint arXiv:1611.07308"},{"issue":"1","key":"1402_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-021-00420-4","volume":"6","author":"L Zangari","year":"2021","unstructured":"Zangari L, Interdonato R, Cali\u00f3 A, Tagarelli A (2021) Graph convolutional and attention models for entity classification in multilayer networks. Appl Netw Sci 6(1):1\u201336","journal-title":"Appl Netw Sci"},{"key":"1402_CR27","doi-asserted-by":"crossref","unstructured":"Leblay J, Chekol MW, Liu X (2020) Towards temporal knowledge graph embeddings with arbitrary time precision. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp 685\u2013694","DOI":"10.1145\/3340531.3412028"},{"key":"1402_CR28","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2011) Patterns of temporal variation in online media. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, pp 177\u2013186","DOI":"10.1145\/1935826.1935863"},{"key":"1402_CR29","doi-asserted-by":"crossref","unstructured":"Zhao Q, Erdogdu MA, He HY, Rajaraman A, Leskovec J (2015) Seismic: A self-exciting point process model for predicting tweet popularity. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 1513\u20131522","DOI":"10.1145\/2783258.2783401"},{"key":"1402_CR30","doi-asserted-by":"publisher","first-page":"2533","DOI":"10.1007\/s00521-018-3937-8","volume":"32","author":"S Malakar","year":"2020","unstructured":"Malakar S, Ghosh M, Bhowmik S, Sarkar R, Nasipuri M (2020) A ga based hierarchical feature selection approach for handwritten word recognition. Neural Comput Appl 32:2533\u20132552","journal-title":"Neural Comput Appl"},{"issue":"1","key":"1402_CR31","doi-asserted-by":"publisher","first-page":"6302","DOI":"10.1038\/s41598-022-09744-2","volume":"12","author":"N Bacanin","year":"2022","unstructured":"Bacanin N, Zivkovic M, Al-Turjman F, Venkatachalam K, Trojovsk\u1ef3 P, Strumberger I, Bezdan T (2022) Hybridized sine cosine algorithm with convolutional neural networks dropout regularization application. Sci Rep 12(1):6302","journal-title":"Sci Rep"},{"issue":"21","key":"1402_CR32","doi-asserted-by":"publisher","first-page":"2705","DOI":"10.3390\/math9212705","volume":"9","author":"N Bacanin","year":"2021","unstructured":"Bacanin N, Stoean R, Zivkovic M, Petrovic A, Rashid TA, Bezdan T (2021) Performance of a novel chaotic firefly algorithm with enhanced exploration for tackling global optimization problems: Application for dropout regularization. Mathematics 9(21):2705","journal-title":"Mathematics"},{"key":"1402_CR33","doi-asserted-by":"crossref","unstructured":"He X, Gao M, Kan M-Y, Liu Y, Sugiyama K (2014) Predicting the popularity of web 2.0 items based on user comments. In: Proceedings of the 37th International ACM SIGIR Conference on Research & Development in Information Retrieval, pp 233\u2013242","DOI":"10.1145\/2600428.2609558"},{"key":"1402_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40747-023-01037-z","volume":"9","author":"Z Hou","year":"2023","unstructured":"Hou Z, Zhou Y, Wu X, Bu F (2023) Attention-based spatial-temporal multi-graph convolutional networks for casualty prediction of terrorist attacks. Complex Intell Syst 9:1\u201322","journal-title":"Complex Intell Syst"},{"key":"1402_CR35","first-page":"1","volume":"10","author":"H Yang","year":"2023","unstructured":"Yang H, Li Z, Qi Y (2023) Predicting traffic propagation flow in urban road network with multi-graph convolutional network. Complex Intell Syst 10:1\u201313","journal-title":"Complex Intell Syst"},{"key":"1402_CR36","unstructured":"Zhu Y, Xu W, Zhang J, Du Y, Zhang J, Liu Q, Yang C, Wu S (2021) A survey on graph structure learning: progress and opportunities. arXiv preprint arXiv:2103.03036"},{"key":"1402_CR37","doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S, Sun J (2016) Deep residual learning for image recognition. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp 770\u2013778","DOI":"10.1109\/CVPR.2016.90"},{"key":"1402_CR38","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907v4"},{"key":"1402_CR39","doi-asserted-by":"publisher","first-page":"9903","DOI":"10.1109\/ACCESS.2021.3050607","volume":"9","author":"R Jin","year":"2021","unstructured":"Jin R, Xia T, Liu X, Murata T, Kim K-S (2021) Predicting emergency medical service demand with bipartite graph convolutional networks. IEEE Access 9:9903\u20139915","journal-title":"IEEE Access"},{"key":"1402_CR40","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter S, Schmidhuber J (1997) Long short-term memory. Neural Comput 9:1735\u201380","journal-title":"Neural Comput"},{"key":"1402_CR41","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser \u0141, Polosukhin I (2017) Attention is all you need. In: Advances in Neural Information Processing Systems, pp 5998\u20136008"},{"key":"1402_CR42","unstructured":"Xu D, Ruan C, Korpeoglu E, Kumar S, Achan K (2020) Inductive representation learning on temporal graphs. arXiv preprint arXiv:2002.07962"},{"key":"1402_CR43","unstructured":"Rossi E, Chamberlain B, Frasca F, Eynard D, Monti F, Bronstein M (2020) Temporal graph networks for deep learning on dynamic graphs. arXiv preprint arXiv:2006.10637"},{"key":"1402_CR44","doi-asserted-by":"crossref","unstructured":"Wang X, Lyu D, Li M, Xia Y, Yang Q, Wang X, Wang X, Cui P, Yang Y, Sun B, et al (2021) Apan: Asynchronous propagation attention network for real-time temporal graph embedding. In: SIGMOD2021, pp 2628\u20132638","DOI":"10.1145\/3448016.3457564"},{"key":"1402_CR45","unstructured":"Uechi Y (2022) VTuber 1B: large-scale live chat and moderation events dataset. https:\/\/holodata.org\/vtuber-1b"},{"key":"1402_CR46","doi-asserted-by":"crossref","unstructured":"Kumar S, Zhang X, Leskovec J (2019) Predicting dynamic embedding trajectory in temporal interaction networks. In: KDD2019, pp 1269\u20131278","DOI":"10.1145\/3292500.3330895"},{"key":"1402_CR47","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1109\/ACCESS.2017.2779939","volume":"6","author":"F Karim","year":"2018","unstructured":"Karim F, Majumdar S, Darabi H, Chen S (2018) Lstm fully convolutional networks for time series classification. IEEE Access 6:1662\u20131669","journal-title":"IEEE Access"},{"key":"1402_CR48","doi-asserted-by":"crossref","unstructured":"Hu Z, Dong Y, Wang K, Sun Y (2020) Heterogeneous graph transformer. In: Proceedings of the Web Conference 2020, pp 2704\u20132710","DOI":"10.1145\/3366423.3380027"},{"issue":"200","key":"1402_CR49","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32(200):675\u2013701","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"1402_CR50","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11(1):86\u201392","journal-title":"Ann Math Stat"},{"issue":"6","key":"1402_CR51","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1080\/03610928008827904","volume":"9","author":"RL Iman","year":"1980","unstructured":"Iman RL, Davenport JM (1980) Approximations of the critical region of the Fbietkan statistic. Commun Stat Theory Methods 9(6):571\u2013595","journal-title":"Commun Stat Theory Methods"},{"issue":"1","key":"1402_CR52","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1111\/j.2517-6161.1995.tb02031.x","volume":"57","author":"Y Benjamini","year":"1995","unstructured":"Benjamini Y, Hochberg Y (1995) Controlling the false discovery rate: a practical and powerful approach to multiple testing. J R Stat Soc Ser B (Methodol) 57(1):289\u2013300","journal-title":"J R Stat Soc Ser B (Methodol)"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01402-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01402-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01402-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T04:03:29Z","timestamp":1721448209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01402-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,2]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["1402"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01402-6","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,2]]},"assertion":[{"value":"15 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This work adheres to the guidelines and ethical considerations outlined in the privacy policies of each social media platform involved in our study. We acknowledge the public nature and free accessibility of content posted on social network platforms, which are not password-protected and have thousands of active users. All analyses are conducted using publicly available data, and we do not attempt to track users across different platforms. In data preprocessing, we anonymized all user names or account IDs. Our data sets do not contain any information about individuals, and we have taken measures to ensure that our results do not disclose the identity of any specific account.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}