{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:17Z","timestamp":1750306877182,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,6]],"date-time":"2012-06-06T00:00:00Z","timestamp":1338940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0812601IIS-1055062IIS-1238660CNS-0923494CNS-1035913CNS-1059235"],"award-info":[{"award-number":["IIS-0812601IIS-1055062IIS-1238660CNS-0923494CNS-1035913CNS-1059235"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["IIS-0812601IIS-1055062IIS-1238660CNS-0923494CNS-1035913CNS-1059235"],"award-info":[{"award-number":["IIS-0812601IIS-1055062IIS-1238660CNS-0923494CNS-1035913CNS-1059235"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,6]]},"DOI":"10.1145\/2413097.2413104","type":"proceedings-article","created":{"date-parts":[[2012,12,17]],"date-time":"2012-12-17T15:12:21Z","timestamp":1355757141000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["A survey of query-by-humming similarity methods"],"prefix":"10.1145","author":[{"given":"Alexios","family":"Kotsifakos","sequence":"first","affiliation":[{"name":"University of Texas at Arlington"}]},{"given":"Panagiotis","family":"Papapetrou","sequence":"additional","affiliation":[{"name":"Aalto University, Finland"}]},{"given":"Jaakko","family":"Hollm\u00e9n","sequence":"additional","affiliation":[{"name":"Aalto University, Finland"}]},{"given":"Dimitrios","family":"Gunopulos","sequence":"additional","affiliation":[{"name":"University of Athens, Greece"}]},{"given":"Vassilis","family":"Athitsos","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington"}]}],"member":"320","published-online":{"date-parts":[[2012,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"N.\n      Adams M.\n      Bartsch J.\n      Shifrin and \n      G.\n      Wakefield\n  . \n  Time series alignment for music information retrieval\n  . \n  In Proceedings of ISMIR pages \n  303\n  --\n  311 2004\n  .  N. Adams M. Bartsch J. Shifrin and G. Wakefield. Time series alignment for music information retrieval. In Proceedings of ISMIR pages 303--311 2004."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1954-09848-8"},{"key":"e_1_3_2_1_3_1","first-page":"39","volume-title":"SPIRE","author":"Bergroth L.","year":"2000","unstructured":"L. Bergroth , H. Hakonen , and T. Raita . A survey of longest common subsequence algorithms . In SPIRE , pages 39 -- 48 , 2000 . L. Bergroth, H. Hakonen, and T. Raita. A survey of longest common subsequence algorithms. In SPIRE, pages 39--48, 2000."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/262839.263080"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316758"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066213"},{"key":"e_1_3_2_1_7_1","volume-title":"ISMIR","author":"Clausen M.","year":"2000","unstructured":"M. Clausen , R. Engelbrecht , D. Meyer , and J. Schmitz . Proms: A web-based tool for searching in polyphonic music . In ISMIR , 2000 . M. Clausen, R. Engelbrecht, D. Meyer, and J. Schmitz. Proms: A web-based tool for searching in polyphonic music. In ISMIR, 2000."},{"key":"e_1_3_2_1_8_1","first-page":"73","article-title":"String matching techniques for musical similarity and melodic recognition","volume":"11","author":"Crawford T.","year":"1998","unstructured":"T. Crawford , C. Iliopoulos , and R. Raman . String matching techniques for musical similarity and melodic recognition . Computing in Musicology , 11 : 73 -- 100 , 1998 . T. Crawford, C. Iliopoulos, and R. Raman. String matching techniques for musical similarity and melodic recognition. Computing in Musicology, 11:73--100, 1998.","journal-title":"Computing in Musicology"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/643002.643006"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v58:5"},{"key":"e_1_3_2_1_11_1","first-page":"232","volume-title":"ISMIR","author":"Dannenberg R.","year":"2004","unstructured":"R. Dannenberg and N. Hu . Understanding search performance in query-by-humming systems . In ISMIR , pages 232 -- 237 , 2004 . R. Dannenberg and N. Hu. Understanding search performance in query-by-humming systems. In ISMIR, pages 232--237, 2004."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.04.018"},{"key":"e_1_3_2_1_13_1","first-page":"135","volume-title":"Connectedness: Information, systems, people, organizations: In conference of the Canadian Association for Information Science","author":"Downie J.","year":"1995","unstructured":"J. Downie . The musifind music information retrieval project, phase iii: evaluation of indexing options . In Connectedness: Information, systems, people, organizations: In conference of the Canadian Association for Information Science , 1995 , pages 135 -- 146 , 1995. J. Downie. The musifind music information retrieval project, phase iii: evaluation of indexing options. In Connectedness: Information, systems, people, organizations: In conference of the Canadian Association for Information Science, 1995, pages 135--146, 1995."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007425814087"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/217279.215273"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73499-4_44"},{"key":"e_1_3_2_1_17_1","first-page":"509","volume-title":"ICMC","author":"Hu N.","year":"2002","unstructured":"N. Hu , R. Dannenberg , and A. Lewis . A probabilistic model of melodic similarity . In ICMC , pages 509 -- 515 , 2002 . N. Hu, R. Dannenberg, and A. Lewis. A probabilistic model of melodic similarity. In ICMC, pages 509--515, 2002."},{"key":"e_1_3_2_1_18_1","first-page":"55","volume-title":"PSC","author":"Iliopoulos C.","year":"2002","unstructured":"C. Iliopoulos and M. Kurokawa . String matching with gaps for musical melodic recognition . In PSC , pages 55 -- 64 , 2002 . C. Iliopoulos and M. Kurokawa. String matching with gaps for musical melodic recognition. In PSC, pages 55--64, 2002."},{"key":"e_1_3_2_1_19_1","first-page":"85","volume-title":"International Workshop on Intelligent Systems Resolutions","author":"Jang J.","year":"2000","unstructured":"J. Jang and M. Gao . A query-by-singing system based on dynamic programming . In International Workshop on Intelligent Systems Resolutions , pages 85 -- 89 , 2000 . J. Jang and M. Gao. A query-by-singing system based on dynamic programming. In International Workshop on Intelligent Systems Resolutions, pages 85--89, 2000."},{"key":"e_1_3_2_1_20_1","first-page":"349","volume-title":"ICMC","author":"Kageyama T.","year":"1993","unstructured":"T. Kageyama , K. Mochizuki , and Y. Takashima . Melody retrieval with humming . In ICMC , pages 349 -- 349 , 1993 . T. Kageyama, K. Mochizuki, and Y. Takashima. Melody retrieval with humming. In ICMC, pages 349--349, 1993."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287405"},{"issue":"11","key":"e_1_3_2_1_22_1","first-page":"761","volume":"4","author":"Kotsifakos A.","year":"2011","unstructured":"A. Kotsifakos , P. Papapetrou , J. Hollm\u00e9n , and D. Gunopulos . A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application. PVLDB , 4 ( 11 ): 761 -- 771 , 2011 . A. Kotsifakos, P. Papapetrou, J. Hollm\u00e9n, and D. Gunopulos. A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application. PVLDB, 4(11):761--771, 2011.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_23_1","volume-title":"Time Warps","author":"Kruskall J. B.","year":"1983","unstructured":"J. B. Kruskall and M. Liberman . The symmetric time warping algorithm: From continuous to discrete . In Time Warps . Addison-Wesley , 1983 . J. B. Kruskall and M. Liberman. The symmetric time warping algorithm: From continuous to discrete. In Time Warps. Addison-Wesley, 1983."},{"key":"e_1_3_2_1_24_1","first-page":"23","volume-title":"ISMIR","author":"Lemstr\u00f6m K.","year":"2000","unstructured":"K. Lemstr\u00f6m and S. Perttu . Semex-an efficient music retrieval prototype . In ISMIR , pages 23 -- 25 , 2000 . K. Lemstr\u00f6m and S. Perttu. Semex-an efficient music retrieval prototype. In ISMIR, pages 23--25, 2000."},{"key":"e_1_3_2_1_25_1","first-page":"53","volume-title":"AISB","author":"Lemstr\u00f6m K.","year":"2000","unstructured":"K. Lemstr\u00f6m and E. Ukkonen . Including interval encoding into edit distance based music comparison and retrieval . In AISB , pages 53 -- 60 , 2000 . K. Lemstr\u00f6m and E. Ukkonen. Including interval encoding into edit distance based music comparison and retrieval. In AISB, pages 53--60, 2000."},{"issue":"8","key":"e_1_3_2_1_26_1","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein V. I.","year":"1966","unstructured":"V. I. Levenshtein . Binary codes capable of correcting deletions, insertions, and reversals . Soviet Physics , 10 ( 8 ): 707 -- 710 , 1966 . V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics, 10(8):707--710, 1966.","journal-title":"Soviet Physics"},{"key":"e_1_3_2_1_27_1","first-page":"289","volume-title":"ISMIR","author":"Lubiw A.","year":"2004","unstructured":"A. Lubiw and L. Tanur . Pattern matching in polyphonic music as a weighted geometric translation problem . In ISMIR , pages 289 -- 296 , 2004 . A. Lubiw and L. Tanur. Pattern matching in polyphonic music as a weighted geometric translation problem. In ISMIR, pages 289--296, 2004."},{"key":"e_1_3_2_1_28_1","first-page":"191","volume-title":"Algorithms for transposition invariant string matching. Lecture notes in computer science","author":"Makinen V.","year":"2003","unstructured":"V. Makinen , G. Navarro , and E. Ukkonen . Algorithms for transposition invariant string matching. Lecture notes in computer science , pages 191 -- 202 , 2003 . V. Makinen, G. Navarro, and E. Ukkonen. Algorithms for transposition invariant string matching. Lecture notes in computer science, pages 191--202, 2003."},{"key":"e_1_3_2_1_29_1","first-page":"17","volume-title":"ISMIR","author":"Mazzoni D.","year":"2001","unstructured":"D. Mazzoni and R. Dannenberg . Melody matching directly from audio . In ISMIR , pages 17 -- 18 , 2001 . D. Mazzoni and R. Dannenberg. Melody matching directly from audio. In ISMIR, pages 17--18, 2001."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/226931.226934"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622487.1622490"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00117340"},{"key":"e_1_3_2_1_33_1","first-page":"267","volume-title":"ISMIR","author":"Pardo B.","year":"2002","unstructured":"B. Pardo and W. Birmingham . Encoding timing information for musical query matching . In ISMIR , pages 267 -- 268 , 2002 . B. Pardo and W. Birmingham. Encoding timing information for musical query matching. In ISMIR, pages 267--268, 2002."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.10373"},{"key":"e_1_3_2_1_35_1","first-page":"187","volume-title":"ISMIR","author":"Pauws S.","year":"2002","unstructured":"S. Pauws . Cubyhum : A fully operational query by humming system . In ISMIR , pages 187 -- 196 , 2002 . S. Pauws. Cubyhum: A fully operational query by humming system. In ISMIR, pages 187--196, 2002."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.18626"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1978.1163055"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368963"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/544220.544291"},{"key":"e_1_3_2_1_40_1","volume-title":"2002 IEEE International Conference on Multimedia and Expo (ICME2002)","author":"Shih H.","year":"2002","unstructured":"H. Shih , S. Narayanan , and C. Kuo . An HMM-based approach to humming transcription . In 2002 IEEE International Conference on Multimedia and Expo (ICME2002) , 2002 . H. Shih, S. Narayanan, and C. Kuo. An HMM-based approach to humming transcription. In 2002 IEEE International Conference on Multimedia and Expo (ICME2002), 2002."},{"key":"e_1_3_2_1_41_1","first-page":"61","volume-title":"Proceedings of IEEE 2003 International Conference on Multimedia and Expo","volume":"1","author":"Shih H.","year":"2003","unstructured":"H. Shih , S. Narayanan , and C. Kuo . A statistical multidimensional humming transcription using phone level hidden Markov models for query by humming systems . In Proceedings of IEEE 2003 International Conference on Multimedia and Expo , volume 1 , pages 61 -- 64 , 2003 . H. Shih, S. Narayanan, and C. Kuo. A statistical multidimensional humming transcription using phone level hidden Markov models for query by humming systems. In Proceedings of IEEE 2003 International Conference on Multimedia and Expo, volume 1, pages 61--64, 2003."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"e_1_3_2_1_43_1","first-page":"107","volume-title":"ISMIR","author":"Typke R.","year":"2003","unstructured":"R. Typke , P. Giannopoulos , R. Veltkamp , F. Wiering , and R. Van Oostrum . Using transportation distances for measuring melodic similarity . In ISMIR , pages 107 -- 114 , 2003 . R. Typke, P. Giannopoulos, R. Veltkamp, F. Wiering, and R. Van Oostrum. Using transportation distances for measuring melodic similarity. In ISMIR, pages 107--114, 2003."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/290747.290776"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/319463.319470"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90143-4"},{"key":"e_1_3_2_1_47_1","first-page":"193","volume-title":"ISMIR","author":"Ukkonen E.","year":"2003","unstructured":"E. Ukkonen , K. Lemstr\u00f6m , and V. M\u00e4kinen . Geometric algorithms for transposition invariant content-based music retrieval . In ISMIR , pages 193 -- 199 , 2003 . E. Ukkonen, K. Lemstr\u00f6m, and V. M\u00e4kinen. Geometric algorithms for transposition invariant content-based music retrieval. In ISMIR, pages 193--199, 2003."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASL.2007.912373"},{"key":"e_1_3_2_1_49_1","first-page":"13","volume-title":"ISMIR","author":"Wiggins G.","year":"2002","unstructured":"G. Wiggins , K. Lemstr\u00f6m , and D. Meredith . SIA(M)ESE: An algorithm for transposition invariant, polyphonic content-based music retrieval . In ISMIR , pages 13 -- 17 , 2002 . G. Wiggins, K. Lemstr\u00f6m, and D. Meredith. SIA(M)ESE: An algorithm for transposition invariant, polyphonic content-based music retrieval. In ISMIR, pages 13--17, 2002."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/641007.641125"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872780"}],"event":{"name":"PETRA2012: The 5th International Conference on PErvasive Technologies Related to Assistive Environments","sponsor":["U of Tex at Arlington U of Tex at Arlington"],"location":"Heraklion Crete Greece","acronym":"PETRA2012"},"container-title":["Proceedings of the 5th International Conference on PErvasive Technologies Related to Assistive Environments"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2413097.2413104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2413097.2413104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:26Z","timestamp":1750234706000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2413097.2413104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,6]]},"references-count":51,"alternative-id":["10.1145\/2413097.2413104","10.1145\/2413097"],"URL":"https:\/\/doi.org\/10.1145\/2413097.2413104","relation":{},"subject":[],"published":{"date-parts":[[2012,6,6]]},"assertion":[{"value":"2012-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}