{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:44Z","timestamp":1750308224250,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,8,22]],"date-time":"2004-08-22T00:00:00Z","timestamp":1093132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,8,22]]},"DOI":"10.1145\/1014052.1014131","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"629-634","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["The IOC algorithm"],"prefix":"10.1145","author":[{"given":"Ting","family":"Liu","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Ke","family":"Yang","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Andrew W.","family":"Moore","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]}],"member":"320","published-online":{"date-parts":[[2004,8,22]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022689900470"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"e_1_3_2_1_4_1","unstructured":"Jock A. Blackard. Forest covertype database. http:\/\/kdd.ics.uci.edu\/databases\/covertype\/covertype.data.html.  Jock A. Blackard. Forest covertype database. http:\/\/kdd.ics.uci.edu\/databases\/covertype\/covertype.data.html."},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 23rd VLDB International Conference","author":"Ciaccia P.","year":"1997","unstructured":"P. Ciaccia , M. Patella , and P. Zezula . M-tree: An efficient access method for similarity search in metric spaces . In Proceedings of the 23rd VLDB International Conference , September 1997 . P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the 23rd VLDB International Conference, September 1997."},{"key":"e_1_3_2_1_6_1","unstructured":"Ron Cole and Mark Fanty. Isolet spoken letter recognition database. ftp:\/\/ftp.ics.uci.edu\/pub\/machine-learning-databases\/isolet\/.  Ron Cole and Mark Fanty. Isolet spoken letter recognition database. ftp:\/\/ftp.ics.uci.edu\/pub\/machine-learning-databases\/isolet\/."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc 25th VLDB Conference","author":"Gionis A.","year":"1999","unstructured":"A. Gionis , P. Indyk , and R. Motwani . Similarity Search in High Dimensions via Hashing . In Proc 25th VLDB Conference , 1999 . A. Gionis, P. Indyk, and R. Motwani. Similarity Search in High Dimensions via Hashing. In Proc 25th VLDB Conference, 1999."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729805"},{"key":"e_1_3_2_1_10_1","volume-title":"The trec-2001 video trackorganized by nist shot boundary task","author":"CMU","year":"2001","unstructured":"CMU informedia digital video library project. The trec-2001 video trackorganized by nist shot boundary task . 2001 . CMU informedia digital video library project. The trec-2001 video trackorganized by nist shot boundary task. 2001."},{"key":"e_1_3_2_1_11_1","unstructured":"IOC. International olympic committee: Candidature acceptance procedure. http:\/\/multimedia.olympic.org\/pdf\/ en report 711.pdf 1999.  IOC. International olympic committee: Candidature acceptance procedure. http:\/\/multimedia.olympic.org\/pdf\/ en report 711.pdf 1999."},{"key":"e_1_3_2_1_12_1","first-page":"369","volume-title":"The SR-tree: an index structure for high-dimensional nearest neighbor queries","author":"Katayama Norio","year":"1997","unstructured":"Norio Katayama and Shin'ichi Satoh . The SR-tree: an index structure for high-dimensional nearest neighbor queries . pages 369 -- 380 , 1997 . Norio Katayama and Shin'ichi Satoh. The SR-tree: an index structure for high-dimensional nearest neighbor queries. pages 369--380, 1997."},{"key":"e_1_3_2_1_13_1","unstructured":"Nicholas Kushmerick. Internet advertisements. ftp:\/\/ftp.ics.uci.edu\/pub\/machine-learning-databases\/internet ads\/.  Nicholas Kushmerick. Internet advertisements. ftp:\/\/ftp.ics.uci.edu\/pub\/machine-learning-databases\/internet ads\/."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of Neural Information Processing Systems","author":"Liu Ting","year":"2003","unstructured":"Ting Liu , Andrew Moore , and Alexander Gray . Efficient exact k-nn and nonparametric classification in high dimensions . In Proceedings of Neural Information Processing Systems , 2003 . Ting Liu, Andrew Moore, and Alexander Gray. Efficient exact k-nn and nonparametric classification in high dimensions. In Proceedings of Neural Information Processing Systems, 2003."},{"key":"e_1_3_2_1_15_1","volume-title":"Twelfth Conference on Uncertainty in Artificial Intelligence. AAAI Press","author":"Moore A. W.","year":"2000","unstructured":"A. W. Moore . The Anchors Hierarchy: Using the Triangle Inequality to Survive High-Dimensional Data . In Twelfth Conference on Uncertainty in Artificial Intelligence. AAAI Press , 2000 . A. W. Moore. The Anchors Hierarchy: Using the Triangle Inequality to Survive High-Dimensional Data. In Twelfth Conference on Uncertainty in Artificial Intelligence. AAAI Press, 2000."},{"key":"e_1_3_2_1_16_1","volume-title":"Morgan Kaufmann","author":"Omohundro S. M.","year":"1991","unstructured":"S. M. Omohundro . Bumptrees for Efficient Function, Constraint, and Classification Learning. In R. P. Lippmann, J. E. Moody, and D. S. Touretzky, editors, Advances in Neural Information Processing Systems 3 . Morgan Kaufmann , 1991 . S. M. Omohundro. Bumptrees for Efficient Function, Constraint, and Classification Learning. In R. P. Lippmann, J. E. Moody, and D. S. Touretzky, editors, Advances in Neural Information Processing Systems 3. Morgan Kaufmann, 1991."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/4333"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1153922.1154326"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3091574.3091610"},{"key":"e_1_3_2_1_20_1","unstructured":"David J. Slate. Letter recognition database. ftp:\/\/ftp.ics.uci.edu\/pub\/machine-learning-databases\/letter-recognition\/.  David J. Slate. Letter recognition database. ftp:\/\/ftp.ics.uci.edu\/pub\/machine-learning-databases\/letter-recognition\/."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"e_1_3_2_1_22_1","first-page":"194","volume-title":"Proc. 24th Int. Conf. Very Large Data Bases, VLDB","author":"Weber Roger","year":"1998","unstructured":"Roger Weber , Hans-Jorg Schek , and Stephen Blott . A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces . In Proc. 24th Int. Conf. Very Large Data Bases, VLDB , pages 194 -- 205 , 24--27 1998 . Roger Weber, Hans-Jorg Schek, and Stephen Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. 24th Int. Conf. Very Large Data Bases, VLDB, pages 194--205, 24--27 1998."}],"event":{"name":"KDD04: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"],"location":"Seattle WA USA","acronym":"KDD04"},"container-title":["Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014131","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1014052.1014131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:25Z","timestamp":1750264285000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014131"}},"subtitle":["efficient many-class non-parametric classification for high-dimensional data"],"short-title":[],"issued":{"date-parts":[[2004,8,22]]},"references-count":21,"alternative-id":["10.1145\/1014052.1014131","10.1145\/1014052"],"URL":"https:\/\/doi.org\/10.1145\/1014052.1014131","relation":{},"subject":[],"published":{"date-parts":[[2004,8,22]]},"assertion":[{"value":"2004-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}