{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:12:47Z","timestamp":1742998367118,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"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_31","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"302-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tarragona Graph Database for\u00a0Machine Learning Based on\u00a0Graphs"],"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":"31_CR1","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.patrec.2017.10.007","volume":"100","author":"Z Abu-Aisheh","year":"2017","unstructured":"Abu-Aisheh, Z., et al.: Graph edit distance contest: results and future challenges. Pattern Recognit. Lett. 100, 96\u2013103 (2017). https:\/\/doi.org\/10.1016\/j.patrec.2017.10.007","journal-title":"Pattern Recognit. Lett."},{"key":"31_CR2","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."},{"key":"31_CR3","doi-asserted-by":"publisher","unstructured":"Algabli, S., Serratosa, F.: Learning graph matching substitution weights based on a linear regression. In: 25th International Conference on Pattern Recognition, ICPR 2020, Virtual Event\/Milan, Italy, 10\u201315 January 2021, pp. 53\u201358. IEEE (2020). https:\/\/doi.org\/10.1109\/ICPR48806.2021.9412699","DOI":"10.1109\/ICPR48806.2021.9412699"},{"key":"31_CR4","series-title":"Modeling and Simulation in Science, Engineering and Technology","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/0-8176-4481-4_4","volume-title":"Statistics and Analysis of Shapes","author":"SJ Belongie","year":"2006","unstructured":"Belongie, S.J., Mori, G., Malik, J.: Matching with shape contexts. In: Krim, H., Yezzi, A.A. (eds.) Statistics and Analysis of Shapes. Modeling and Simulation in Science, Engineering and Technology, pp. 81\u2013105. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/0-8176-4481-4_4"},{"key":"31_CR5","doi-asserted-by":"publisher","unstructured":"Borgwardt, K.M., Ong, C.S., Sch\u00f6nauer, S., Vishwanathan, S.V.N., Smola, A.J., Kriegel, H.: Protein function prediction via graph kernels. In: Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, Detroit, MI, USA, 25\u201329 June 2005, pp. 47\u201356 (2005). https:\/\/doi.org\/10.1093\/bioinformatics\/bti1007","DOI":"10.1093\/bioinformatics\/bti1007"},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s11263-007-0078-4","volume":"78","author":"AM Bronstein","year":"2008","unstructured":"Bronstein, A.M., Bronstein, M.M., Bruckstein, A.M., Kimmel, R.: Analysis of two-dimensional non-rigid shapes. Int. J. Comput. Vis. 78(1), 67\u201388 (2008). https:\/\/doi.org\/10.1007\/s11263-007-0078-4","journal-title":"Int. J. Comput. Vis."},{"issue":"6","key":"31_CR7","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":"31_CR8","unstructured":"Cao, N.D., Kipf, T.: MolGAN: an implicit generative model for small molecular graphs. CoRR abs\/1805.11973 (2018). http:\/\/arxiv.org\/abs\/1805.11973"},{"key":"31_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106275","volume":"205","author":"D Conte","year":"2020","unstructured":"Conte, D., Serratosa, F.: Interactive online learning for graph matching using active strategies. Knowl. Based Syst. 205, 106275 (2020). https:\/\/doi.org\/10.1016\/j.knosys.2020.106275","journal-title":"Knowl. Based Syst."},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.patrec.2015.01.009","volume":"56","author":"X Cort\u00e9s","year":"2015","unstructured":"Cort\u00e9s, X., Serratosa, F.: Learning graph-matching edit-costs based on the optimality of the oracle\u2019s node correspondences. Pattern Recogn. Lett. 56, 22\u201329 (2015)","journal-title":"Pattern Recogn. Lett."},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.eswa.2015.09.049","volume":"45","author":"X Cort\u00e9s","year":"2016","unstructured":"Cort\u00e9s, X., Serratosa, F.: Cooperative pose estimation of a fleet of robots based on interactive points alignment. Expert Syst. Appl. 45, 150\u2013160 (2016). https:\/\/doi.org\/10.1016\/j.eswa.2015.09.049","journal-title":"Expert Syst. Appl."},{"issue":"02","key":"31_CR12","doi-asserted-by":"publisher","first-page":"1650005","DOI":"10.1142\/S0218001416500051","volume":"30","author":"X Cort\u00e9s","year":"2016","unstructured":"Cort\u00e9s, X., Serratosa, F.: Learning graph matching substitution weights based on the ground truth node correspondence. Int. J. Pattern Recognit. Artif. Intell. 30(02), 1650005 (2016)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"8","key":"31_CR13","first-page":"1618","volume":"34","author":"J Dai","year":"2011","unstructured":"Dai, J., Feng, J., Zhou, J.: Robust and efficient ridge-based palmprint matching. IEEE Trans. Pattern Anal. Mach. Intell. 34(8), 1618\u20131632 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"31_CR14","doi-asserted-by":"publisher","first-page":"1410","DOI":"10.1021\/acs.jcim.8b00820","volume":"59","author":"C Garcia-Hernandez","year":"2019","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(4), 1410\u20131421 (2019). https:\/\/doi.org\/10.1021\/acs.jcim.8b00820","journal-title":"J. Chem. Inf. Model."},{"issue":"1","key":"31_CR15","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1021\/jm040835a","volume":"48","author":"J Kazius","year":"2005","unstructured":"Kazius, J., McGuire, R., Bursi, R.: Derivation and validation of toxicophores for mutagenicity prediction. J. Med. Chem. 48(1), 312\u2013320 (2005)","journal-title":"J. Med. Chem."},{"key":"31_CR16","doi-asserted-by":"publisher","unstructured":"Koutra, D., Shah, N., Vogelstein, J.T., Gallagher, B., Faloutsos, C.: DeltaCon: principled massive-graph similarity function with attribution. ACM Trans. Knowl. Discov. Data 10(3), 28:1\u201328:43 (2016). https:\/\/doi.org\/10.1145\/2824443","DOI":"10.1145\/2824443"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11767978","volume-title":"Graphics Recognition. Ten Years Review and Future Perspectives","year":"2006","unstructured":"Liu, W., Llad\u00f3s, J. (eds.): GREC 2005. LNCS, vol. 3926. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11767978"},{"issue":"2","key":"31_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91\u2013110 (2004). https:\/\/doi.org\/10.1023\/B:VISI.0000029664.99615.94","journal-title":"Int. J. Comput. Vis."},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-319-49055-7_46","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"CF Moreno-Garc\u00eda","year":"2016","unstructured":"Moreno-Garc\u00eda, C.F., Cort\u00e9s, X., Serratosa, F.: A graph repository for learning error-tolerant graph matching. In: Robles-Kelly, A., Loog, M., Biggio, B., Escolano, F., Wilson, R. (eds.) S+SSPR 2016. LNCS, vol. 10029, pp. 519\u2013529. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49055-7_46"},{"issue":"8","key":"31_CR20","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1109\/34.531800","volume":"18","author":"NK Ratha","year":"1996","unstructured":"Ratha, N.K., Karu, K., Chen, S., Jain, A.K.: A real-time matching system for large fingerprint databases. IEEE Trans. Pattern Anal. Mach. Intell. 18(8), 799\u2013813 (1996). https:\/\/doi.org\/10.1109\/34.531800","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"31_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104404","volume":"104","author":"E Rica","year":"2021","unstructured":"Rica, E., \u00c1lvarez, S., Serratosa, F.: Group of components detection in engineering drawings based on graph matching. Eng. Appl. Artif. Intell. 104, 104404 (2021). https:\/\/doi.org\/10.1016\/j.engappai.2021.104404","journal-title":"Eng. Appl. Artif. Intell."},{"key":"31_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"K Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., et al. (eds.) SSPR \/SPR 2008. LNCS, vol. 5342, pp. 287\u2013297. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89689-0_33"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.patrec.2020.07.010","volume":"138","author":"F Serratosa","year":"2020","unstructured":"Serratosa, F.: A general model to define the substitution, insertion and deletion graph edit costs based on an embedded space. Pattern Recognit. Lett. 138, 115\u2013122 (2020). https:\/\/doi.org\/10.1016\/j.patrec.2020.07.010","journal-title":"Pattern Recognit. Lett."},{"issue":"6","key":"31_CR24","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). https:\/\/doi.org\/10.1007\/s42979-021-00792-5","journal-title":"SN Comput. Sci."},{"issue":"1","key":"31_CR25","doi-asserted-by":"publisher","first-page":"1350001","DOI":"10.1142\/S0218001413500018","volume":"27","author":"A Sol\u00e9-Ribalta","year":"2013","unstructured":"Sol\u00e9-Ribalta, A., Serratosa, F.: Graduated assignment algorithm for multiple graph matching based on a common labeling. Int. J. Pattern Recognit. Artif. Intell. 27(1), 1350001 (2013). https:\/\/doi.org\/10.1142\/S0218001413500018","journal-title":"Int. J. Pattern Recognit. Artif. Intell."}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T03:00:27Z","timestamp":1672542027000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23028-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031230271","9783031230288"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23028-8_31","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)"}}]}}