{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:34:24Z","timestamp":1757619264598,"version":"3.44.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,18]],"date-time":"2025-07-18T00:00:00Z","timestamp":1752796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,18]],"date-time":"2025-07-18T00:00:00Z","timestamp":1752796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP24KJ0764"],"award-info":[{"award-number":["JP24KJ0764"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJSP2108"],"award-info":[{"award-number":["JPMJSP2108"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"name":"TechnoPro Holdings, Inc."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Recent advances in machine learning have prompted researchers to integrate complex network structures into computational frameworks to improve inferential capabilities. Node embedding has become a promising technique in this area. However, challenges persist in accurately representing the structural characteristics of nodes in weighted networks. In this study, we propose SDW2vec, which learns the embeddings of nodes in weighted networks while preserving structural properties. Our proposed methodology addresses these challenges through a multi-scale comparison of link weights among adjacent nodes up to a predefined hop count. This approach facilitates the calculation of distances between nodes\u2019 structural configurations across multiple scales. We subsequently construct weighted multi-layer graphs based on these distance measurements, apply random walks to generate node sequences, and learn the embedding representations using the Skip-gram model. The efficacy of our methodology is validated through both the interpretability of embedding representations in controlled network environments and the structural reproducibility demonstrated in real-world networks.<\/jats:p>","DOI":"10.1007\/s41109-025-00722-x","type":"journal-article","created":{"date-parts":[[2025,7,18]],"date-time":"2025-07-18T07:29:16Z","timestamp":1752823756000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SDW2vec: learning structural representations of nodes in weighted networks"],"prefix":"10.1007","volume":"10","author":[{"given":"Shu","family":"Liu","sequence":"first","affiliation":[]},{"given":"Masaki","family":"Chujyo","sequence":"additional","affiliation":[]},{"given":"Fujio","family":"Toriumi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"key":"722_CR1","unstructured":"Ahmed NK, Rossi RA, Lee JB, Willke TL, Zhou R, Kong X, Eldardiry H (2019) role2vec: role-based network embeddings. In Proceeding DLG KDD, pp 1\u20137"},{"key":"722_CR2","doi-asserted-by":"publisher","first-page":"2401","DOI":"10.1109\/TKDE.2020.3006475","volume":"34","author":"N Ahmed","year":"2020","unstructured":"Ahmed N, Rossi RA, Lee J, Willke T, Zhou R, Kong X, Eldardiry H (2020) Role-based graph embeddings. IEEE Trans Knowl Data Eng 34:2401","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"11","key":"722_CR3","doi-asserted-by":"publisher","first-page":"3747","DOI":"10.1073\/pnas.0400087101","volume":"101","author":"A Barrat","year":"2004","unstructured":"Barrat A, Barthelemy M, Pastor-Satorras R, Vespignani A (2004) The architecture of complex weighted networks. Proc Natl Acad Sci 101(11):3747\u20133752","journal-title":"Proc Natl Acad Sci"},{"issue":"1\u20133","key":"722_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2010.11.002","volume":"499","author":"M Barth\u00e9lemy","year":"2011","unstructured":"Barth\u00e9lemy M (2011) Spatial networks. Phys Rep 499(1\u20133):1\u2013101","journal-title":"Phys Rep"},{"issue":"3","key":"722_CR5","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-2496(75)90028-0","volume":"12","author":"RL Breiger","year":"1975","unstructured":"Breiger RL, Boorman SA, Arabie P (1975) An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling. J Math Psychol 12(3):328\u2013383","journal-title":"J Math Psychol"},{"issue":"5","key":"722_CR6","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"},{"key":"722_CR7","doi-asserted-by":"crossref","unstructured":"Donnat C, Zitnik M, Hallac D, Leskovec J (2018) Learning structural node embeddings via diffusion wavelets. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp 1320\u20131329","DOI":"10.1145\/3219819.3220025"},{"issue":"2","key":"722_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0378-8733(97)00016-6","volume":"20","author":"LC Freeman","year":"1998","unstructured":"Freeman LC, Webster CM, Kirke DM (1998) Exploring social structure using dynamic three-dimensional color images. Soc Netw 20(2):109\u2013118","journal-title":"Soc Netw"},{"key":"722_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal P, Ferrara E (2018) Graph embedding techniques, applications, and performance: a survey. Knowl-Based Syst 151:78\u201394","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"722_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0003-3472(73)80004-1","volume":"21","author":"TR Grant","year":"1973","unstructured":"Grant TR (1973) Dominance and association among members of a captive and a free-ranging group of grey kangaroos (Macropus giganteus). Anim Behav 21(3):449\u2013456","journal-title":"Anim Behav"},{"issue":"3","key":"722_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1111\/j.1469-7998.1991.tb03832.x","volume":"225","author":"CC Hass","year":"1991","unstructured":"Hass CC (1991) Social status in female bighorn sheep (Ovis canadensis): expression, development and reproductive correlates. J Zool 225(3):509\u2013523","journal-title":"J Zool"},{"issue":"5","key":"722_CR12","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1511\/2006.61.3495","volume":"94","author":"B Hayes","year":"2006","unstructured":"Hayes B (2006) Connecting the dots: can the tools of graph theory and social-network studies unravel the next big plot? Am Sci 94(5):400\u2013404","journal-title":"Am Sci"},{"key":"722_CR13","doi-asserted-by":"crossref","unstructured":"Heimann M, Shen H, Safavi T, Koutra D (2018) Regal: Representation learning-based graph alignment. In: Proceedings of the 27th ACM international conference on information and knowledge management, pp 117\u2013126","DOI":"10.1145\/3269206.3271788"},{"key":"722_CR14","volume-title":"The Stanford GraphBase: a platform for combinatorial computing","author":"DE Knuth","year":"1993","unstructured":"Knuth DE (1993) The Stanford GraphBase: a platform for combinatorial computing, vol 37. Addison-Wesley, Reading"},{"key":"722_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.124289","volume":"553","author":"A Kumar","year":"2020","unstructured":"Kumar A, Singh SS, Singh K, Biswas B (2020) Link prediction techniques, applications, and performance: a survey. XXPhys A 553:124289","journal-title":"XXPhys A"},{"key":"722_CR16","doi-asserted-by":"crossref","unstructured":"Kumar S, Spezzano F, Subrahmanian VS, Faloutsos C (2016) Edge weight prediction in weighted signed networks. In: Proceedings international conference on data mining, pp 221\u2013230","DOI":"10.1109\/ICDM.2016.0033"},{"key":"722_CR17","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) KONECT\u2013the Koblenz network collection. In: Proceedings international conference on world wide web, pp 1343\u20131350. http:\/\/dl.acm.org\/citation.cfm?id=2488173","DOI":"10.1145\/2487788.2488173"},{"issue":"1","key":"722_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-022-00509-4","volume":"7","author":"S Liu","year":"2022","unstructured":"Liu S, Toriumi F, Nishiguchi M, Usui S (2022) A flexible framework for multiple-role discovery in real networks. Appl Netw Sci 7(1):1\u201323","journal-title":"Appl Netw Sci"},{"key":"722_CR19","doi-asserted-by":"crossref","unstructured":"Liu S, Toriumi F, Nishiguchi M, Usui S (2021) Multiple role discovery in complex networks. In: International conference on complex networks and their applications. Springer, pp 415\u2013427","DOI":"10.1007\/978-3-030-93413-2_35"},{"key":"722_CR20","doi-asserted-by":"crossref","unstructured":"Massa P, Salvetti M, Tomasoni D (2009) Bowling alone and trust decline in social network sites. In: Proceedings of the international conference on dependable, autonomic and secure computing, pp 658\u2013663","DOI":"10.1109\/DASC.2009.130"},{"key":"722_CR21","unstructured":"Mikolov T, Chen K, Corrado G, Dean J (2013) Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781"},{"issue":"3","key":"722_CR22","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","volume":"32","author":"T Opsahl","year":"2010","unstructured":"Opsahl T, Agneessens F, Skvoretz J (2010) Node centrality in weighted networks: generalizing degree and shortest paths. Soc Netw 32(3):245\u2013251","journal-title":"Soc Netw"},{"key":"722_CR23","unstructured":"Opsahl T. Why anchorage is not (that) important: binary ties and sample selection. http:\/\/wp.me\/poFcY-Vw"},{"key":"722_CR24","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V, Vanderplas J, Passos A, Cournapeau D, Brucher M, Perrot M, Duchesnay E (2011) Scikit-learn: machine learning in Python. J Mach Learn Res 12:2825\u20132830","journal-title":"J Mach Learn Res"},{"key":"722_CR25","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"722_CR26","doi-asserted-by":"publisher","unstructured":"Perozzi B, Kulkarni V, Chen H, Skiena S (2017) Don\u2019t walk, skip! Online learning of multi-scale network embeddings. In: Proceedings of the 2017 IEEE\/ACM international conference on advances in social networks analysis and mining 2017. ASONAM \u201917. Association for computing machinery, New York, NY, USA, pp 258\u2013265. https:\/\/doi.org\/10.1145\/3110025.3110086","DOI":"10.1145\/3110025.3110086"},{"issue":"1","key":"722_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1086\/soutjanth.10.1.3629074","volume":"10","author":"KE Read","year":"1954","unstructured":"Read KE (1954) Cultures of the central highlands, New Guinea. Southwest J Anthropol 10(1):1\u201343","journal-title":"Southwest J Anthropol"},{"key":"722_CR28","doi-asserted-by":"publisher","unstructured":"Ribeiro LFR, Savarese PHP, Figueiredo DR struc2vec: learning node representations from structural identity, pp 385\u2013394. https:\/\/doi.org\/10.1145\/3097983.3098061, arxiv:1704.03165","DOI":"10.1145\/3097983.3098061"},{"key":"722_CR29","doi-asserted-by":"crossref","unstructured":"Ribeiro LF, Saverese PH, Figueiredo DR (2017) struc2vec: learning node representations from structural identity. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 385\u2013394","DOI":"10.1145\/3097983.3098061"},{"issue":"4","key":"722_CR30","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TKDE.2014.2349913","volume":"27","author":"RA Rossi","year":"2014","unstructured":"Rossi RA, Ahmed NK (2014) Role discovery in networks. IEEE Trans Knowl Data Eng 27(4):1112\u20131131","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"722_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3397191","volume":"14","author":"RA Rossi","year":"2020","unstructured":"Rossi RA, Jin D, Kim S, Ahmed NK, Koutra D, Lee JB (2020) On proximity and structural role-based embeddings in networks: misconceptions, techniques, and applications. ACM Trans Knowl Discov Data (TKDD) 14(5):1\u201337","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"3\u20134","key":"722_CR32","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1159\/000155480","volume":"18","author":"DS Sade","year":"1972","unstructured":"Sade DS (1972) Sociometrics of Macaca mulatta I. linkages and cliques in grooming matrices. Folia Primatol 18(3\u20134):196\u2013223","journal-title":"Folia Primatol"},{"issue":"5","key":"722_CR33","doi-asserted-by":"publisher","first-page":"561","DOI":"10.3233\/IDA-2007-11508","volume":"11","author":"S Salvador","year":"2007","unstructured":"Salvador S, Chan P (2007) Toward accurate dynamic time warping in linear time and space. Intell Data Anal 11(5):561\u2013580","journal-title":"Intell Data Anal"},{"key":"722_CR34","doi-asserted-by":"crossref","unstructured":"Tang J, Aggarwal C, Liu H (2016) Node classification in signed social networks. In: Proceedings of the 2016 SIAM international conference on data mining. SIAM, pp 54\u201362","DOI":"10.1137\/1.9781611974348.7"},{"key":"722_CR35","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2019) How powerful are graph neural networks? In: International conference on learning representations. https:\/\/openreview.net\/forum?id=ryGs6iA5Km"},{"issue":"2","key":"722_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3491206","volume":"55","author":"J Zhou","year":"2022","unstructured":"Zhou J, Liu L, Wei W, Fan J (2022) Network representation learning: from preprocessing, feature extraction to node embedding. ACM Comput Surv (CSUR) 55(2):1\u201335","journal-title":"ACM Comput Surv (CSUR)"},{"key":"722_CR37","doi-asserted-by":"crossref","unstructured":"Zhou C, Liu Y, Liu X, Liu Z, Gao J (2017) Scalable graph embedding for asymmetric proximity. In: Proceedings of the 31st AAAI conference on artificial intelligence. AAAI\u201917. AAAI Press, pp 2942\u20132948","DOI":"10.1609\/aaai.v31i1.10878"},{"key":"722_CR38","doi-asserted-by":"crossref","unstructured":"Zhou C, Liu Y, Liu X, Liu Z, Gao J (2017) Scalable graph embedding for asymmetric proximity. In: Proceedings of the AAAI conference on artificial intelligence, vol 31","DOI":"10.1609\/aaai.v31i1.10878"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00722-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-025-00722-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00722-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T15:30:45Z","timestamp":1757259045000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-025-00722-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,18]]},"references-count":38,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["722"],"URL":"https:\/\/doi.org\/10.1007\/s41109-025-00722-x","relation":{},"ISSN":["2364-8228"],"issn-type":[{"type":"electronic","value":"2364-8228"}],"subject":[],"published":{"date-parts":[[2025,7,18]]},"assertion":[{"value":"31 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no conflict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"32"}}