{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:13:56Z","timestamp":1749615236158,"version":"3.41.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030779634"},{"type":"electronic","value":"9783030779641"}],"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-77964-1_18","type":"book-chapter","created":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T08:03:43Z","timestamp":1623398623000},"page":"224-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Relation Order Histograms as a Network Embedding Tool"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3151-9759","authenticated-orcid":false,"given":"Rados\u0142aw","family":"\u0141azarz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8446-4966","authenticated-orcid":false,"given":"Micha\u0142","family":"Idzik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Al-Rfou, R., Perozzi, B., Zelle, D.: DDGK: learning graph representations for deep divergence graph kernels. In: The World Wide Web Conference, pp. 37\u201348 (2019)","DOI":"10.1145\/3308558.3313668"},{"issue":"6","key":"18_CR2","doi-asserted-by":"publisher","first-page":"68004","DOI":"10.1209\/0295-5075\/81\/68004","volume":"81","author":"JP Bagrow","year":"2008","unstructured":"Bagrow, J.P., Bollt, E.M., Skufca, J.D., Ben-Avraham, D.: Portraits of complex networks. EPL (Europhys. Lett.) 81(6), 68004 (2008)","journal-title":"EPL (Europhys. Lett.)"},{"key":"18_CR3","unstructured":"Borgwardt, K.M., Kriegel, H.P.: Shortest-path kernels on graphs. In: Fifth IEEE International Conference on Data Mining (ICDM 2005), p. 8-pp. IEEE (2005)"},{"issue":"7","key":"18_CR4","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.patrec.2011.04.017","volume":"33","author":"H Bunke","year":"2012","unstructured":"Bunke, H., Riesen, K.: Towards the unification of structural and statistical pattern recognition. Pattern Recogn. Lett. 33(7), 811\u2013825 (2012)","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. (TIST) 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"issue":"15","key":"18_CR6","doi-asserted-by":"publisher","first-page":"1968","DOI":"10.1016\/j.patrec.2012.03.024","volume":"33","author":"W Czech","year":"2012","unstructured":"Czech, W.: Invariants of distance k-graphs for graph embedding. Pattern Recogn. Lett. 33(15), 1968\u20131979 (2012)","journal-title":"Pattern Recogn. Lett."},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-319-39384-1_37","volume-title":"Artificial Intelligence and Soft Computing","author":"W Czech","year":"2016","unstructured":"Czech, W., \u0141azarz, R.: A method of analysis and visualization of structured datasets based on centrality information. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2016. LNCS (LNAI), vol. 9693, pp. 429\u2013441. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39384-1_37"},{"issue":"9","key":"18_CR8","doi-asserted-by":"publisher","first-page":"e4054","DOI":"10.1002\/cpe.4054","volume":"29","author":"W Czech","year":"2017","unstructured":"Czech, W., Mielczarek, W., Dzwinel, W.: Distributed computing of distance-based graph invariants for analysis and visualization of complex networks. Concurr. Comput.: Pract. Exp. 29(9), e4054 (2017)","journal-title":"Concurr. Comput.: Pract. Exp."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Debnath, A.K., Lopez de Compadre, R.L., Debnath, G., Shusterman, A.J., Hansch, C.: Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. Correlation with molecular orbital energies and hydrophobicity. J. Med. Chem. 34(2), 786\u2013797 (1991)","DOI":"10.1021\/jm00106a046"},{"key":"18_CR10","unstructured":"Diehl, F.: Edge contraction pooling for graph neural networks. CoRR (2019)"},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/S0022-2836(03)00628-4","volume":"330","author":"PD Dobson","year":"2003","unstructured":"Dobson, P.D., Doig, A.J.: Distinguishing enzyme structures from non-enzymes without alignments. J. Mol. Biol. 330(4), 771\u2013783 (2003)","journal-title":"J. Mol. Biol."},{"key":"18_CR12","unstructured":"Gao, H., Ji, S.: Graph U-nets. In: International Conference on Machine Learning, pp. 2083\u20132092 (2019)"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"P Geurts","year":"2006","unstructured":"Geurts, P., Ernst, D., Wehenkel, L.: Extremely randomized trees. Mach. Learn. 63(1), 3\u201342 (2006)","journal-title":"Mach. Learn."},{"issue":"12","key":"18_CR14","doi-asserted-by":"publisher","first-page":"7695","DOI":"10.1007\/s13369-018-3144-z","volume":"43","author":"M Hacibeyoglu","year":"2018","unstructured":"Hacibeyoglu, M., Ibrahim, M.H.: EF\\_unique: an improved version of unsupervised equal frequency discretization method. Arab. J. Sci. Eng. 43(12), 7695\u20137704 (2018)","journal-title":"Arab. J. Sci. Eng."},{"key":"18_CR15","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems, pp. 1024\u20131034 (2017)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Jiang, J., Cui, Z., Xu, C., Yang, J.: Gaussian-induced convolution for graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 4007\u20134014 (2019)","DOI":"10.1609\/aaai.v33i01.33014007"},{"key":"18_CR17","first-page":"1623","volume":"29","author":"NM Kriege","year":"2016","unstructured":"Kriege, N.M., Giscard, P.L., Wilson, R.: On valid optimal assignment kernels and applications to graph classification. Adv. Neural. Inf. Process. Syst. 29, 1623\u20131631 (2016)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Schneider, P.: Computing shortest paths and diameter in the hybrid network model. In: Proceedings of the 39th Symposium on Principles of Distributed Computing, pp. 109\u2013118 (2020)","DOI":"10.1145\/3382734.3405719"},{"key":"18_CR19","unstructured":"Maron, H., Ben-Hamu, H., Serviansky, H., Lipman, Y.: Provably powerful graph networks. In: Advances in Neural Information Processing Systems, pp. 2156\u20132167 (2019)"},{"key":"18_CR20","unstructured":"Morris, C., Kriege, N.M., Bause, F., Kersting, K., Mutzel, P., Neumann, M.: TUDataset: a collection of benchmark datasets for learning with graphs. arXiv preprint arXiv:2007.08663 (2020)"},{"issue":"2","key":"18_CR21","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10994-015-5517-9","volume":"102","author":"M Neumann","year":"2015","unstructured":"Neumann, M., Garnett, R., Bauckhage, C., Kersting, K.: Propagation kernels: efficient graph kernels from propagated information. Mach. Learn. 102(2), 209\u2013245 (2015). https:\/\/doi.org\/10.1007\/s10994-015-5517-9","journal-title":"Mach. Learn."},{"key":"18_CR22","unstructured":"Nguyen, D., Nguyen, T., Phung, D.: Universal self-attention network for graph classification. arXiv preprint arXiv:1909.11855 (2019)"},{"key":"18_CR23","unstructured":"Niepert, M., Ahmed, M., Kutzkov, K.: Learning convolutional neural networks for graphs. In: International Conference on Machine Learning, pp. 2014\u20132023 (2016)"},{"key":"18_CR24","unstructured":"Rapacz, M., \u0141azarz, R.: Automatic extraction of leaf venation complex networks. In: ECAI 2020, vol. 325, pp. 1914\u20131921. IOS Press (2020)"},{"issue":"12","key":"18_CR25","doi-asserted-by":"publisher","first-page":"e1004680","DOI":"10.1371\/journal.pcbi.1004680","volume":"11","author":"H Ronellenfitsch","year":"2015","unstructured":"Ronellenfitsch, H., Lasser, J., Daly, D.C., Katifori, E.: Topological phenotypes constitute a new dimension in the phenotypic space of leaf venation networks. PLoS Computat. Biol. 11(12), e1004680 (2015)","journal-title":"PLoS Computat. Biol."},{"issue":"5","key":"18_CR26","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1006\/anbo.2001.1391","volume":"87","author":"A Roth-Nebelsick","year":"2001","unstructured":"Roth-Nebelsick, A., Uhl, D., Mosbrugger, V., Kerp, H.: Evolution and function of leaf venation architecture: a review. Ann. Bot. 87(5), 553\u2013566 (2001)","journal-title":"Ann. Bot."},{"key":"18_CR27","unstructured":"Shervashidze, N., Schweitzer, P., Van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-lehman graph kernels. J. Mach. Learn. Res. 12(9) (2011)"},{"key":"18_CR28","unstructured":"Shervashidze, N., Vishwanathan, S., Petri, T., Mehlhorn, K., Borgwardt, K.: Efficient graphlet kernels for large graph comparison. In: Artificial Intelligence and Statistics, pp. 488\u2013495 (2009)"},{"key":"18_CR29","unstructured":"Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014)"},{"key":"18_CR30","unstructured":"Togninalli, M., Ghisu, E., Llinares-L\u00f3pez, F., Rieck, B., Borgwardt, K.: Wasserstein weisfeiler-lehman graph kernels. In: Advances in Neural Information Processing Systems, pp. 6439\u20136449 (2019)"},{"key":"18_CR31","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y.: Graph attention networks. In: International Conference on Learning Representations (2018)"},{"issue":"3","key":"18_CR32","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10115-007-0103-5","volume":"14","author":"N Wale","year":"2008","unstructured":"Wale, N., Watson, I.A., Karypis, G.: Comparison of descriptor spaces for chemical compound retrieval and classification. Knowl. Inf. Syst. 14(3), 347\u2013375 (2008)","journal-title":"Knowl. Inf. Syst."},{"key":"18_CR33","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? In: International Conference on Learning Representations (2018)"},{"key":"18_CR34","unstructured":"Xu, K., Li, C., Tian, Y., Sonobe, T., Kawarabayashi, K.i., Jegelka, S.: Representation learning on graphs with jumping knowledge networks. In: International Conference on Machine Learning, pp. 5453\u20135462 (2018)"},{"key":"18_CR35","unstructured":"Zhang, Z., et al.: Hierarchical graph pooling with structure learning. arXiv preprint arXiv:1911.05954 (2019)"},{"key":"18_CR36","unstructured":"Zhang, Z., Cui, P., Zhu, W.: Deep learning on graphs: a survey. IEEE Trans. Knowl. Data Eng. (2020)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77964-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T22:02:54Z","timestamp":1749592974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77964-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030779634","9783030779641"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77964-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 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":"iccs-computsci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2021\/","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":"156","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":"48","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":"14","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":"31% - 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":"2.8","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":"3.9","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":"212 full and 43 short papers were selected from 479 submissions to the workshops\/ thematic tracks. The conference was held virtually.","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)"}}]}}