{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T13:04:20Z","timestamp":1777727060086,"version":"3.51.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031149221","type":"print"},{"value":"9783031149238","type":"electronic"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14923-8_13","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T12:06:36Z","timestamp":1660392396000},"page":"193-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Case-Based Learning and\u00a0Reasoning Using Layered Boundary Multigraphs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Gabel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Sommer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF00153759","volume":"6","author":"D Aha","year":"1991","unstructured":"Aha, D., Kibler, D., Albert, M.: Instance-based learning algorithms. Mach. Learn. 6, 37\u201366 (1991). https:\/\/doi.org\/10.1007\/BF00153759","journal-title":"Mach. Learn."},{"key":"13_CR2","volume-title":"Theory and Problems of Graph Theory","author":"V Balakrishnan","year":"1997","unstructured":"Balakrishnan, V.: Theory and Problems of Graph Theory. McGraw, USA (1997)"},{"key":"13_CR3","unstructured":"Bergmann, R., Richter, M., Schmitt, S., Stahl, A., Vollrath, I.: Utility-oriented matching: a new research direction for case-based reasoning. In: Proceedings of the 9th German Workshop on Case-Based Reasoning (GWCBR) (2001)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Beygelzimer, A., Kakade, S., Langford, J.: Cover tree for nearest neighbor. In: Proceedings of the Twenty-Third International Conference on Machine Learning (ICML), pp. 97\u2013104. ACM Press, Pittsburgh, USA (2006)","DOI":"10.1145\/1143844.1143857"},{"key":"13_CR5","unstructured":"Brin, S.: Near neighbors search in large metric spaces. In: Proceedings of the Twenty-First International Conference on Very Large Data Bases (VLDB), pp. 574\u2013584. Morgan Kaufmann, Zurich, Switzerland (1995)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13, 21\u201327 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1504\/IJAIP.2013.056420","volume":"5","author":"A Djebbar","year":"2013","unstructured":"Djebbar, A., Merouani, H.: Optimising retrieval phase in CBR through pearl and JLO algorithms. J. Adv. Intell. Paradigms 5(3), 161\u2013181 (2013)","journal-title":"J. Adv. Intell. Paradigms"},{"key":"13_CR8","unstructured":"Dua, D., Graff, C.: UCI repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"13_CR9","unstructured":"Gabel, T., Godehardt, E.: I know what you\u2019re doing: a case study on case-based opponent modeling and low-level action prediction. In: Workshop on Case-Based Agents at ICCBR (CBA 2015), pp. 13\u201322. Frankfurt, Germany (2015)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-24586-7_11","volume-title":"Case-Based Reasoning Research and Development","author":"T Gabel","year":"2015","unstructured":"Gabel, T., Godehardt, E.: Top-down induction of similarity measures using similarity clouds. In: H\u00fcllermeier, E., Minor, M. (eds.) ICCBR 2015. LNCS (LNAI), vol. 9343, pp. 149\u2013164. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24586-7_11"},{"key":"13_CR11","volume-title":"RoboCup 2022: Robot Soccer World Cup XXVI","author":"T Gabel","year":"2022","unstructured":"Gabel, T., Sommer, F.: Instance-based opponent action prediction in soccer simulation using boundary graphs. In: Paetzel, M., Lau, N., Wanichanon, T., Eguchi, A. (eds.) RoboCup 2022: Robot Soccer World Cup XXVI. Springer, Bangkok (2022)"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","volume":"18","author":"G Gates","year":"1972","unstructured":"Gates, G.: The reduced nearest neighbor rule. IEEE Trans. Inf. Theory 18(3), 431\u2013433 (1972)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BFb0056333","volume-title":"Advances in Case-Based Reasoning","author":"DB Leake","year":"1998","unstructured":"Leake, D.B., Wilson, D.C.: Categorizing case-base maintenance: dimensions and directions. In: Smyth, B., Cunningham, P. (eds.) EWCBR 1998. LNCS, vol. 1488, pp. 196\u2013207. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056333"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Lejsek, H., Jonsson, B., Amsaleg, L.: NV-tree: nearest neighbors in the billion scale. In: Proceedings of the First ACM International Conference on Multimedia Retrieval (ICMR), pp. 57\u201364. ACM Press, Trento, Italy (2011)","DOI":"10.1145\/1991996.1992050"},{"key":"13_CR15","unstructured":"Lenz, M.: Case retrieval nets as a model for building flexible information systems. Ph.D. thesis, Humboldt University of Berlin, Germany (1999)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Mathy, C., Derbinsky, N., Bento, J., Rosenthal, J., Yedidia, J.: The boundary forest algorithm for online supervised and unsupervised learning. In: Proceedings of the 29th AAAI Conference on AI, pp. 2864\u20132870. AAAI Press, Austin, USA (2015)","DOI":"10.1609\/aaai.v29i1.9622"},{"key":"13_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40167-1","volume-title":"Case-Based Reasoning","author":"MM Richter","year":"2013","unstructured":"Richter, M.M., Weber, R.O.: Case-Based Reasoning. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40167-1"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-48508-2_24","volume-title":"Case-Based Reasoning Research and Development","author":"B Smyth","year":"1999","unstructured":"Smyth, B., McKenna, E.: Building compact competent case-bases. In: Althoff, K.-D., Bergmann, R., Branting, L.K. (eds.) ICCBR 1999. LNCS, vol. 1650, pp. 329\u2013342. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48508-2_24"},{"issue":"3\u20134","key":"13_CR19","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0950-7051(01)00092-2","volume":"14","author":"B Smyth","year":"2001","unstructured":"Smyth, B., McKenna, E.: Competence guided incremental footprint-based retrieval. Knowl.-Based Syst. 14(3\u20134), 155\u2013161 (2001)","journal-title":"Knowl.-Based Syst."},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-58330-0_85","volume-title":"Topics in Case-Based Reasoning","author":"S Wess","year":"1994","unstructured":"Wess, S., Althoff, K.-D., Derwand, G.: Using k-d trees to improve the retrieval step in case-based reasoning. In: Wess, S., Althoff, K.-D., Richter, M.M. (eds.) EWCBR 1993. LNCS, vol. 837, pp. 167\u2013181. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58330-0_85"},{"issue":"3","key":"13_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"D Wilson","year":"2000","unstructured":"Wilson, D., Martinez, T.: Reduction techniques for instance-based learning algorithms. Mach. Learn. 38(3), 257\u2013286 (2000). https:\/\/doi.org\/10.1023\/A:1007626913721","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Case-Based Reasoning Research and Development"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14923-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T23:04:37Z","timestamp":1662332677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14923-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031149221","9783031149238"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14923-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCBR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Case-Based Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccbr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccbr2022.loria.fr\/","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":"68","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":"26","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":"38% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}