Record
- Authors
- Beyer, K.; Goldstein, J.; Ramakrishnan, R.; Shaft, U.
- Year
- 1999
- Title
- When is "nearest neighbor" meaningful
- Published in
- Database Theory: ICDT'99
- Pages
- 217–235
- Type
- Book chapter
- Our note
- none yet
- Verification
- matched-by-title: found by title in an open index (same title, year and first author) (checked against OpenAlex, 2026-11-14).
Identifiers found: OpenAlex W1672197616 · DOI 10.1007/3-540-49257-7_15 - Id
beyer-1999-when-is-nearest-neighbor-meaningful
Cited on
- K-Nearest Neighbors for pp. 217–235 read status: not stated
As cited
The pages cite this work in one form.
-
Beyer, K., Goldstein, J., Ramakrishnan, R., and Shaft, U. (1999). When is "nearest neighbor" meaningful? In C. Beeri and P. Buneman (Eds.), Database Theory: ICDT'99 (Lecture Notes in Computer Science, Vol. 1540, pp. 217–235). Springer.
BibLaTeX
@incollection{beyer-1999-when-is-nearest-neighbor-meaningful,
author = {Beyer, K. and Goldstein, J. and Ramakrishnan, R. and Shaft, U.},
title = {{When is "nearest neighbor" meaningful}},
booktitle = {Database Theory: ICDT'99},
date = {1999},
pages = {217--235}
}