{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:52:22Z","timestamp":1742946742184,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031230271"},{"type":"electronic","value":"9783031230288"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-23028-8_11","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"103-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Distances Between Graph Nodes and\u00a0Edges"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3636-5357","authenticated-orcid":false,"given":"Elena","family":"Rica","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1376-2034","authenticated-orcid":false,"given":"Susana","family":"\u00c1lvarez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6112-5913","authenticated-orcid":false,"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.patrec.2018.08.026","volume":"112","author":"S Algabli","year":"2018","unstructured":"Algabli, S., Serratosa, F.: Embedding the node-to-node mappings to learn the graph edit distance parameters. Pattern Recogn. Lett. 112, 353\u2013360 (2018)","journal-title":"Pattern Recogn. Lett."},{"issue":"6","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"TS Caetano","year":"2009","unstructured":"Caetano, T.S., McAuley, J.J., Cheng, L., Le, Q.V., Smola, A.J.: Learning graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(6), 1048\u20131058 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.patrec.2019.05.001","volume":"125","author":"X Cort\u00e9s","year":"2019","unstructured":"Cort\u00e9s, X., Conte, D., Cardot, H.: Learning edit cost estimation models for graph edit distance. Pattern Recogn. Lett. 125, 256\u2013263 (2019)","journal-title":"Pattern Recogn. Lett."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Cort\u00e9s, X., Conte, D., Cardot, H., Serratosa, F.: A deep neural network architecture to estimate node assignment costs for the graph edit distance. In: Proceedings of Structural, Syntactic, and Statistical Pattern Recognition - Joint IAPR International Workshop, S+SSPR 2018, Beijing, China, 17\u201319 August 2018, Vol. 4, pp. 326\u2013336 (2018)","DOI":"10.1007\/978-3-319-97785-0_31"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Garcia-Hernandez, C., Fern\u00e1ndez, A., Serratosa, F.: Ligand-based virtual screening using graph edit distance as molecular similarity measure. J. Chem. Inf.. Model. 59 (2019)","DOI":"10.1021\/acs.jcim.8b00820"},{"issue":"18","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.2174\/1568026620666200603122000","volume":"20","author":"C Garcia-Hernandez","year":"2020","unstructured":"Garcia-Hernandez, C., Fern\u00e1ndez, A., Serratosa, F.: Learning the edit costs of graph edit distance applied to ligand-based virtual screening. Curr. Top. Med. Chem. 20(18), 1582\u20131592 (2020)","journal-title":"Curr. Top. Med. Chem."},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1021\/ci200412p","volume":"52","author":"EA Gatica","year":"2011","unstructured":"Gatica, E.A., Cavasotto, C.N.: Ligand and decoy sets for docking to g protein-coupled receptors. J. Chem. Inf. Model. 52(1), 1\u20136 (2011)","journal-title":"J. Chem. Inf. Model."},{"issue":"6","key":"11_CR8","doi-asserted-by":"publisher","first-page":"2145","DOI":"10.1021\/ci049860f","volume":"44","author":"G Harper","year":"2004","unstructured":"Harper, G., Bravi, G.S., Pickett, S.D., Hussain, J., Green, D.V.S.: The reduced graph descriptor in virtual screening and data-driven clustering of high-throughput screening data. J. Chem. Inf. Comput. Sci. 44(6), 2145\u20132156 (2004). https:\/\/doi.org\/10.1021\/ci049860f","journal-title":"J. Chem. Inf. Comput. Sci."},{"issue":"7","key":"11_CR9","doi-asserted-by":"publisher","first-page":"3117","DOI":"10.1021\/jm500132p","volume":"57","author":"N Lagarde","year":"2014","unstructured":"Lagarde, N., et al.: NRLIST BDB, the manually curated nuclear receptors ligands and structures benchmarking database. J. Med. Chem. 57(7), 3117\u20133125 (2014)","journal-title":"J. Med. Chem."},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s11263-011-0442-2","volume":"96","author":"M Leordeanu","year":"2012","unstructured":"Leordeanu, M., Sukthankar, R., Hebert, M.: Unsupervised learning for graph matching. Int. J. Comput. Vision 96(1), 28\u201345 (2012)","journal-title":"Int. J. Comput. Vision"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Martineau, M., Raveaux, R., Conte, D., Venturini, G.: Learning error-correcting graph matching with a multiclass neural network. Pattern Recogn. Lett. 134, 68\u201376 (2018)","DOI":"10.1016\/j.patrec.2018.03.031"},{"issue":"14","key":"11_CR12","doi-asserted-by":"publisher","first-page":"6582","DOI":"10.1021\/jm300687e","volume":"55","author":"MM Mysinger","year":"2012","unstructured":"Mysinger, M.M., Carchia, M., Irwin, J.J., Shoichet, B.K.: Directory of useful decoys, enhanced (dud-e): better ligands and decoys for better benchmarking. J. Med. Chem. 55(14), 6582\u20136594 (2012)","journal-title":"J. Med. Chem."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Trans. Syst. Man Cybernet.. Part B (Cybernetics)35(3), 503\u2013514 (2005)","DOI":"10.1109\/TSMCB.2005.846635"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2006.02.013","volume":"177","author":"M Neuhaus","year":"2007","unstructured":"Neuhaus, M., Bunke, H.: Automatic learning of cost functions for graph edit distance. Inf. Sci. 177(1), 239\u2013247 (2007)","journal-title":"Inf. Sci."},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Rica, E., \u00c1lvarez, S., Serratosa, F.: On-line learning the graph edit distance costs. Pattern Recognit. Lett. 146, 55\u201362 (2021). https:\/\/doi.org\/10.1016\/j.patrec.2021.02.019, https:\/\/doi.org\/10.1016\/j.patrec.2021.02.019","DOI":"10.1016\/j.patrec.2021.02.019"},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1021\/ci8002649","volume":"49","author":"SG Rohrer","year":"2009","unstructured":"Rohrer, S.G., Baumann, K.: Maximum unbiased validation (MUV) data sets for virtual screening based on PubChem bioactivity data. J. Chem. Inf. Model. 49(2), 169\u2013184 (2009)","journal-title":"J. Chem. Inf. Model."},{"issue":"6","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1021\/ci2005274","volume":"52","author":"MP Sanders","year":"2012","unstructured":"Sanders, M.P., et al.: Comparative analysis of pharmacophore screening tools. J. Chem. Inf. Model. 52(6), 1607\u20131620 (2012)","journal-title":"J. Chem. Inf. Model."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Santacruz, P., Serratosa, F.: Error-tolerant graph matching in linear computational cost using an initial small partial matching. Pattern Recogn. Lett. 134, 10\u201319 (2018)","DOI":"10.1016\/j.patrec.2018.04.003"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Santacruz, P., Serratosa, F.: Learning the graph edit costs based on a learning model applied to sub-optimal graph matching. Neural Process. Lett. 51, 1\u201324 (2019)","DOI":"10.1007\/s11063-019-10121-w"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.patrec.2014.04.015","volume":"45","author":"F Serratosa","year":"2014","unstructured":"Serratosa, F.: Fast computation of bipartite graph matching. Pattern Recogn. Lett. 45, 244\u2013250 (2014)","journal-title":"Pattern Recogn. Lett."},{"issue":"6","key":"11_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42979-021-00792-5","volume":"2","author":"F Serratosa","year":"2021","unstructured":"Serratosa, F.: Redefining the graph edit distance. SN Comput. Sci. 2(6), 1\u20137 (2021)","journal-title":"SN Comput. Sci."},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Skoda, P., Hoksza, D.: Benchmarking platform for ligand-based virtual screening. In: Proceedings - 2016 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2016, pp. 1220\u20131227 (2017). https:\/\/doi.org\/10.1109\/BIBM.2016.7822693","DOI":"10.1109\/BIBM.2016.7822693"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ymeth.2014.11.015","volume":"71","author":"J Xia","year":"2015","unstructured":"Xia, J., Tilahun, E.L., Reid, T.E., Zhang, L., Wang, X.S.: Benchmarking methods and data sets for ligand enrichment assessment in virtual screening. Methods 71, 146\u2013157 (2015)","journal-title":"Methods"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23028-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:54:59Z","timestamp":1672541699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23028-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031230271","9783031230288"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23028-8_11","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":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sspr2022.encs.concordia.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":"50","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":"32","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":"64% - 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","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","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)"}}]}}