{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:22:12Z","timestamp":1743150132105,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642045912"},{"type":"electronic","value":"9783642045929"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04592-9_42","type":"book-chapter","created":{"date-parts":[[2009,9,28]],"date-time":"2009-09-28T06:41:21Z","timestamp":1254120081000},"page":"333-339","source":"Crossref","is-referenced-by-count":0,"title":["A Fast Nearest Neighbor Method Using Empirical Marginal Distribution"],"prefix":"10.1007","author":[{"given":"Mineichi","family":"Kudo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Toyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideyuki","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","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 Transactions on Pattern Analysis and Machine Intelligence\u00a019, 989\u20131003 (1997)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45-6","author":"S. Arya","year":"1998","unstructured":"Arya, S., et al.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM\u00a045-6, 891\u2013923 (1998), \n                    \n                      http:\/\/www.cs.umd.edu\/~mount\/ANN\/","journal-title":"Journal of the ACM"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: Two algorithms for nearest-neighbor search in high dimension. In: Proc. 29th Annu. ACM sympos. Theory Comput., pp. 599\u2013608 (1997)","DOI":"10.1145\/258533.258653"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","first-page":"172","volume-title":"Information and Communications Security","author":"S. Maneewongvatana","year":"2002","unstructured":"Maneewongvatana, S., Mount, D.M.: An Empirical Study of a New Approach to Nearest Neighbor Searching. In: Deng, R.H., Qing, S., Bao, F., Zhou, J. (eds.) ICICS 2002. LNCS, vol.\u00a02513, pp. 172\u2013187. Springer, Heidelberg (2002)"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M.: PAC nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In: Proceedings of the 16th International Conference on Data Engineering, pp. 244\u2013255 (2000)","DOI":"10.1109\/ICDE.2000.839417"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"42_CR7","volume-title":"Nearest-Neighbor Methods in Learning and Vision: Theory and Practice","author":"A. Andoni","year":"2006","unstructured":"Andoni, A., et al.: Locality-Sensitive Hashing Using Stable Distributions. In: Shakhnarovich, G., Darrell, T., Indyk, P. (eds.) Nearest-Neighbor Methods in Learning and Vision: Theory and Practice, vol.\u00a03. MIT Press, Cambridge (2006)"},{"issue":"1","key":"42_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A. Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. Communications of the ACM\u00a051(1), 117\u2013122 (2008)","journal-title":"Communications of the ACM"},{"key":"42_CR9","unstructured":"Le Cunn, Y.: The mnist dataset of handwritten digits, \n                    \n                      http:\/\/yann.lecun.com\/exdb\/mnist\/"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based and Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04592-9_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T20:47:43Z","timestamp":1552164463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04592-9_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642045912","9783642045929"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04592-9_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}