{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T22:40:15Z","timestamp":1756852815315,"version":"3.44.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030863333"},{"type":"electronic","value":"9783030863340"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86334-0_28","type":"book-chapter","created":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T20:16:02Z","timestamp":1630700162000},"page":"430-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Segmentation and Graph Matching for Online Analysis of Student Arithmetic Operations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2528-4586","authenticated-orcid":false,"given":"Arnaud","family":"Lods","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1760-5095","authenticated-orcid":false,"given":"\u00c9ric","family":"Anquetil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Mac\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,2]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1177\/0731948716648740","volume":"40","author":"YP Xin","year":"2017","unstructured":"Xin, Y.P., Tzur, R., Hord, C., Liu, J., Park, J.Y., Si, L.: An intelligent tutor-assisted mathematics intervention program for students with learning difficulties. Learn. Disabil. Q. 40(1), 4\u201316 (2017)","journal-title":"Learn. Disabil. Q."},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.lindif.2016.01.012","volume":"47","author":"X Huang","year":"2016","unstructured":"Huang, X., Craig, S.D., Xie, J., Graesser, A., Hu, X.: Intelligent tutoring systems work as a math gap reducer in 6th grade after-school program. Learn. Individ. Differ. 47, 258\u2013265 (2016)","journal-title":"Learn. Individ. Differ."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Mahdavi, M., Zanibbi, R., Mouchere, H., Viard-Gaudin, C., Garain, U.: ICDAR 2019 CROHME + TFD: competition on recognition of handwritten mathematical expressions and typeset formula detection. In: 2019 International Conference on Document Analysis and Recognition (ICDAR), pp. 1533\u20131538 (2019)","DOI":"10.1109\/ICDAR.2019.00247"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.patrec.2018.05.002","volume":"134","author":"DB Blumenthal","year":"2020","unstructured":"Blumenthal, D.B., Gamper, J.: On the exact computation of the graph edit distance. Pattern Recognit. Lett. 134, 46\u201357 (2020). Applications of Graph-based Techniques to Pattern Recognition","journal-title":"Pattern Recognit. Lett."},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/TMM.2018.2844689","volume":"21","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Du, J., Dai, L.: Track, attend, and parse (tap): an end-to-end framework for online handwritten mathematical expression recognition. IEEE Trans. Multimedia 21(1), 221\u2013233 (2018)","journal-title":"IEEE Trans. Multimedia"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Hu, L., Zanibbi, R.: MST-based visual parsing of online handwritten mathematical expressions. In: 2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR), pp. 337\u2013342. IEEE (2016)","DOI":"10.1109\/ICFHR.2016.0070"},{"issue":"9","key":"28_CR7","doi-asserted-by":"publisher","first-page":"4689","DOI":"10.1007\/s00521-018-3817-2","volume":"32","author":"T Zhang","year":"2018","unstructured":"Zhang, T., Mouch\u00e8re, H., Viard-Gaudin, C.: A tree-BLSTM-based recognition system for online handwritten mathematical expressions. Neural Comput. Appl. 32(9), 4689\u20134708 (2018). https:\/\/doi.org\/10.1007\/s00521-018-3817-2","journal-title":"Neural Comput. Appl."},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"3","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.-S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 3, 353\u2013362 (1983)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Abu-Aisheh, Z., Raveaux, R., Ramel, J.-Y., Martineau, P.: An exact graph edit distance algorithm for solving pattern recognition problems. In: 4th International Conference on Pattern Recognition Applications and Methods 2015, Lisbon, Portugal, January 2015","DOI":"10.5220\/0005209202710278"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-319-58961-9_19","volume-title":"Graph-Based Representations in Pattern Recognition","author":"DB Blumenthal","year":"2017","unstructured":"Blumenthal, D.B., Gamper, J.: Exact computation of graph edit distance for uniform and non-uniform metric edit costs. In: Foggia, P., Liu, C.-L., Vento, M. (eds.) GbRPR 2017. LNCS, vol. 10310, pp. 211\u2013221. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58961-9_19"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.patcog.2017.07.029","volume":"72","author":"J Lerouge","year":"2017","unstructured":"Lerouge, J., Abu-Aisheh, Z., Raveaux, R., H\u00e9roux, P., Adam, S.: New binary linear programming formulation to compute the graph edit distance. Pattern Recogn. 72, 254\u2013265 (2017)","journal-title":"Pattern Recogn."},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-662-44415-3_9","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"A Fischer","year":"2014","unstructured":"Fischer, A., Plamondon, R., Savaria, Y., Riesen, K., Bunke, H.: A hausdorff heuristic for efficient computation of graph edit distance. In: Fr\u00e4nti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 83\u201392. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44415-3_9"},{"key":"28_CR13","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: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, pp. 384\u2013392 (2019)","DOI":"10.1145\/3289600.3290967"},{"issue":"12","key":"28_CR14","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"15","key":"28_CR15","doi-asserted-by":"publisher","first-page":"11579","DOI":"10.1007\/s00521-019-04642-7","volume":"32","author":"A Dutta","year":"2020","unstructured":"Dutta, A., Riba, P., Llad\u00f3s, J., Forn\u00e9s, A.: Hierarchical stochastic graphlet embedding for graph-based pattern recognition. Neural Comput. Appl. 32(15), 11579\u201311596 (2020)","journal-title":"Neural Comput. Appl."},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Hu, L., Zanibbi, R.: Line-of-sight stroke graphs and parzen shape context features for handwritten math formula representation and symbol segmentation. In: 2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR), pp. 180\u2013186. IEEE (2016)","DOI":"10.1109\/ICFHR.2016.0044"},{"key":"28_CR17","unstructured":"Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition, arXiv preprint arXiv:1409.1556 (2014)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Delaye, A., Anquetil, E.: Fuzzy relative positioning templates for symbol recognition. In: 2011 12th International Conference on Document Analysis and Recognition (ICDAR), pp. 1220\u20131224. IEEE (2011)","DOI":"10.1109\/ICDAR.2011.246"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Lods, A., Anquetil, E., Mac\u00e9, S.: Graph edit distance for the analysis of children\u2019s on-line handwritten arithmetical operations. In: 2020 17th International Conference on Frontiers in Handwriting Recognition (ICFHR), pp. 337\u2013342. IEEE (2020)","DOI":"10.1109\/ICFHR2020.2020.00068"}],"container-title":["Lecture Notes in Computer Science","Document Analysis and Recognition \u2013 ICDAR 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86334-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T22:10:21Z","timestamp":1756851021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86334-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030863333","9783030863340"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86334-0_28","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":"2 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Document Analysis and Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lausanne","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdar2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iapr.org\/icdar2021","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":"340","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":"182","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":"54% - 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":"2.9","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.9","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":"Additionally, 13 competition reports are included.","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)"}}]}}