{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T07:45:57Z","timestamp":1777621557203,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T00:00:00Z","timestamp":1677801600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T00:00:00Z","timestamp":1677801600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Social Science Fund of China","award":["20AZD114"],"award-info":[{"award-number":["20AZD114"]}]},{"name":"Open Research Fund of the Public Security Behavioral Science Laboratory of People\u2019s Public Security University of China","award":["2020SYS08"],"award-info":[{"award-number":["2020SYS08"]}]},{"name":"CCF-Nsfocus \u201cKunpeng\u201d Research Fund","award":["2020011"],"award-info":[{"award-number":["2020011"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00607-023-01158-w","type":"journal-article","created":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T11:02:36Z","timestamp":1677841356000},"page":"1647-1671","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Signed directed attention network"],"prefix":"10.1007","volume":"105","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4478-4663","authenticated-orcid":false,"given":"Yong","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binjun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenmao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,3]]},"reference":[{"key":"1158_CR1","doi-asserted-by":"publisher","unstructured":"Tian F, Gao B, Cui Q, Chen E, Liu T-Y (2014) Learning deep representations for graph clustering. In: Proceedings of the Twenty-Eighth AAAI conference on artificial intelligence, pp 1293\u20131299. https:\/\/doi.org\/10.5555\/2893873.2894074","DOI":"10.5555\/2893873.2894074"},{"key":"1158_CR2","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"key":"1158_CR3","doi-asserted-by":"publisher","first-page":"5165","DOI":"10.5555\/3327345.3327423","volume":"31","author":"M Zhang","year":"2018","unstructured":"Zhang M, Chen Y (2018) Link prediction based on graph neural networks. Adv Neural Inf Process Syst 31:5165\u20135175. https:\/\/doi.org\/10.5555\/3327345.3327423","journal-title":"Adv Neural Inf Process Syst"},{"key":"1158_CR4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.103.022316","author":"A Tandon","year":"2021","unstructured":"Tandon A, Albeshri A, Thayananthan V, Alhalabi W, Radicchi F, Fortunato S (2021) Community detection in networks using graph embeddings. Phys Rev E. https:\/\/doi.org\/10.1103\/PhysRevE.103.022316","journal-title":"Phys Rev E"},{"key":"1158_CR5","doi-asserted-by":"publisher","unstructured":"Kunegis J, Schmidt S, Lommatzsch A, Lerner J, De\u00a0Luca EW, Albayrak S (2010) Spectral analysis of signed graphs for clustering, prediction and visualization. In: Proceedings of the 2010 SIAM international conference on data mining, pp 559\u2013570. https:\/\/doi.org\/10.1137\/1.9781611972801.49","DOI":"10.1137\/1.9781611972801.49"},{"key":"1158_CR6","doi-asserted-by":"publisher","unstructured":"Yuan S, Wu X, Xiang Y (2017) SNE: signed network embedding. In: Pacific-Asia conference on knowledge discovery and data mining, pp 183\u2013195. https:\/\/doi.org\/10.1007\/978-3-319-57529-2_15","DOI":"10.1007\/978-3-319-57529-2_15"},{"key":"1158_CR7","doi-asserted-by":"publisher","unstructured":"Kim J, Park H, Lee J-E, Kang U (2018) Side: representation learning in signed directed networks. In: Proceedings of the 2018 world wide web conference, pp 509\u2013518. https:\/\/doi.org\/10.1145\/3178876.3186117","DOI":"10.1145\/3178876.3186117"},{"key":"1158_CR8","doi-asserted-by":"publisher","unstructured":"Wang S, Tang J, Aggarwal C, Chang Y, Liu H (2017) Signed network embedding in social media. In: Proceedings of the 2017 SIAM international conference on data mining, pp 327\u2013335. https:\/\/doi.org\/10.1137\/1.9781611974973.37","DOI":"10.1137\/1.9781611974973.37"},{"key":"1158_CR9","doi-asserted-by":"publisher","unstructured":"Islam MR, Prakash BA, Ramakrishnan N (2018) Signet: Scalable embeddings for signed networks. In: Pacific-Asia conference on knowledge discovery and data mining, pp 157\u2013169. https:\/\/doi.org\/10.1007\/978-3-319-93037-4_13","DOI":"10.1007\/978-3-319-93037-4_13"},{"key":"1158_CR10","doi-asserted-by":"publisher","unstructured":"Chen Y, Qian T, Liu H, Sun K (2018) Bridge: enhanced signed directed network embedding. In: Proceedings of the 27th ACM international conference on information and knowledge management, pp 773\u2013782. https:\/\/doi.org\/10.1145\/3269206.3271738","DOI":"10.1145\/3269206.3271738"},{"key":"1158_CR11","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907"},{"key":"1158_CR12","first-page":"5119","volume":"30","author":"A Garcia-Duran","year":"2017","unstructured":"Garcia-Duran A, Niepert M (2017) Learning graph representations with embedding propagation. Adv Neural Inf Process Syst 30:5119\u20135130","journal-title":"Adv Neural Inf Process Syst"},{"key":"1158_CR13","doi-asserted-by":"publisher","unstructured":"Pan S, Hu R, Long G, Jiang J, Yao L, Zhang C (2018) Adversarially regularized graph autoencoder for graph embedding. In: International joint conference on artificial intelligence, pp 2609\u20132615. https:\/\/doi.org\/10.24963\/IJCAI.2018\/362","DOI":"10.24963\/IJCAI.2018\/362"},{"key":"1158_CR14","doi-asserted-by":"publisher","unstructured":"Ma T, Chen J, Xiao C (2018) Constrained generation of semantically valid graphs via regularizing variational autoencoders. In: Proceedings in advances in neural information processing systems, pp 7110\u20137121. https:\/\/doi.org\/10.5555\/3327757.3327814","DOI":"10.5555\/3327757.3327814"},{"key":"1158_CR15","unstructured":"Velikovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint arXiv:1710.10903"},{"key":"1158_CR16","doi-asserted-by":"publisher","unstructured":"(2018) Graphvae: Towards generation of small graphs using variational autoencoders. In: the internet corporation for assigned names and numbers, pp 412\u2013422. https:\/\/doi.org\/10.1007\/978-3-030-01418-641","DOI":"10.1007\/978-3-030-01418-641"},{"issue":"1","key":"1158_CR17","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/00223980.1946.9917275","volume":"21","author":"F Heider","year":"1946","unstructured":"Heider F (1946) Attitudes and cognitive organization. J Psychol 21(1):107\u2013112. https:\/\/doi.org\/10.1080\/00223980.1946.9917275","journal-title":"J Psychol"},{"key":"1158_CR18","doi-asserted-by":"publisher","unstructured":"Guha R, Kumar R, Raghavan P, Tomkins A (2004) Propagation of trust and distrust. In: 13th international conference on World Wide Web, pp 403\u2013412. https:\/\/doi.org\/10.1145\/988672.988727","DOI":"10.1145\/988672.988727"},{"key":"1158_CR19","doi-asserted-by":"publisher","unstructured":"Derr T, Ma Y, Tang J (2018) Signed graph convolutional networks. In: IEEE international conference on data mining (ICDM), pp 929\u2013934. https:\/\/doi.org\/10.1109\/ICDM.2018.00113","DOI":"10.1109\/ICDM.2018.00113"},{"key":"1158_CR20","doi-asserted-by":"publisher","unstructured":"Li Y, Tian Y, Zhang J, Chang Y (2020) Learning signed network embedding via graph attention. In: The Thirty-Fourth AAAI conference on artificial intelligence, pp 4772\u20134779. https:\/\/doi.org\/10.1609\/aaai.v34i04.5911","DOI":"10.1609\/aaai.v34i04.5911"},{"key":"1158_CR21","doi-asserted-by":"publisher","unstructured":"Huang J, Shen H, Hou L, Cheng X (2019) Signed graph attention networks. In: International conference on artificial neural networks, pp 566\u2013577. https:\/\/doi.org\/10.1007\/978-3-030-30493-5_53","DOI":"10.1007\/978-3-030-30493-5_53"},{"key":"1158_CR22","doi-asserted-by":"crossref","unstructured":"Huang J, Shen H, Hou L, Cheng X (2021) SDGNN: learning node representation for signed directed networks. arXiv:2101.02390","DOI":"10.1609\/aaai.v35i1.16093"},{"key":"1158_CR23","doi-asserted-by":"publisher","unstructured":"Chiang K-Y, Whang JJ, Dhillon IS (2012) Scalable clustering of signed networks using balance normalized cut. In: Proceedings of the 21st ACM international conference on information and knowledge management, pp 615\u2013624. https:\/\/doi.org\/10.1145\/2396761.2396841","DOI":"10.1145\/2396761.2396841"},{"key":"1158_CR24","doi-asserted-by":"publisher","unstructured":"Hsieh C-J, Chiang K-Y, S.\u00a0Dhillon I (2012) Low rank modeling of signed networks. In: The 18th international conference on knowledge discovery and data mining, pp 507\u2013515. https:\/\/doi.org\/10.1145\/2339530.2339612","DOI":"10.1145\/2339530.2339612"},{"key":"1158_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-020-05484-4","author":"L Pasa","year":"2020","unstructured":"Pasa L, Navarin N, Sperduti A (2020) Som-based aggregation for graph convolutional neural networks. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-020-05484-4","journal-title":"Neural Comput Appl"},{"key":"1158_CR26","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2950416","author":"Z Cui","year":"2020","unstructured":"Cui Z, Henrickson K, Ke R, Wang YH (2020) Traffic graph convolutional recurrent neural network: a deep learning framework for network-scale traffic learning and forecasting. IEEE Transact Intell Transport Syst. https:\/\/doi.org\/10.1109\/TITS.2019.2950416","journal-title":"IEEE Transact Intell Transport Syst"},{"key":"1158_CR27","doi-asserted-by":"publisher","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser L, Polosukhin I (2017) Attention is all you need. In: Proceedings of the 31st international conference on neural information processing systems, pp 6000\u20136010. https:\/\/doi.org\/10.1109\/2943.974352","DOI":"10.1109\/2943.974352"},{"key":"1158_CR28","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.neucom.2020.12.061","volume":"432","author":"M Ma","year":"2021","unstructured":"Ma M, Na S, Wang H (2021) Aegcn: an autoencoder-constrained graph convolutional network. Neurocomputing 432:21\u201331. https:\/\/doi.org\/10.1016\/j.neucom.2020.12.061","journal-title":"Neurocomputing"},{"key":"1158_CR29","doi-asserted-by":"publisher","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the SIGCHI conference on human factors in computing systems., pp 1361\u20131370. https:\/\/doi.org\/10.1145\/1753326.1753532","DOI":"10.1145\/1753326.1753532"},{"key":"1158_CR30","doi-asserted-by":"publisher","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: Proceedings of the 19th international conference on World Wide Web, pp 641\u2013650. https:\/\/doi.org\/10.1145\/1772690.1772756","DOI":"10.1145\/1772690.1772756"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01158-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-023-01158-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01158-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T15:05:52Z","timestamp":1689174352000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-023-01158-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,3]]},"references-count":30,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1158"],"URL":"https:\/\/doi.org\/10.1007\/s00607-023-01158-w","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,3]]},"assertion":[{"value":"5 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2023","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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}