{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T22:40:08Z","timestamp":1744152008438,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030739720"},{"type":"electronic","value":"9783030739737"}],"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-73973-7_21","type":"book-chapter","created":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T14:03:24Z","timestamp":1617977004000},"page":"216-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Graph Pre-image Method Based on Graph Edit Distances"],"prefix":"10.1007","author":[{"given":"Linlin","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benoit","family":"Ga\u00fcz\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Honeine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,10]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1080\/23307706.2017.1397554","volume":"5","author":"A Agrawal","year":"2018","unstructured":"Agrawal, A., Verschueren, R., Diamond, S., Boyd, S.: A rewriting system for convex optimization problems. J. Control Decis. 5(1), 42\u201360 (2018)","journal-title":"J. Control Decis."},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/11496656_32","volume-title":"Combinatorial Pattern Matching","author":"T Akutsu","year":"2005","unstructured":"Akutsu, T., Fukagawa, D.: Inferring a graph from path frequency. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 371\u2013382. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496656_32"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-28649-3_31","volume-title":"Pattern Recognition","author":"GH Bak\u0131r","year":"2004","unstructured":"Bak\u0131r, G.H., Zien, A., Tsuda, K.: Learning to find graph pre-images. In: Rasmussen, C.E., B\u00fclthoff, H.H., Sch\u00f6lkopf, B., Giese, M.A. (eds.) DAGM 2004. LNCS, vol. 3175, pp. 253\u2013261. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28649-3_31"},{"key":"21_CR4","first-page":"1","volume":"29","author":"DB Blumenthal","year":"2019","unstructured":"Blumenthal, D.B., Boria, N., Gamper, J., Bougleux, S., Brun, L.: Comparing heuristics for graph edit distance computation. VLDB J. 29, 1\u201340 (2019)","journal-title":"VLDB J."},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-030-20081-7_2","volume-title":"Graph-Based Representations in Pattern Recognition","author":"DB Blumenthal","year":"2019","unstructured":"Blumenthal, D.B., Bougleux, S., Gamper, J., Brun, L.: GEDLIB: a C++ library for graph edit distance computation. In: Conte, D., Ramel, J.-Y., Foggia, P. (eds.) GbRPR 2019. LNCS, vol. 11510, pp. 14\u201324. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20081-7_2"},{"key":"21_CR6","unstructured":"Borgwardt, K.M., Kriegel, H.P.: Shortest-path kernels on graphs. In: Fifth IEEE International Conference on Data Mining, pp. 8\u2013pp. IEEE (2005)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-030-20081-7_10","volume-title":"Graph-Based Representations in Pattern Recognition","author":"N Boria","year":"2019","unstructured":"Boria, N., Bougleux, S., Ga\u00fcz\u00e8re, B., Brun, L.: Generalized median graph via iterative alternate minimizations. In: Conte, D., Ramel, J.-Y., Foggia, P. (eds.) GbRPR 2019. LNCS, vol. 11510, pp. 99\u2013109. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20081-7_10"},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Bougleux, S., Ga\u00fcz\u00e8re, B., Brun, L.: Graph edit distance as a quadratic program. In: 2016 23rd International Conference on Pattern Recognition (ICPR), pp. 1701\u20131706 (2016). https:\/\/doi.org\/10.1109\/ICPR.2016.7899881","DOI":"10.1109\/ICPR.2016.7899881"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Daller, \u00c9., Bougleux, S., Ga\u00fcz\u00e8re, B., Brun, L.: Approximate graph edit distance by several local searches in parallel. In: 7th International Conference on Pattern Recognition Applications and Methods (2018)","DOI":"10.5220\/0006599901490158"},{"issue":"83","key":"21_CR10","first-page":"1","volume":"17","author":"S Diamond","year":"2016","unstructured":"Diamond, S., Boyd, S.: CVXPY: a python-embedded modeling language for convex optimization. J. Mach. Learn. Res. 17(83), 1\u20135 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/959242.959248","volume":"5","author":"T G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, T.: A survey of kernels for structured data. ACM SIGKDD Explor. Newsl. 5(1), 49\u201358 (2003)","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"21_CR12","unstructured":"Ga\u00fcz\u00e8re, B., Brun, L., Villemin, D.: Graph kernels in chemoinformatics. In: Dehmer, M., Emmert-Streib, F. (eds.) Quantitative Graph Theory Mathematical Foundations and Applications, pp. 425\u2013470. CRC Press (2015). https:\/\/hal.archives-ouvertes.fr\/hal-01201933"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.cosrev.2017.11.002","volume":"27","author":"S Ghosh","year":"2018","unstructured":"Ghosh, S., Das, N., Gon\u00e7alves, T., Quaresma, P., Kundu, M.: The journey of graph kernels through two decades. Comput. Sci. Rev. 27, 88\u2013111 (2018)","journal-title":"Comput. Sci. Rev."},{"issue":"9","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1109\/TPAMI.2011.270","volume":"34","author":"P Honeine","year":"2012","unstructured":"Honeine, P.: Online kernel principal component analysis: a reduced-order model. IEEE Trans. Pattern Anal. Mach. Intell. 34(9), 1814\u20131826 (2012). https:\/\/doi.org\/10.1109\/TPAMI.2011.270","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/MSP.2010.939747","volume":"28","author":"P Honeine","year":"2011","unstructured":"Honeine, P., Richard, C.: Preimage problem in kernel-based machine learning. IEEE Signal Process. Mag. 28(2), 77\u201388 (2011)","journal-title":"IEEE Signal Process. Mag."},{"key":"21_CR16","unstructured":"Jia, L., Ga\u00fcz\u00e8re, B., Honeine, P.: Graph Kernels Based on Linear Patterns: Theoretical and Experimental Comparisons (2019). Working Paper or Preprint. https:\/\/hal-normandie-univ.archives-ouvertes.fr\/hal-02053946"},{"key":"21_CR17","volume-title":"Graph Classification and Clustering Based on Vector Space Embedding","author":"R Kaspar","year":"2010","unstructured":"Kaspar, R., Horst, B.: Graph Classification and Clustering Based on Vector Space Embedding, vol. 77. World Scientific, Singapore (2010)"},{"key":"21_CR18","unstructured":"Kriege, N.M., Neumann, M., Morris, C., Kersting, K., Mutzel, P.: A unifying view of explicit and implicit feature maps for structured data: systematic studies of graph kernels. arXiv preprint arXiv:1703.00676 (2017)"},{"issue":"2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00453-008-9184-0","volume":"53","author":"H Nagamochi","year":"2009","unstructured":"Nagamochi, H.: A detachment algorithm for inferring a graph from path frequency. Algorithmica 53(2), 207\u2013224 (2009)","journal-title":"Algorithmica"},{"issue":"8","key":"21_CR20","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1016\/j.neunet.2005.07.009","volume":"18","author":"L Ralaivola","year":"2005","unstructured":"Ralaivola, L., Swamidass, S.J., Saigo, H., Baldi, P.: Graph kernels for chemical informatics. Neural Netw. 18(8), 1093\u20131110 (2005)","journal-title":"Neural Netw."},{"key":"21_CR21","series-title":"Advances in Computer Vision and Pattern Recognition","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27252-8","volume-title":"Structural Pattern Recognition with Graph Edit Distance. Approximation Algorithms and Applications","author":"K Riesen","year":"2015","unstructured":"Riesen, K.: Structural Pattern Recognition with Graph Edit Distance. Approximation Algorithms and Applications. ACVPR. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27252-8"},{"key":"21_CR22","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B., et al.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)"}],"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-030-73973-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T22:03:15Z","timestamp":1744149795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73973-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030739720","9783030739737"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73973-7_21","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":"10 April 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dais.unive.it\/sspr2020\/","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":"81","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":"35","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":"43% - 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":"4","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)"}}]}}