{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T04:22:48Z","timestamp":1769919768866,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030889418","type":"print"},{"value":"9783030889425","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-88942-5_13","type":"book-chapter","created":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T05:14:15Z","timestamp":1633756455000},"page":"166-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Ranking Structured Objects with Graph Neural Networks"],"prefix":"10.1007","author":[{"given":"Clemens","family":"Damke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eyke","family":"H\u00fcllermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,9]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10994-010-5185-8","volume":"81","author":"S Agarwal","year":"2010","unstructured":"Agarwal, S.: Learning to rank on graphs. Mach. Learn. 81(3), 333\u2013357 (2010)","journal-title":"Mach. Learn."},{"key":"13_CR2","unstructured":"Bouritsas, G., Frasca, F., Zafeiriou, S., Bronstein, M.M.: Improving graph neural network expressivity via subgraph isomorphism counting (2020)"},{"key":"13_CR3","unstructured":"Bruna, J., Zaremba, W., Szlam, A., LeCun, Y.: Spectral networks and locally connected networks on graphs (2013)"},{"key":"13_CR4","unstructured":"Burges, C.: From RankNet to LambdaRank to LambdaMART: an overview. Technical report, MSR-TR-2010-82, Microsoft Research (2010)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Burges, C., et al.: Learning to rank using gradient descent. In: ICML (2005)","DOI":"10.1145\/1102351.1102363"},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01305232","volume":"12","author":"J Cai","year":"1992","unstructured":"Cai, J., F\u00fcrer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identification. Combinatorica 12(4), 389\u2013410 (1992)","journal-title":"Combinatorica"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.Y., Tsai, M.F., Li, H.: Learning to rank: from pairwise approach to listwise approach. In: Proceedings of the 24th International Conference on Machine Learning. ACM Press (2007)","DOI":"10.1145\/1273496.1273513"},{"key":"13_CR8","unstructured":"Damke, C., Melnikov, V., H\u00fcllermeier, E.: A novel higher-order Weisfeiler-Lehman graph convolution. In: Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020). Proceedings of Machine Learning Research, vol. 129. PMLR (2020)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-57586-5_22","volume-title":"Algorithms and Complexity","author":"M F\u00fcrer","year":"2017","unstructured":"F\u00fcrer, M.: On the combinatorial power of the Weisfeiler-Lehman algorithm. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 260\u2013271. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_22"},{"key":"13_CR10","unstructured":"Henaff, M., Bruna, J., LeCun, Y.: Deep convolutional networks on graph-structured data (2015)"},{"key":"13_CR11","unstructured":"Hu, W., Fey, M., Zitnik, M., Dong, Y., Ren, H., et al.: Open graph benchmark: datasets for machine learning on graphs (2020)"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1086\/208899","volume":"9","author":"J Huber","year":"1982","unstructured":"Huber, J., Payne, J.W., Puto, C.: Adding asymmetrically dominated alternatives: violations of regularity and the similarity hypothesis. J. Consum. Res. 9(1), 90 (1982)","journal-title":"J. Consum. Res."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2002. ACM Press (2002)","DOI":"10.1145\/775047.775067"},{"key":"13_CR14","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: ICLR (2015)"},{"key":"13_CR15","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR (2017)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-030-46133-1_15","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M K\u00f6ppel","year":"2020","unstructured":"K\u00f6ppel, M., Segner, A., Wagener, M., Pensel, L., Karwath, A., Kramer, S.: Pairwise learning to rank by neural networks revisited: reconstruction, theoretical analysis and practical performance. In: Brefeld, U., Fromont, E., Hotho, A., Knobbe, A., Maathuis, M., Robardet, C. (eds.) ECML PKDD 2019. LNCS (LNAI), vol. 11908, pp. 237\u2013252. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-46133-1_15"},{"key":"13_CR17","unstructured":"Lee, J., Lee, I., Kang, J.: Self-attention graph pooling. In: ICML, pp. 6661\u20136670 (2019)"},{"key":"13_CR18","unstructured":"Maron, H., Ben-Hamu, H., Serviansky, H., Lipman, Y.: Provably powerful graph networks. In: NeurIPS 2019, pp. 2153\u20132164 (2019)"},{"key":"13_CR19","unstructured":"Mesaoudi-Paul, A.E., H\u00fcllermeier, E., Busa-Fekete, R.: Ranking distributions based on noisy sorting. In: Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholm, Sweden, pp. 3469\u20133477 (2018)"},{"key":"13_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 (2020)"},{"key":"13_CR21","unstructured":"Pfannschmidt, K., Gupta, P., H\u00fcllermeier, E.: Deep architectures for learning context-dependent ranking functions (March 2018)"},{"issue":"9","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.1109\/TNN.2011.2160875","volume":"22","author":"L Rigutini","year":"2011","unstructured":"Rigutini, L., Papini, T., Maggini, M., Scarselli, F.: SortNet: learning to rank by a neural preference function. IEEE Trans. Neural Netw. 22(9), 1368\u20131380 (2011)","journal-title":"IEEE Trans. Neural Netw."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Sculley, D.: Combined regression and ranking. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, 25\u201328 July 2010, pp. 979\u2013988 (2010)","DOI":"10.1145\/1835804.1835928"},{"issue":"11","key":"13_CR24","doi-asserted-by":"publisher","first-page":"2324","DOI":"10.1021\/acs.jcim.5b00559","volume":"55","author":"T Sterling","year":"2015","unstructured":"Sterling, T., Irwin, J.J.: ZINC 15 \u2013 Ligand discovery for everyone. J. Chem. Inf. Model. 55(11), 2324\u20132337 (2015)","journal-title":"J. Chem. Inf. Model."},{"key":"13_CR25","first-page":"1201","volume":"11","author":"S Vishwanathan","year":"2010","unstructured":"Vishwanathan, S., Schraudolph, N., Kondor, R., Borgwardt, K.: Graph kernels. J. Mach. Learn. Res. 11, 1201\u20131242 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10288-008-0085-5","volume":"7","author":"W Waegeman","year":"2009","unstructured":"Waegeman, W., Baets, B.D., Boullart, L.: Kernel-based learning methods for preference aggregation. 4OR 7, 169\u2013189 (2009)","journal-title":"4OR"},{"key":"13_CR27","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? In: ICLR (2019)"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, M., Cui, Z., Neumann, M., Chen, Y.: An end-to-end deep learning architecture for graph classification. In: 32nd AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.11782"},{"issue":"1","key":"13_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13321-015-0052-z","volume":"7","author":"W Zhang","year":"2015","unstructured":"Zhang, W., et al.: When drug discovery meets web search: learning to rank for Ligand-based virtual screening. J. Cheminf. 7(1), 1\u201313 (2015)","journal-title":"J. Cheminf."}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88942-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T13:34:31Z","timestamp":1673444071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88942-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030889418","9783030889425"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88942-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discovery Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Halifax, NS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"11 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dis2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ds2021.cs.dal.ca\/","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":"76","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":"15","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":"21","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":"20% - 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":"Due to the COVID-19 pandemic, the conference took place online.","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)"}}]}}