{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:23:08Z","timestamp":1743114188127,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953836"},{"type":"electronic","value":"9783030953843"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95384-3_6","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"85-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Wasserstein Graph Auto-Encoder"],"prefix":"10.1007","author":[{"given":"Yan","family":"Chu","sequence":"first","affiliation":[]},{"given":"Haozhuang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hui","family":"Ning","sequence":"additional","affiliation":[]},{"given":"Qingchao","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Nickel, M., et al.: A review of relational machine learning for knowledge graphs. In: Proceedings of the IEEE, vol. 104, no. 1, pp. 11\u201333 (2015)","DOI":"10.1109\/JPROC.2015.2483592"},{"key":"6_CR2","unstructured":"Bennett, J., Lanning, S., et al.: The netflix prize. In: Proceedings of KDD Cup and Workshop, New York, USA, pp. 35 (2007)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Prithviraj, S., et al.: Collective classification of network data. In: AI Magazine, pp. 93\u2013106 (2008)","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"6_CR4","unstructured":"Pei, H., Wei, B., Chang, K.C.C., Lei, Y., Yang, B.: Geom-gcn: geometric graph convolutional networks. In: International Conference on Learning Representations, Addis Ababa, Ethiopia (2020)"},{"key":"6_CR5","unstructured":"Kipf, T.N., Welling, W.: Semi-supervised classification with graph convolutional networks. In: International Conference on Learning Representations, Toulon, France. (2017)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu, Z., et al.: A comprehensive survey on graph neural networks. IEEE Trans. Neural Netw. Learn. Syst. 32, 4\u201324 (2020)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"6_CR7","unstructured":"Kipf, T.N., Welling, M.: Variational graph auto-encoders. arXiv: 1611.07308 (2016). https:\/\/arxiv.org\/abs\/1611.07308"},{"key":"6_CR8","unstructured":"Zhang, M., Li, P., Xia, Y., Wang, K., Jin, L.: Revisiting graph neural networks for link prediction (2020). arXiv preprint arXiv:2010.16103"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"025102","DOI":"10.1103\/PhysRevE.64.025102","volume":"64","author":"M Newman","year":"2001","unstructured":"Newman, M.: Clustering and preferential attachment in growing networks. Phys. Rev. E 64, 025102 (2001)","journal-title":"Phys. Rev. E"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Adamic, L.A., Adar, E.: Friends and neighbors on the web. In: Social Networks, pp. 211\u2013230 (2003)","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou, T., L\u00fc, L., Zhang, Y.C.: Predicting missing links via local information. Eur. Phys. J. B 71, 623\u2013630 (2009)","journal-title":"Eur. Phys. J. B"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: ACM (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: Scalable feature learning for networks. In: ACM (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Tang, J., et al.: LINE: large-scale information network embedding. In: International Conference on World Wide Web WWW (2015)","DOI":"10.1145\/2736277.2741093"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Pan, S., Hu, R., Long, G., Jiang, J., Yao, L., Zhang, C.: Adversarially regularized graph auto-encoder for graph embedding. In: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, pp. 2609\u20132615 (2018)","DOI":"10.24963\/ijcai.2018\/362"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Villani, C.: Topics in optimal transportation. In: AMS Graduate Studies in Mathematics, p. 370 (2003)","DOI":"10.1090\/gsm\/058"},{"key":"6_CR18","unstructured":"Tolstikhin, I., et al.: Wasserstein auto-encoders. arXiv:1711.01558 (2017)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Xu, M., et al.: Towards generalized implementation of wasserstein distance in GANs. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 10514\u201310522 (2021)","DOI":"10.1609\/aaai.v35i12.17258"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Villani, C.: Optimal transport: old and new. In: Grundlehren der mathematischen Wissenschaften. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71050-9","DOI":"10.1007\/978-3-540-71050-9"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Nurminen, H., et al.: 3D angle-of-arrival positioning using von Mises-Fisher distribution. In: 21st International Conference on Information Fusion (2018)","DOI":"10.23919\/ICIF.2018.8455205"},{"key":"6_CR22","unstructured":"Liu, T.H.: Leveraging social media networks for classification. In: Data Mining & Knowledge Discovery (2011)"},{"key":"6_CR23","unstructured":"Kingma, D., Ba, J.: Adam: a method for stochastic optimization. In: Computer Science (2014)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95384-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T17:12:20Z","timestamp":1674839540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95384-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953836","9783030953843"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95384-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"403","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.12","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}