{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T03:48:45Z","timestamp":1780544925122,"version":"3.54.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031347313","type":"print"},{"value":"9783031347320","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-34732-0_24","type":"book-chapter","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T21:01:21Z","timestamp":1689109281000},"page":"309-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Understanding and\u00a0Compressing Music with\u00a0Maximal Transformable Patterns"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9601-5017","authenticated-orcid":false,"given":"David","family":"Meredith","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,9]]},"reference":[{"key":"24_CR1","unstructured":"Collins, T.: Improved methods for pattern discovery in music, with applications in automated stylistic composition, Ph. D. thesis, Faculty of Mathematics, Computing and Technology, The Open University, Milton Keynes (2011). http:\/\/oro.open.ac.uk\/30103\/4\/TomCthesisEV.pdf"},{"key":"24_CR2","unstructured":"Collins, T., Arzt, A., Flossmann, S., Widmer, G.: SIARCT-CFP: Improving precision and the discovery of inexact musical patterns in point-set representations. In: 14th ISMIR Conference (ISMIR 2013), pp. 549\u2013554. Curitiba, Brazil (2013). https:\/\/archives.ismir.net\/ismir2013\/paper\/000161.pdf"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-319-25931-4_17","volume-title":"Computational Music Analysis","author":"T Collins","year":"2016","unstructured":"Collins, T., Arzt, A., Frostel, H., Widmer, G.: Using geometric symbolic fingerprinting to discover distinctive patterns in polyphonic music corpora. In: Computational Music Analysis, pp. 445\u2013474. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-25931-4_17"},{"key":"24_CR4","unstructured":"Collins, T., Thurlow, J., Laney, R., Willis, A., Garthwaite, P.H.: A comparative evaluation of algorithms for discovering translational patterns in baroque keyboard works. In: Proceedings of the 11th ISMIR Conference, pp. 3\u20138. Utrecht, The Netherlands (2010). https:\/\/archives.ismir.net\/ismir2010\/paper\/000002.pdf"},{"key":"24_CR5","unstructured":"Collins, T., Volk, A., Janssen, B., Ren, I.: MIREX task on discovery of repeated themes & sections (2013\u20132017). https:\/\/www.music-ir.org\/mirex\/wiki\/2017:Discovery_of_Repeated_Themes_%26_Sections"},{"key":"24_CR6","unstructured":"Forth, J.C.: Cognitively-motivated geometric methods of pattern discovery and models of similarity in music, Ph. D. thesis, Department of Computing, Goldsmiths, University of London (2012). http:\/\/research.gold.ac.uk\/id\/eprint\/7803\/"},{"key":"24_CR7","unstructured":"Grijp, L.P.: Introduction. In: Grijp, L.P., van Beersum, I. (eds.) Under the Green Linden\u2013163 Dutch Ballads from the Oral Tradition, pp. 18\u201327. Meertens Institute\/Music & Words (2008)"},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/09298215.2012.718790","volume":"42","author":"P van Kranenburg","year":"2013","unstructured":"van Kranenburg, P., Volk, A., Wiering, F.: A comparison between global and local features for computational classification of folk song melodies. J. New Music Res. 42(1), 1\u201318 (2013)","journal-title":"J. New Music Res."},{"key":"24_CR9","doi-asserted-by":"publisher","unstructured":"Laaksonen, A., Lemstr\u00f6m, K.: On the memory usage of the SIA algorithm family for symbolic music pattern discovery. In: Montiel, M., Agustin-Aquino, O.A., Gomez, F., Kastine, J., Lluis-Puebla, E., Milam, B. (eds.) Mathematics and Computation in Music. MCM 2022. Lecture Notes in Computer Science, vol. 13267. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07015-0_15","DOI":"10.1007\/978-3-031-07015-0_15"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Li, M., Chen, X., Li, X., Ma, B., Vit\u00e1nyi, P.M.B.: The similarity metric. IEEE Trans. Inf. Theory 50(12), 3250\u20133264 (2004). https:\/\/ieeexplore.ieee.org\/document\/1362909","DOI":"10.1109\/TIT.2004.838101"},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1080\/09298210600834961","volume":"35","author":"D Meredith","year":"2006","unstructured":"Meredith, D.: The ps13 pitch spelling algorithm. J. New Music Res. 35(2), 121\u2013159 (2006). https:\/\/doi.org\/10.1080\/09298210600834961","journal-title":"J. New Music Res."},{"key":"24_CR12","unstructured":"Meredith, D.: COSIATEC and SIATECCompress: pattern discovery by geometric compression. In: MIREX 2013 (Competition on Discovery of Repeated Themes & Sections) (2013). https:\/\/www.music-ir.org\/mirex\/abstracts\/2013\/DM10.pdf"},{"issue":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1080\/09298215.2015.1045003","volume":"44","author":"D Meredith","year":"2015","unstructured":"Meredith, D.: Music analysis and point-set compression. J. New Music Res. 44(3), 245\u2013270 (2015). https:\/\/doi.org\/10.1080\/09298215.2015.1045003","journal-title":"J. New Music Res."},{"key":"24_CR14","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-030-43887-6_42","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"D Meredith","year":"2020","unstructured":"Meredith, D.: RecurSIA-RRT: recursive translatable point-set pattern discovery with removal of redundant translators. In: Cellier, P., Driessens, K. (eds.) ECML PKDD 2019. CCIS, vol. 1168, pp. 485\u2013493. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43887-6_42"},{"issue":"4","key":"24_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1076\/jnmr.31.4.321.14162","volume":"31","author":"D Meredith","year":"2002","unstructured":"Meredith, D., Lemstr\u00f6m, K., Wiggins, G.A.: Algorithms for discovering repeated patterns in multidimensional representations of polyphonic music. J. New Music Res. 31(4), 321\u2013345 (2002). https:\/\/doi.org\/10.1076\/jnmr.31.4.321.14162","journal-title":"J. New Music Res."},{"key":"24_CR16","unstructured":"Meredith, D., Lemstr\u00f6m, K., Wiggins, G.A.: Algorithms for discovering repeated patterns in multidimensional representations of polyphonic music. In: Cambridge Music Processing Colloquium (2003). http:\/\/www.titanmusic.com\/papers\/public\/cmpc2003.pdf"}],"container-title":["Lecture Notes in Computer Science","Culture and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34732-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T21:03:59Z","timestamp":1689109439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34732-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031347313","9783031347320"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34732-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HCII","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Human-Computer Interaction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hcii2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.hci.international\/","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":"CMS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7472","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":"1578","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":"396","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":"21% - 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","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)"}}]}}