{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:40:07Z","timestamp":1750228807694,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T00:00:00Z","timestamp":1434931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Microsoft Research","award":["FY14RES-OPP-048"],"award-info":[{"award-number":["FY14RES-OPP-048"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,22]]},"DOI":"10.1145\/2671188.2749346","type":"proceedings-article","created":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T15:37:08Z","timestamp":1434987428000},"page":"543-546","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["EMIF"],"prefix":"10.1145","author":[{"given":"Jialie","family":"Shen","sequence":"first","affiliation":[{"name":"SMU, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Mei","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[{"name":"University of Technology, Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuelong","family":"Li","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Rui","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,6,22]]},"reference":[{"issue":"1","key":"e_1_3_2_1_1_1","article-title":"Maximum likelihood from incomplete data via the em algorithm","volume":"39","author":"Dempster N. L. A.","year":"1977","unstructured":"N. L. A. Dempster and D. Rubin . Maximum likelihood from incomplete data via the em algorithm . Journal of the Royal Statistical Society, Series B , 39 ( 1 ), 1977 . N. L. A. Dempster and D. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, Series B, 39(1), 1977.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"e_1_3_2_1_2_1","volume-title":"Neural Network for Pattern Recognition","author":"Bishop C. M.","year":"2000","unstructured":"C. M. Bishop . Neural Network for Pattern Recognition . Oxford University Press , 2000 . C. M. Bishop. Neural Network for Pattern Recognition. Oxford University Press, 2000."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502809"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/846218.847242"},{"key":"e_1_3_2_1_5_1","volume-title":"Pattern Classification","author":"Duda R. O.","year":"2000","unstructured":"R. O. Duda , P. E. Hart , and D. G. Stork . Pattern Classification . John Wiley & Sons , 2000 . R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. John Wiley & Sons, 2000."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21606-5"},{"key":"e_1_3_2_1_7_1","volume-title":"Technical Report 9503","author":"Jordan M. I.","year":"1995","unstructured":"M. I. Jordan . Why the logistic function? a tutorial discussion on probabilities and neural networks. Technical Report 9503 , Massachusetts Institute of Technology , 1995 . M. I. Jordan. Why the logistic function? a tutorial discussion on probabilities and neural networks. Technical Report 9503, Massachusetts Institute of Technology, 1995."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860487"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/641205.641207"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508850.1508856"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2006.884618"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2008.2009719"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/89.876309"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSA.2002.800560"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"G.\n      Xia T.\n      Huang Y.\n      Ma R.\n      Dannenberg and \n      C.\n      Faloutsos\n  . \n  Midifind: Similarity search and popularity mining in large midi databases\n  . In M. Aramaki O. Derrien R. Kronland-Martinet and S. Ystad editors Sound Music and Motion volume \n  8905\n   of \n  Lecture Notes in Computer Science pages \n  259\n  --\n  276\n  . \n  Springer International Publishing 2014\n  .  G. Xia T. Huang Y. Ma R. Dannenberg and C. Faloutsos. Midifind: Similarity search and popularity mining in large midi databases. In M. Aramaki O. Derrien R. Kronland-Martinet and S. Ystad editors Sound Music and Motion volume 8905 of Lecture Notes in Computer Science pages 259--276. Springer International Publishing 2014.","DOI":"10.1007\/978-3-319-12976-1_17"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/641007.641125"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1873951.1874004"}],"event":{"name":"ICMR '15: International Conference on Multimedia Retrieval","sponsor":["SIGMM ACM Special Interest Group on Multimedia"],"location":"Shanghai China","acronym":"ICMR '15"},"container-title":["Proceedings of the 5th ACM on International Conference on Multimedia Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2671188.2749346","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2671188.2749346","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:35Z","timestamp":1750227155000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2671188.2749346"}},"subtitle":["Towards a Scalable and Effective Indexing Framework for Large Scale Music Retrieval"],"short-title":[],"issued":{"date-parts":[[2015,6,22]]},"references-count":17,"alternative-id":["10.1145\/2671188.2749346","10.1145\/2671188"],"URL":"https:\/\/doi.org\/10.1145\/2671188.2749346","relation":{},"subject":[],"published":{"date-parts":[[2015,6,22]]},"assertion":[{"value":"2015-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}