{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T18:08:00Z","timestamp":1778522880562,"version":"3.51.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030461492","type":"print"},{"value":"9783030461508","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-46150-8_24","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T01:02:40Z","timestamp":1588294960000},"page":"395-411","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Node Representation Learning for Directed Graphs"],"prefix":"10.1007","author":[{"given":"Megha","family":"Khosla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurek","family":"Leonhardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Nejdl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avishek","family":"Anand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Abu-El-Haija, S., Perozzi, B., Al-Rfou, R.: Learning edge representations via low-rank asymmetric projections. In: CIKM 2017, pp. 1787\u20131796 (2017)","DOI":"10.1145\/3132847.3132959"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Ammann, L.P.: Robust singular value decompositions: a new approach to projection pursuit. J. Am. Stat. Assoc. 88(422), 505\u2013514 (1993)","DOI":"10.1080\/01621459.1993.10476301"},{"key":"24_CR3","first-page":"585","volume":"14","author":"M Belkin","year":"2002","unstructured":"Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. Adv. Neural Inf. Process. Syst. 14, 585\u2013591 (2002)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Cao, S., Lu, W., Xu, Q.: GraRep: learning graph representations with global structural information. In: CIKM 2015, pp. 891\u2013900 (2015)","DOI":"10.1145\/2806416.2806512"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Cao, S., Lu, W., Xu, Q.: Deep neural networks for learning graph representations. In: Proceedings of AAAI, AAAI 2016, pp. 1145\u20131152 (2016)","DOI":"10.1609\/aaai.v30i1.10179"},{"key":"24_CR6","unstructured":"Chen, M., Yang, Q., Tang, X.: Directed graph embedding. In: IJCAI (2007)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-319-71249-9_38","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M Drobyshevskiy","year":"2017","unstructured":"Drobyshevskiy, M., Korshunov, A., Turdakov, D.: Learning and scaling directed networks via graph embedding. In: Ceci, M., Hollm\u00e9n, J., Todorovski, L., Vens, C., D\u017eeroski, S. (eds.) ECML PKDD 2017. LNCS (LNAI), vol. 10534, pp. 634\u2013650. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71249-9_38"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: Node2vec: scalable feature learning for networks. In: KDD, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"issue":"1","key":"24_CR9","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":"24_CR10","unstructured":"Kipf, T.N., Welling, M.: Variational graph auto-encoders. In: NeurIPS Workshop on Bayesian Deep Learning (NeurIPS-16 BDL) (2016)"},{"issue":"5","key":"24_CR11","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604\u2013632 (1999)","journal-title":"J. ACM"},{"key":"24_CR12","unstructured":"Kunegis, J.: KONECT datasets: Koblenz network collection (2015). http:\/\/konect.uni-koblenz.de"},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/382979.383041","volume":"19","author":"R Lempel","year":"2001","unstructured":"Lempel, R., Moran, S.: SALSA: the stochastic approach for link-structure analysis. ACM Trans. Inf. Syst. (TOIS) 19(2), 131\u2013160 (2001)","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"issue":"7","key":"24_CR14","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58(7), 1019\u20131031 (2007)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"24_CR15","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Proceedings of the 27th Annual Conference on Neural Information Processing Systems 2013, pp. 3111\u20133119 (2013)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Mousazadeh, S., Cohen, I.: Embedding and function extension on directed graph. Sig. Process. 111(C), 137\u2013149 (2015)","DOI":"10.1016\/j.sigpro.2014.12.019"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Ou, M., Cui, P., Pei, J., Zhang, Z., Zhu, W.: Asymmetric transitivity preserving graph embedding. In: KDD, pp. 1105\u20131114 (2016)","DOI":"10.1145\/2939672.2939751"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Pan, S., Hu, R., Long, G., Jiang, J., Yao, L., Zhang, C.: Adversarially regularized graph autoencoder for graph embedding. In: IJCAI 2018, pp. 2609\u20132615 (2018)","DOI":"10.24963\/ijcai.2018\/362"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of SIGKDD, pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"24_CR20","unstructured":"Perrault-Joncas, D.C., Meila, M.: Directed graph embedding: an algorithm based on continuous limits of Laplacian-type operators. In: Advances in Neural Information Processing Systems, pp. 990\u2013998 (2011)"},{"key":"24_CR21","unstructured":"Recht, B., Re, C., Wright, S., Niu, F.: Hogwild: a lock-free approach to parallelizing stochastic gradient descent. In: Advances in Neural Information Processing Systems 24, pp. 693\u2013701 (2011)"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1067\u20131077 (2015)","DOI":"10.1145\/2736277.2741093"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Tsitsulin, A., Mottin, D., Karras, P., M\u00fcller, E.: Verse: versatile graph embeddings from similarity measures. In: Proceedings of the 2018 World Wide Web Conference, pp. 539\u2013548 (2018)","DOI":"10.1145\/3178876.3186120"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Wang, D., Cui, P., Zhu, W.: Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2016, pp. 1225\u20131234 (2016)","DOI":"10.1145\/2939672.2939753"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Ying, R., He, R., Chen, K., Eksombatchai, P., Hamilton, W.L., Leskovec, J.: Graph convolutional neural networks for web-scale recommender systems. In: KDD, pp. 974\u2013983 (2018)","DOI":"10.1145\/3219819.3219890"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Zhou, C., Liu, Y., Liu, X., Liu, Z., Gao, J.: Scalable graph embedding for asymmetric proximity. In: AAAI Conference on Artificial Intelligence (AAAI 2017) (2017)","DOI":"10.1609\/aaai.v31i1.10878"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-46150-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T09:32:58Z","timestamp":1746523978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-46150-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030461492","9783030461508"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46150-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2019.org\/","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"733","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":"130","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":"18% - 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.04","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":"5.3","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)"}},{"value":"ECML PKDD Workshops Information: single-blind review, submissions: 200, full papers accepted: 70, short papers accepted: 46","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}