{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:32:36Z","timestamp":1725521556422},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540893776"},{"type":"electronic","value":"9783540893783"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89378-3_35","type":"book-chapter","created":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T21:43:58Z","timestamp":1227735838000},"page":"355-361","source":"Crossref","is-referenced-by-count":2,"title":["Mining Arbitrarily Large Datasets Using Heuristic k-Nearest Neighbour Search"],"prefix":"10.1007","author":[{"given":"Xing","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoffrey","family":"Holmes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Pfahringer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Domingos, P., Hulten, G.: Mining complex models from arbitrarily large databases in constant time. In: international conference on Knowledge discovery and data mining, pp. 525\u2013531 (2002)","DOI":"10.1145\/775047.775124"},{"key":"35_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-74976-9_16","volume-title":"Knowledge Discovery in Databases: PKDD 2007","author":"A.M. Kibriya","year":"2007","unstructured":"Kibriya, A.M., Frank, E.: An Empirical Comparison of Exact Nearest Neighbour Algorithms. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol.\u00a04702, pp. 140\u2013151. Springer, Heidelberg (2007)"},{"key":"35_CR3","unstructured":"Kirkby, R.: Improving Hoeffding Trees, PhD thesis, University of Waikato (2007)"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","volume":"14","author":"X. Wu","year":"2007","unstructured":"Wu, X., Kumar, V., Quinlan, J.R., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G.J., Ng, A., Liu, B., Yu, P.S., Zhou, Z.H., Steinbach, M., Hand, D.J., Steinberg, D.: Top 10 algorithms in data mining. Knowledge and Information Systems\u00a014, 1\u201337 (2007)","journal-title":"Knowledge and Information Systems"}],"container-title":["Lecture Notes in Computer Science","AI 2008: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89378-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T19:37:42Z","timestamp":1557949062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89378-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540893776","9783540893783"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89378-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}