{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T00:41:29Z","timestamp":1776559289583,"version":"3.51.2"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030871000","type":"print"},{"value":"9783030871017","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-87101-7_8","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T23:40:49Z","timestamp":1632094849000},"page":"70-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Walk Extraction Strategies for Node Embeddings with RDF2Vec in Knowledge Graphs"],"prefix":"10.1007","author":[{"given":"Bram","family":"Steenwinckel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Vandewiele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pieter","family":"Bonte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Weyns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heiko","family":"Paulheim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petar","family":"Ristoski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"De Turck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Femke","family":"Ongenae","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"issue":"10","key":"8_CR1","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., et al.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Experiment 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech. Theory Experiment"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Cochez, M., et al.: Biased graph walks for RDF graph embeddings. In: Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics, pp. 1\u201312 (2017)","DOI":"10.1145\/3102254.3102279"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75 (2010)","journal-title":"Phys. Rep."},{"key":"8_CR4","unstructured":"Goldberg, Y., Levy, O.: word2vec explained: deriving Mikolov et al.\u2019s negative-sampling word-embedding method. arXiv preprint arXiv:1402.3722 (2014)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"8_CR6","unstructured":"Hamilton, W.L., et al.: Representation Learning on Graphs: Methods and Applications. Preprint of article to appear in the IEEE Data Engineering Bulletin (2017)"},{"key":"8_CR7","unstructured":"Ivanov, S., Burnaev, E.: Anonymous walk embeddings. arXiv preprint arXiv:1805.11921 (2018)"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0195-3","volume":"5","author":"NM Kriege","year":"2019","unstructured":"Kriege, N.M., Johansson, F.D., Morris, C.: A survey on graph kernels. Appl. Network Sci. 5(1), 1\u201342 (2019). https:\/\/doi.org\/10.1007\/s41109-019-0195-3","journal-title":"Appl. Network Sci."},{"key":"8_CR9","unstructured":"Lambiotte, R., et al.: Laplacian dynamics and multiscale modular structure in networks. arXiv preprint arXiv:0812.1770 (2008)"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.3233\/SW-140134","volume":"6","author":"J Lehmann","year":"2015","unstructured":"Lehmann, J., et al.: Dbpedia-a large-scale, multilingual knowledge base extracted from wikipedia. Semantic Web 6(2), 167\u2013195 (2015)","journal-title":"Semantic Web"},{"key":"8_CR11","unstructured":"Mikolov, T., et al.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems (2013)"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/JPROC.2015.2483592","volume":"104","author":"M Nickel","year":"2015","unstructured":"Nickel, M., et al.: A review of relational machine learning for knowledge graphs. Proc. IEEE 104(1), 11\u201333 (2015)","journal-title":"Proc. IEEE"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-030-49461-2_33","volume-title":"The Semantic Web","author":"MA Pellegrino","year":"2020","unstructured":"Pellegrino, M.A., Altabba, A., Garofalo, M., Ristoski, P., Cochez, M.: GEval: a modular and extensible evaluation framework for graph embedding techniques. In: Harth, A., et al. (eds.) ESWC 2020. LNCS, vol. 12123, pp. 565\u2013582. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-49461-2_33"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Perozzi, B., et al.: 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, pp. 258\u2013265 (2017)","DOI":"10.1145\/3110025.3110086"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-319-46547-0_20","volume-title":"The Semantic Web \u2013 ISWC 2016","author":"P Ristoski","year":"2016","unstructured":"Ristoski, P., de Vries, G.K.D., Paulheim, H.: A collection of benchmark datasets for systematic evaluations of machine learning on the semantic web. In: Groth, P., et al. (eds.) ISWC 2016. LNCS, vol. 9982, pp. 186\u2013194. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46547-0_20"},{"key":"8_CR16","unstructured":"Ristoski, P., Paulheim, H.: A comparison of propositionalization strategies for creating features from linked open data. In: Linked Data for Knowledge Discovery (2014)"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.websem.2016.01.001","volume":"36","author":"P Ristoski","year":"2016","unstructured":"Ristoski, P., Paulheim, H.: Semantic web in data mining and knowledge discovery: a comprehensive survey. J. Web Semantics 36, 1\u201322 (2016)","journal-title":"J. Web Semantics"},{"issue":"4","key":"8_CR18","doi-asserted-by":"publisher","first-page":"721","DOI":"10.3233\/SW-180317","volume":"10","author":"P Ristoski","year":"2019","unstructured":"Ristoski, P., et al.: RDF2vec: RDF graph embeddings and their applications. Semantic Web 10(4), 721\u2013752 (2019)","journal-title":"Semantic Web"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-319-93417-4_38","volume-title":"The Semantic Web","author":"M Schlichtkrull","year":"2018","unstructured":"Schlichtkrull, M., Kipf, T.N., Bloem, P., van\u00a0den Berg, R., Titov, I., Welling, M.: Modeling relational data with graph convolutional networks. In: Gangemi, A., et al. (eds.) ESWC 2018. LNCS, vol. 10843, pp. 593\u2013607. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93417-4_38"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Schl\u00f6tterer, J., et al.: Investigating extensions to random walk based graph embedding. In: 2019 IEEE International Conference on Cognitive Computing (ICCC), pp. 81\u201389. IEEE (2019)","DOI":"10.1109\/ICCC.2019.00026"},{"key":"8_CR21","first-page":"93","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen, P., et al.: Collective classification in network data. AI Mag. 29, 93 (2008)","journal-title":"AI Mag."},{"key":"8_CR22","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., et al.: Weisfeiler-Lehman graph kernels. J. Mach. Learn. Res. 12, 2539\u20132561 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"8_CR23","unstructured":"Vandewiele, G., et al.: Inducing a decision tree with discriminative paths to classify entities in a knowledge graph. In: SEPDA2019, the 4th International Workshop on Semantics-Powered Data Mining and Analytics, pp. 1\u20136 (2019)"},{"key":"8_CR24","first-page":"1201","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"Vishwanathan, S.V.N., et al.: Graph kernels. J. Mach. Learn. Res. 11, 1201\u20131242 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/978-3-642-40988-2_39","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"GKD Vries","year":"2013","unstructured":"Vries, G.K.D.: A fast approximation of the Weisfeiler-Lehman graph kernel for RDF data. In: Blockeel, H., Kersting, K., Nijssen, S., \u017delezn\u00fd, F. (eds.) ECML PKDD 2013. LNCS (LNAI), vol. 8188, pp. 606\u2013621. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40988-2_39"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.websem.2015.08.002","volume":"35","author":"GKD de Vries","year":"2015","unstructured":"de Vries, G.K.D., de Rooij, S.: Substructure counting graph kernels for machine learning from RDF data. Web Semantics Sci. Serv. Agents World Wide Web 35, 71\u201384 (2015)","journal-title":"Web Semantics Sci. Serv. Agents World Wide Web"},{"key":"8_CR27","unstructured":"Weisfeiler, B., Lehman, A.A.: A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsia 2(9), 12\u201316 (1968)"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.3233\/DS-170007","volume":"1","author":"X Wilcke","year":"2017","unstructured":"Wilcke, X., et al.: The knowledge graph as the default data model for machine learning. Data Sci. 1, 39\u201357 (2017). https:\/\/doi.org\/10.3233\/DS-170007","journal-title":"Data Sci."},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Yanardag, P., Vishwanathan, S.: Deep graph kernels. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1365\u20131374 (2015)","DOI":"10.1145\/2783258.2783417"}],"container-title":["Communications in Computer and Information Science","Database and Expert Systems Applications - DEXA 2021 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87101-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T22:03:52Z","timestamp":1649887432000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87101-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030871000","9783030871017"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87101-7_8","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","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":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"149","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":"37","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":"31","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":"25% - 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":"4","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","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"DEXA 2021 Workshops: 50 papers submitted, 23 papers accepted","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)"}}]}}