{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:28:34Z","timestamp":1725564514381},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207795"},{"type":"electronic","value":"9783540246183"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24618-3_20","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T07:31:03Z","timestamp":1283671863000},"page":"241-248","source":"Crossref","is-referenced-by-count":1,"title":["Features of Neighbors Spaces"],"prefix":"10.1007","author":[{"given":"Marcel","family":"Jirina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Marcel","family":"Jirina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02716805","volume":"16","author":"S. Arya","year":"1996","unstructured":"Arya, S., Mount, D.M., Narayan, O.: Accounting for Boundary Effects in Nearest Neighbor Searching. Discrete and Computational Geometry\u00a016, 155\u2013176 (1996)","journal-title":"Discrete and Computational Geometry"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Beyer, K., et al.: When is \u201cNearest Neighbor\u201d Meaningful? In: Proc. of the 7th International Conference on Database Theory. Jerusalem, Israel, pp. 217\u2013235 (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"key":"20_CR3","unstructured":"Burton, B.G.: The Poisson distribution and the Poisson process, \n                    \n                      http:\/\/www.zoo.cam.ac.uk\/zoostaff\/laughlin\/brian\/minireviews\/poisson\/poisson.pdf"},{"issue":"11","key":"20_CR4","first-page":"445","volume":"31","author":"J.C. Demaret","year":"1977","unstructured":"Demaret, J.C., Gareet, A.: Sum of Exponential Random Variables. AE\u00dc\u00a031(11), 445\u2013448 (1977)","journal-title":"AE\u00dc"},{"key":"20_CR5","volume-title":"Pattern Classification","author":"R.O. Duda","year":"2000","unstructured":"Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. John Wiley and Sons, Inc., New York (2000)","edition":"2"},{"key":"20_CR6","volume-title":"Statistical Methods in Experimental Physics","author":"W.T. Eadie","year":"1982","unstructured":"Eadie, W.T., et al.: Statistical Methods in Experimental Physics. North-Holland, Amsterdam (1982)"},{"key":"20_CR7","unstructured":"Hinnenburg, A., Aggarwal, C.C., Keim, D.A.: What is the Nearest Neighbor in High Dimensional Spaces? In: Proc. of the 26th VLDB Conf., Cairo, Egypt, pp. 506\u2013515 (2000)"},{"key":"20_CR8","series-title":"Theory","volume-title":"Queueing Systems","author":"L. Kleinrock","year":"1975","unstructured":"Kleinrock, L.: Queueing Systems. Theory, vol.\u00a0I. John Wiley & Sons, New York (1975)"},{"key":"20_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-3324-9","volume-title":"Density Estimation for Statistics and Data Analysis","author":"B.W. Silverman","year":"1986","unstructured":"Silverman, B.W.: Density Estimation for Statistics and Data Analysis. Chapman and Hall, London (1986)"},{"key":"20_CR10","unstructured":"Ch\u00e1vez, E., Figueroa, K., Navarro, G.: A Fast Algorithm for the All k Nearest Neighbors Problem in General Metric Spaces, \n                    \n                      http:\/\/citeseer.nj.nec.com\/correct\/462760"},{"issue":"1-2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0020-0190(99)00156-8","volume":"73","author":"V. Pestov","year":"2000","unstructured":"Pestov, V.: On the Geometry of Similarity Search: Dimensionality Curse and Concentration of Measure. Information Processing Letters\u00a073(1-2), 47\u201351 (2000)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2004: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24618-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T16:56:53Z","timestamp":1580317013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24618-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540207795","9783540246183"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24618-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}