{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T12:41:21Z","timestamp":1781613681320,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540749752","type":"print"},{"value":"9783540749769","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74976-9_16","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T06:52:35Z","timestamp":1188370355000},"page":"140-151","source":"Crossref","is-referenced-by-count":29,"title":["An Empirical Comparison of Exact Nearest Neighbour Algorithms"],"prefix":"10.1007","author":[{"given":"Ashraf M.","family":"Kibriya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eibe","family":"Frank","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","first-page":"222","volume-title":"Perceptrons","author":"M. Minsky","year":"1969","unstructured":"Minsky, M., Papert, S.: Perceptrons, pp. 222\u2013225. MIT Press, Cambridge (1969)"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams\u2013A survey of a fundamental geometric data structure. ACM Computing Surveys\u00a023(3), 345\u2013405 (1991)","journal-title":"ACM Computing Surveys"},{"key":"16_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"T. Hastie","year":"2001","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, Heidelberg (2001)"},{"key":"16_CR4","volume-title":"Proc. of NIPS 2003","author":"T. Liu","year":"2004","unstructured":"Liu, T., Moore, A.W., Gray, A.G.: Efficient exact k-NN and nonparametric classification in high dimensions. In: Proc. of NIPS 2003, MIT Press, Cambridge (2004)"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/276698.276876","volume-title":"Proc. 13th Annual ACM symposium on Theory of Computing","author":"P. Indyk","year":"1998","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proc. 13th Annual ACM symposium on Theory of Computing, pp. 604\u2013613. ACM Press, New York (1998)"},{"issue":"9","key":"16_CR6","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1109\/34.615448","volume":"19","author":"S.A. Nene","year":"1997","unstructured":"Nene, S.A., Nayar, S.K.: A simple algorithm for nearest neighbor search in high dimensions. IEEE Trans. Pattern Anal. Mach. Intell.\u00a019(9), 989\u20131003 (1997)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/997817.997857","volume-title":"Proc. 20th Annual Symposium on Computational Geometry","author":"M. Datar","year":"2004","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proc. 20th Annual Symposium on Computational Geometry, pp. 253\u2013262. ACM Press, New York (2004)"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/1143844.1143857","volume-title":"Proc. 23rd International Conference on Machine learning","author":"A. Beygelzimer","year":"2006","unstructured":"Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: Proc. 23rd International Conference on Machine learning, pp. 97\u2013104. ACM Press, New York (2006)"},{"issue":"9","key":"16_CR9","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"16_CR10","unstructured":"Mount, D.M., Arya, S.: ANN: A library for approximate nearest neighbor searching. In: CGC 2nd Annual Fall Workshop on Computational Geometry (1997), Available from http:\/\/www.cs.umd.edu\/~mount\/ANN"},{"key":"16_CR11","unstructured":"Kibriya, A.M.: Fast algorithms for nearest neighbour search. Master\u2019s thesis, Department of Computer Science, University of Waikato, New Zealand (2007)"},{"key":"16_CR12","unstructured":"Omohundro, S.M.: Five balltree construction algorithms. Technical Report TR-89-063, International Computer Science Institute (December 1989)"},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity \/ similarity queries with metric trees. Information Processing Letters\u00a040(4), 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"16_CR14","first-page":"397","volume-title":"Proc. 16th Conference on Uncertainty in Artificial Intelligence","author":"A.W. Moore","year":"2000","unstructured":"Moore, A.W.: The anchors hierarchy: Using the triangle inequality to survive high dimensional data. In: Proc. 16th Conference on Uncertainty in Artificial Intelligence, pp. 397\u2013405. Morgan Kaufmann, San Francisco (2000)"},{"issue":"10","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TCOM.1985.1096214","volume":"33","author":"C.D. Bei","year":"1985","unstructured":"Bei, C.D., Gray, R.M.: An improvement of the minimum distortion encoding algorithm for vector quantization. IEEE Transactions on Communications\u00a033(10), 1132\u20131133 (1985)","journal-title":"IEEE Transactions on Communications"},{"issue":"3","key":"16_CR16","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1023\/A:1024068626366","volume":"52","author":"C. Nadeau","year":"2003","unstructured":"Nadeau, C., Bengio, Y.: Inference for the generalization error. Machine Learning\u00a052(3), 239\u2013281 (2003)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74976-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T19:18:06Z","timestamp":1684005486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74976-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749752","9783540749769"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74976-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}