The DOI matches its Crossref record; 30 of the 31 references it cites were found in a registry or an index.
When Is ''Nearest Neighbor'' Meaningful?
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“as expected in high-dimensional sparse voting data (Beyer et al., 1999).”
From Benchmarking Overton Pluralism in LLMs (2025) · cites this paper as Beyer et al., 1999
Citations
Cites
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
Swain, M. J., & Ballard, D. H. (1991) · International Journal of Computer Vision · doi:10.1007/bf00130487 · Cited by 5,625
Multivariate Density Estimation
Scott, D. W. (1992) · Wiley series in probability and statistics · doi:10.1002/9780470316849 · Cited by 3,786
Texture features for browsing and retrieval of image data
Manjunath, B. S., & Ma, W. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.531803 · Cited by 3,729
Adaptive Control Processes: A Guided Tour
Bellman, R. E. (1961) · doi:10.1515/9781400874668 · Cited by 2,802
Efficient similarity search in sequence databases
Agrawal, R., Faloutsos, C., & Swami, A. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57301-1_5 · Cited by 1,989
Visual learning and recognition of 3-d objects from appearance
Murase, H., & Nayar, S. K. (1995) · International Journal of Computer Vision · doi:10.1007/bf01421486 · Cited by 1,873
Using discriminant eigenfeatures for image retrieval
Swets, D. L., & Weng, J. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.531802 · Cited by 1,627
Efficient and effective Querying by Image Content
Faloutsos, C., Barber, R., Flickner, M., Hafner, J., Niblack, W., Petković, D., & Equitz, W. (1994) · Journal of Intelligent Information Systems · doi:10.1007/bf00962238 · Cited by 1,250
Bellman, R. (1964) · IEEE Transactions on Circuit Theory · doi:10.1109/tct.1964.1082221 · Cited by 1,003
Photobook: tools for content-based manipulation of image databases
Pentland, A. P., Picard, R. W., & Scarloff, S. (1994) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.171786 · Cited by 882
Katayama, N., & Satoh, S. (1997) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/253260.253347 · Cited by 821
Similarity indexing with the SS-tree
White, D. A., & Jain, R. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1996.492202 · Cited by 634
An optimal algorithm for approximate nearest neighbor searching
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y. (1994) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · doi:10.5555/314464.314652 · Cited by 590
The TV-tree: An index structure for high-dimensional data
Lin, K.-I., Jagadish, H. V., & Faloutsos, C. (1994) · The VLDB Journal · doi:10.1007/bf01231606 · Cited by 495
A cost model for nearest neighbor search in high-dimensional data space
Berchtold, S., Böhm, C., Keim, D. A., & Kriegel, H. (1997) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/263661.263671 · Cited by 374
Distance-based indexing for high-dimensional metric spaces
Bozkaya, T., & Özsoyoğlu, M. (1997) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/253260.253345 · Cited by 334
Optimal Expected-Time Algorithms for Closest Point Problems
Bentley, J. L., Weide, B. W., & Yao, A. C.-C. (1980) · ACM Transactions on Mathematical Software · doi:10.1145/355921.355927 · Cited by 314
A simple algorithm for nearest neighbor search in high dimensions
Nene, S. A., & Nayar, S. K. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.615448 · Cited by 313
Beyond uniformity and independence
Faloutsos, C., & Kamel, I. (1994) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/182591.182593 · Cited by 239
Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension
Belussi, A., & Faloutsos, C. (2018) · University Libraries (University of Maryland) · doi:10.1184/r1/6605282 · Cited by 173
Fast parallel similarity search in multimedia databases
Berchtold, S., Böhm, C., Braunmüller, B., Keim, D. A., & Kriegel, H. (1997) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/253260.253263 · Cited by 168
Recognition and positioning of rigid objects using algebraic moment invariants
Taubin, G., & Cooper, D. B. (1991) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.48423 · Cited by 104
Approximate closest-point queries in high dimensions
Bern, M. W. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90222-u · Cited by 83
Feature-based retrieval of similar shapes
Mehrotra, R., & Gary, J. E. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1993.344072 · Cited by 82
Accounting for boundary effects in nearest neighbor searching
Arya, S., Mount, D. M., & Narayan, O. (1995) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/220279.220315 · Cited by 43
Nearest neighbor searching and applications
Arya, S. (1996) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 41
Analysis of n-Dimensional Quadtrees using the Hausdorff Fractal Dimension
Faloutsos, C., & Gaede, V. (2018) · Figshare · doi:10.1184/r1/6603476 · Cited by 33
Image retrieval based on multidimensional feature properties
Ang, Y. H., Li, Z., & Ong, S. H. (1995) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.205317 · Cited by 24
Automated analysis and exploration of image databases: Results, progress, and challenges
Fayyad, U. M., Smyth, P., Weir, N., & Djorgovski, S. G. (1995) · Journal of Intelligent Information Systems · doi:10.1007/bf00962819 · Cited by 22
Cited by
Sorted by citations
Data mining: concepts and techniques
Sharma, R., Shah, K., Shirahatti, Y., Patel, S., Sharma, R., Shah, K., Patel, S., Sharma, R., & Han, J. (2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,665
Survey of Clustering Algorithms
Xu, R., & Wunsch, D. C. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,399
Chicco, D., & Jurman, G. (2020) · BMC Genomics · doi:10.1186/s12864-019-6413-7 · Cited by 6,143
Locality-sensitive hashing scheme based on p-stable distributions
Datar, M., Immorlica, N., Indyk, P., & Mirrokni, V. (2004) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/997817.997857 · Cited by 2,971
Product Quantization for Nearest Neighbor Search
Jégou, H., Douze, M., & Schmid, C. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.57 · Cited by 2,956
Metadata
- Authors
- Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U.
- Affiliations
- University of Wisconsin–Madison (US)
- ORCID
- Ramakrishnan, Raghu
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1999
- Pages
- 217-235
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1672197616
- Cited by
- 2,403
- References
- 31
- Citations by year
- 2026: 67 · 2025: 84 · 2024: 86 · 2023: 82 · 2022: 81 · 2021: 102 · 2020: 112 · 2019: 128 · 2018: 112 · 2017: 99 · 2016: 117 · 2015: 110 · 2014: 119 · 2013: 127 · 2012: 115
- FWCI
- 38.88
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Minds at UW (University of Wisconsin) (submittedVersion)
- Funders
- David and Lucile Packard Foundation
- Topics
- Physical Sciences › Computer Science › Information Systems › Data Management and Algorithms
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
- Keywords
- nearest neighbor search, high-dimensional indexing, curse of dimensionality, nearest neighbor distance, linear scan
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
