{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T01:05:18Z","timestamp":1771549518300,"version":"3.50.1"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T00:00:00Z","timestamp":1637539200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2022,7,31]]},"abstract":"<jats:p>Complex user behavior, especially in settings such as social media, can be organized as time-evolving networks. Through network embedding, we can extract general-purpose vector representations of these dynamic networks which allow us to analyze them without extensive feature engineering. Prior work has shown how to generate network embeddings while preserving the structural role proximity of nodes. These methods, however, cannot capture the temporal evolution of the structural identity of the nodes in dynamic networks. Other works, on the other hand, have focused on learning microscopic dynamic embeddings. Though these methods can learn node representations over dynamic networks, these representations capture the local context of nodes and do not learn the structural roles of nodes. In this article, we propose a novel method for learning structural node embeddings in discrete-time dynamic networks. Our method, called<jats:monospace>HR2vec<\/jats:monospace>, tracks historical topology information in dynamic networks to learn dynamic structural role embeddings. Through experiments on synthetic and real-world temporal datasets, we show that our method outperforms other well-known methods in tasks where structural equivalence and historical information both play important roles.<jats:monospace>HR2vec<\/jats:monospace>can be used to model dynamic user behavior in any networked setting where users can be represented as nodes. Additionally, we propose a novel method (called network fingerprinting) that uses<jats:monospace>HR2vec<\/jats:monospace>embeddings for modeling whole (or partial) time-evolving networks. We showcase our network fingerprinting method on synthetic and real-world networks. Specifically, we demonstrate how our method can be used for detecting foreign-backed information operations on Twitter.<\/jats:p>","DOI":"10.1145\/3472955","type":"journal-article","created":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T17:41:55Z","timestamp":1637602915000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Dynamic Structural Role Node Embedding for User Modeling in Evolving Networks"],"prefix":"10.1145","volume":"40","author":[{"given":"Lili","family":"Wang","sequence":"first","affiliation":[{"name":"Dartmouth College, NH 03755, Hanover, USA"}]},{"given":"Chenghan","family":"Huang","sequence":"additional","affiliation":[{"name":"Millennium Management LLC, New York, USA"}]},{"given":"Ying","family":"Lu","sequence":"additional","affiliation":[{"name":"Stony Brook University, 100 Nicolls Rd., Stony Brook, NY 11794, New York, USA"}]},{"given":"Weicheng","family":"Ma","sequence":"additional","affiliation":[{"name":"Dartmouth College, NH 03755, Hanover, USA"}]},{"given":"Ruibo","family":"Liu","sequence":"additional","affiliation":[{"name":"Dartmouth College, NH 03755, Hanover, USA"}]},{"given":"Soroush","family":"Vosoughi","sequence":"additional","affiliation":[{"name":"Dartmouth College, NH 03755, Hanover, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,22]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2160718.2160738"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806512"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132925"},{"key":"e_1_3_2_5_2","article-title":"Traffic graph convolutional recurrent neural network: A deep learning framework for network-scale traffic learning and forecasting","author":"Cui Zhiyong","year":"2019","unstructured":"Zhiyong Cui, Kristian Henrickson, Ruimin Ke, and Yinhai Wang. 2019. Traffic graph convolutional recurrent neural network: A deep learning framework for network-scale traffic learning and forecasting. IEEE Transactions on Intelligent Transportation Systems 21, 11 (2019), 4883\u20134894.","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220025"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/1921632.1921636"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186058"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187846"},{"key":"e_1_3_2_10_2","article-title":"DynGEM: Deep embedding method for dynamic graphs","author":"Goyal Palash","year":"2018","unstructured":"Palash Goyal, Nitin Kamra, Xinran He, and Yan Liu. 2018. DynGEM: Deep embedding method for dynamic graphs. arXiv:1805.11273.","journal-title":"arXiv:1805.11273"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/58.1.83"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339723"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.573"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.02.028"},{"key":"e_1_3_2_17_2","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf Thomas N.","year":"2016","unstructured":"Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907.","journal-title":"arXiv:1609.02907"},{"key":"e_1_3_2_18_2","article-title":"Learning temporal attention in dynamic graphs with bilinear interactions","author":"Knyazev Boris","year":"2019","unstructured":"Boris Knyazev, Carolyn Augusta, and Graham W. Taylor. 2019. Learning temporal attention in dynamic graphs with bilinear interactions. arXiv:1909.10367 .","journal-title":"arXiv:1909.10367"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2839770"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1186\/s40488-017-0059-2"},{"issue":"4","key":"e_1_3_2_21_2","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1080\/00031305.2000.10474556","article-title":"Moments determine the tail of a distribution (but not much else)","volume":"54","author":"Lindsay Bruce G.","year":"2000","unstructured":"Bruce G. Lindsay and Prasanta Basak. 2000. Moments determine the tail of a distribution (but not much else). The American Statistician 54, 4 (2000), 248\u2013251.","journal-title":"The American Statistician"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1971.9989788"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357943"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132900"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3377850"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.5555\/2999792.2999959"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3191526"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939751"},{"key":"e_1_3_2_29_2","article-title":"Evolvegcn: Evolving graph convolutional networks for dynamic graphs","author":"Pareja Aldo","year":"2019","unstructured":"Aldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura, Hiroki Kanezashi, Tim Kaler, and Charles E. Leisersen. 2019. Evolvegcn: Evolving graph convolutional networks for dynamic graphs. arXiv:1902.10191.","journal-title":"arXiv:1902.10191"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00684-x"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/1348549.1348562"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.5555\/1367985.1367993"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371845"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289451"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.5555\/3367471.3367683"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_39_2","volume-title":"International Conference on Learning Representations","author":"Trivedi Rakshit","year":"2019","unstructured":"Rakshit Trivedi, Mehrdad Farajtabar, Prasenjeet Biswal, and Hongyuan Zha. 2019. DyRep: Learning representations over dynamic graphs. In International Conference on Learning Representations."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2852958"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220068"},{"key":"e_1_3_2_42_2","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107 Petar","year":"2017","unstructured":"Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv:1710.10903.","journal-title":"arXiv:1710.10903"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_3_2_44_2","first-page":"10147","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"35","author":"Wang Lili","year":"2021","unstructured":"Lili Wang, Chongyang Gao, Chenghan Huang, Ruibo Liu, Weicheng Ma, and Soroush Vosoughi. 2021. Embedding heterogeneous networks into hyperbolic space without meta-path. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35. 10147\u201310155."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-021-00774-4"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412102"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.5555\/3298239.3298270"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.5555\/3504035.3504947"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018669"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242603"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.5555\/3504035.3504106"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2591009"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220054"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472955","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:57Z","timestamp":1750191117000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,22]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7,31]]}},"alternative-id":["10.1145\/3472955"],"URL":"https:\/\/doi.org\/10.1145\/3472955","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,22]]},"assertion":[{"value":"2020-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}