{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T11:18:46Z","timestamp":1648898326713},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T00:00:00Z","timestamp":1638489600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T00:00:00Z","timestamp":1638489600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s00500-021-06580-w","type":"journal-article","created":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T10:06:25Z","timestamp":1638525985000},"page":"1217-1230","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph autoencoder for directed weighted network"],"prefix":"10.1007","volume":"26","author":[{"given":"Yang","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingxing","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangquan","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanghe","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,3]]},"reference":[{"key":"6580_CR1","doi-asserted-by":"crossref","unstructured":"Abu-El-Haija S, Perozzi B, Al-Rfou R (2017) Learning edge representations via low-rank asymmetric projections. In: Proceedings of the 2017 ACM on conference on information and knowledge management. ACM, pp 1787\u20131796","DOI":"10.1145\/3132847.3132959"},{"key":"6580_CR2","doi-asserted-by":"crossref","unstructured":"Barabasi A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","DOI":"10.1126\/science.286.5439.509"},{"key":"6580_CR3","unstructured":"Belkin M (2001) Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Nips, vol 14, pp 585\u2013591"},{"key":"6580_CR4","first-page":"980","volume":"47","author":"T Cunchao","year":"2017","unstructured":"Cunchao T, Cheng Y, Zhiyuan L et al (2017) Network representation learning: an overview. Sci Sin (Informationis) 47:980\u2013996 ((in Chinese))","journal-title":"Sci Sin (Informationis)"},{"key":"6580_CR5","doi-asserted-by":"crossref","unstructured":"Goldberg Y (2016) A primer on neural network models for natural language processing. J Artif Intell Res 57:345\u2013420","DOI":"10.1613\/jair.4992"},{"key":"6580_CR6","doi-asserted-by":"crossref","unstructured":"Goyal P, Ferrara E (2018) graph embedding techniques, applications, and performance: a survey. Knowl Based Syst 151:78\u201394","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"6580_CR7","unstructured":"Goyal P, Kamra N, He X, Liu Y (2018) Dyngem: deep embedding method for dynamic graphs. arXiv:1805.11273"},{"key":"6580_CR8","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"6580_CR9","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Representation learning on graphs: methods and applications. arXiv:1709.05584"},{"key":"6580_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921803","volume-title":"Evaluating learning algorithms: a classification perspective","author":"N Japkowicz","year":"2011","unstructured":"Japkowicz N, Shah M (2011) Evaluating learning algorithms: a classification perspective. Cambridge University Press, Cambridge"},{"key":"6580_CR11","doi-asserted-by":"crossref","unstructured":"Khosla M, Anand A, Setty V (2019) A comprehensive comparison of unsupervised network representation learning methods. arXiv:1903.07902","DOI":"10.1109\/TKDE.2019.2951398"},{"key":"6580_CR12","unstructured":"Kipf TN, Welling M (2016) Variational graph auto-encoders. . arXiv:1611.07308"},{"key":"6580_CR13","first-page":"217","volume":"3201","author":"B Klimt","year":"2004","unstructured":"Klimt B, Yang Y (2004) The enron corpus: a new dataset for email classification research. Ecml 3201:217\u2013226","journal-title":"Ecml"},{"key":"6580_CR14","unstructured":"Lin-Yuan L (2010) Link Prediction on Complex Networks. J Univ Electron Sci Technol China 39(5):651\u2013661"},{"issue":"6","key":"6580_CR15","first-page":"1150","volume":"390","author":"L Linyuan","year":"2010","unstructured":"Linyuan L, Tao Z (2010) Link prediction in complex networks: a survey. Physica A Stat Mech Appl 390(6):1150\u20131170","journal-title":"Physica A Stat Mech Appl"},{"key":"6580_CR16","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. ACM, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"6580_CR17","doi-asserted-by":"crossref","unstructured":"Salha G, Limnios S, Hennequin R, et al (2019) Gravity-inspired graph autoencoders for directed link prediction. In: Proceedings of the 28th ACM international conference on information and knowledge management, pp 589\u2013598","DOI":"10.1145\/3357384.3358023"},{"key":"6580_CR18","unstructured":"Sutskever I, Vinyals O, Le QV (2014) Sequence to sequence learning with neural networks. Adv Neural Inform Process Syst 3104\u20133112"},{"key":"6580_CR19","doi-asserted-by":"crossref","unstructured":"Tan Q, Liu N, Hu X (2019) Deep representation learning for social network analysis. Front Big Data 2","DOI":"10.3389\/fdata.2019.00002"},{"key":"6580_CR20","doi-asserted-by":"crossref","unstructured":"Wang D, Peng C, Zhu W (2016) structural deep network embedding. In: Acm Sigkdd international conference on knowledge discovery and data mining","DOI":"10.1145\/2939672.2939753"},{"key":"6580_CR21","unstructured":"Yang M, Xingxing L, Jincai H, et\u00a0al (2017) Intercity transportation construction based on link prediction. In: 2017 IEEE 29th international conference on tools with artificial intelligence"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06580-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06580-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06580-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T16:20:54Z","timestamp":1643041254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06580-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,3]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["6580"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06580-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,3]]},"assertion":[{"value":"15 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2021","order":2,"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"}}]}}