{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:26:57Z","timestamp":1759883217406,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032060686","type":"print"},{"value":"9783032060693","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:00:00Z","timestamp":1759881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:00:00Z","timestamp":1759881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-06069-3_25","type":"book-chapter","created":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T15:53:19Z","timestamp":1759852399000},"page":"315-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Graph Embedding Through Hub-Aware Random Walks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3206-7600","authenticated-orcid":false,"given":"Aleksandar","family":"Tom\u010di\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1267-5411","authenticated-orcid":false,"given":"Milo\u0161","family":"Savi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9889-8313","authenticated-orcid":false,"given":"Du\u0161an","family":"Simi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2225-7803","authenticated-orcid":false,"given":"Milo\u0161","family":"Radovanovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,8]]},"reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3483595","volume":"55","author":"CD Barros","year":"2021","unstructured":"Barros, C.D., Mendon\u00e7a, M.R., Vieira, A.B., Ziviani, A.: A survey on embedding dynamic graphs. ACM Comput. Surv. 55(1), 1\u201337 (2021)","journal-title":"ACM Comput. Surv."},{"key":"25_CR2","unstructured":"Chen, C., Tao, Y., Lin, H.: Dynamic network embeddings for network evolution analysis. arXiv:1906.09860 (2019)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"De\u00a0Winter, S., Decuypere, T., Mitrovi\u0107, S., Baesens, B., De\u00a0Weerdt, J.: Combining temporal aspects of dynamic networks with node2vec for a more efficient dynamic link prediction. In: 2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 1234\u20131241. IEEE (2018)","DOI":"10.1109\/ASONAM.2018.8508272"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3633518","volume":"15","author":"S Khoshraftar","year":"2024","unstructured":"Khoshraftar, S., An, A.: A survey on graph representation learning methods. ACM Trans. Intell. Syst. Technol. 15(1), 1\u201355 (2024)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-031-82439-5_31","volume-title":"Complex Networks & Their Applications XIII","author":"D Kne\u017eevi\u0107","year":"2025","unstructured":"Kne\u017eevi\u0107, D., Savi\u0107, M., Radovanovi\u0107, M.: Local intrinsic dimensionality for dynamic graph embeddings. In: Cherifi, H., Donduran, M., Rocha, L.M., Cherifi, C., Varol, O. (eds.) Complex Networks & Their Applications XIII, pp. 374\u2013385. Springer, Cham (2025)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Mahdavi, S., Khoshraftar, S., An, A.: dynnode2vec: scalable dynamic network embedding. In: 2018 IEEE International Conference on Big Data (Big Data), pp. 3762\u20133765. IEEE (2018)","DOI":"10.1109\/BigData.2018.8621910"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Mann, H.B., Whitney, D.R.: On a test of whether one of two random variables is stochastically larger than the other. Ann. Math. Stat. 50\u201360 (1947)","DOI":"10.1214\/aoms\/1177730491"},{"key":"25_CR10","unstructured":"Mitrovic, S., De\u00a0Weerdt, J.: Dyn2vec: exploiting dynamic behaviour using difference networks-based node embeddings for classification. In: Proceedings of the International Conference on Data Science, pp. 194\u2013200. CSREA Press (2019)"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Nguyen, G.H., Lee, J.B., Rossi, R.A., Ahmed, N.K., Koh, E., Kim, S.: Continuous-time dynamic network embeddings. In: Companion Proceedings of the Web Conference 2018, WWW 2018, pp. 969\u2013976 (2018). https:\/\/doi.org\/10.1145\/3184558.3191526","DOI":"10.1145\/3184558.3191526"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Nikolentzos, G., Meladianos, P., Vazirgiannis, M.: Matching node embeddings for graph similarity. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, AAAI 2017, pp. 2429\u20132435. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10839"},{"key":"25_CR13","doi-asserted-by":"publisher","unstructured":"Pandhre, S., Mittal, H., Gupta, M., Balasubramanian, V.N.: Stwalk: learning trajectory representations in temporal graphs. In: Proceedings of the ACM India Joint International Conference on Data Science and Management of Data, CODS-COMAD 2018, pp. 210\u2013219. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3152494.3152512","DOI":"10.1145\/3152494.3152512"},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2014. ACM (2014). https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"key":"25_CR15","unstructured":"Radovanovic, M., Nanopoulos, A., Ivanovic, M.: Hubs in space: popular nearest neighbors in high-dimensional data. J. Mach. Learn. Res. 11(sept), 2487\u20132531 (2010)"},{"issue":"11","key":"25_CR16","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1007\/s00607-017-0549-6","volume":"99","author":"M Savi\u0107","year":"2017","unstructured":"Savi\u0107, M., Ivanovi\u0107, M., Radovanovi\u0107, M.: Analysis of high structural class coupling in object-oriented software systems. Computing 99(11), 1055\u20131079 (2017). https:\/\/doi.org\/10.1007\/s00607-017-0549-6","journal-title":"Computing"},{"key":"25_CR17","doi-asserted-by":"publisher","unstructured":"Savi\u0107, M., Kurbalija, V., Radovanovi\u0107, M.: Local intrinsic dimensionality and graphs: towards LID-aware graph embedding algorithms. In: Similarity Search and Applications, pp. 159\u2013172. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-89657-7_13","DOI":"10.1007\/978-3-030-89657-7_13"},{"key":"25_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2023.102272","volume":"119","author":"M Savi\u0107","year":"2023","unstructured":"Savi\u0107, M., Kurbalija, V., Radovanovi\u0107, M.: Local intrinsic dimensionality measures for graphs, with applications to graph embeddings. Inf. Syst. 119, 102272 (2023). https:\/\/doi.org\/10.1016\/j.is.2023.102272","journal-title":"Inf. Syst."},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Singer, U., Guy, I., Radinsky, K.: Node embedding over temporal graphs. arXiv:1903.08889 (2019)","DOI":"10.24963\/ijcai.2019\/640"},{"issue":"2","key":"25_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11676","volume":"17","author":"A Tom\u010di\u0107","year":"2024","unstructured":"Tom\u010di\u0107, A., Savi\u0107, M., Radovanovi\u0107, M.: Hub-aware random walk graph embedding methods for classification. Stat. Anal. Data Mining ASA Data Sci. J. 17(2), e11676 (2024). https:\/\/doi.org\/10.1002\/sam.11676","journal-title":"Stat. Anal. Data Mining ASA Data Sci. J."},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Liu, W., Pei, Y., Wang, L., Zha, D., Fu, T.: Dynamic network embedding by semantic evolution. In: 2019 International Joint Conference on Neural Networks (IJCNN), pp.\u00a01\u20138. IEEE (2019)","DOI":"10.1109\/IJCNN.2019.8852247"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06069-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T15:53:24Z","timestamp":1759852404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06069-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,8]]},"ISBN":["9783032060686","9783032060693"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06069-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,8]]},"assertion":[{"value":"8 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Reykjavik","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iceland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sisap.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}