{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:44:30Z","timestamp":1742949870008,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030864743"},{"type":"electronic","value":"9783030864750"}],"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-86475-0_8","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T07:03:29Z","timestamp":1630393409000},"page":"77-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Highly Modular Architecture for Canned Pattern Selection Problem"],"prefix":"10.1007","author":[{"given":"Marinos","family":"Tzanikos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Krommyda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Verena","family":"Kantere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Bai, Y., Ding, H., Bian, S., Chen, T., Sun, Y., Wang, W.: Simgnn: a neural network approach to fast graph similarity computation. In: ACM ICWSDM (2019)","DOI":"10.1145\/3289600.3290967"},{"key":"8_CR2","unstructured":"Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: PAKDD (2008)"},{"key":"8_CR3","first-page":"35","volume":"20","author":"H Bunke","year":"1983","unstructured":"Bunke, H.: What is the distance between graphs. Bull. EATCS 20, 35\u201339 (1983)","journal-title":"Bull. EATCS"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recogn. Lett. 19(3), 255\u2013259 (1998)","journal-title":"Pattern Recogn. Lett."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-20844-7_11","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S Fankhauser","year":"2011","unstructured":"Fankhauser, S., Riesen, K., Bunke, H.: Speeding up graph edit distance computation through fast bipartite matching. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol. 6658, pp. 102\u2013111. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20844-7_11"},{"issue":"9","key":"8_CR6","doi-asserted-by":"publisher","first-page":"1970","DOI":"10.1016\/j.sigpro.2011.12.009","volume":"92","author":"L Galluccio","year":"2012","unstructured":"Galluccio, L., Michel, O., Comon, P., Hero, A.O.: Graph based k-means clustering. Signal Process. 92(9), 1970\u20131984 (2012)","journal-title":"Signal Process."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Huang, K., Chua, H.E., Bhowmick, S.S., Choi, B., Zhou, S.: Catapult: data-driven selection of canned patterns for efficient visual graph query formulation. In: Proceedings of the 2019 International Conference on Management of Data. SIGMOD 2019, pp. 900\u2013917. Association for Computing Machinery (2019)","DOI":"10.1145\/3299869.3300072"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Jamshidi, K., Mahadasa, R., Vora, K.: Peregrine. In: Proceedings of the Fifteenth European Conference on Computer Systems, April 2020. https:\/\/doi.org\/10.1145\/3342195.3387548","DOI":"10.1145\/3342195.3387548"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-68279-0_2","volume-title":"50 Years of Integer Programming 1958-2008","author":"HW Kuhn","year":"2010","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958-2008, pp. 29\u201347. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_2"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/S0036144503424786","volume":"47","author":"A Langville","year":"2004","unstructured":"Langville, A., Meyer, C.: A survey of eigenvector methods of web information retrieval. SIAM Rev. 47(1), 135\u2013161 (2004). https:\/\/doi.org\/10.1137\/S0036144503424786","journal-title":"SIAM Rev."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1109\/34.954604","volume":"23","author":"A Munger","year":"2001","unstructured":"Munger, A., Bunke, H.: On median graphs: properties, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 23, 1144\u20131151 (2001). https:\/\/doi.org\/10.1109\/34.954604","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"8_CR12","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical Report 1999\u201366, Stanford InfoLab (1999)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86475-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:06:00Z","timestamp":1710327960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86475-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030864743","9783030864750"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86475-0_8","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":"1 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","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":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"149","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":"37","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":"31","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":"25% - 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":"4","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":"5","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)"}},{"value":"DEXA 2021 Workshops: 50 papers submitted, 23 papers accepted","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)"}}]}}