The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Abstract
An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record. The computation required to organize the file is proportional to kNlogN. The expected number of records examined in each search is independent of the file size. The expected computation to perform each search is proportional-to 1ogN. Empirical evidence suggests that except for very small files, this algorithm is considerably faster than other methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Self-citationThe Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
Quad trees a data structure for retrieval on composite keys
Finkel, R. A., & Bentley, J. L. (1974) · Acta Informatica · doi:10.1007/bf00288933 · Cited by 2,041
Self-citationConstructing optimal binary decision trees is NP-complete
Hyafil, L., & Rivest, R. L. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90095-8 · Cited by 959
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
Fukunaga, K., & Narendra, P. M. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224297 · Cited by 736
Some approaches to best-match file searching
Burkhard, W. A., & Keller, R. M. (1973) · Communications of the ACM · doi:10.1145/362003.362025 · Cited by 413
An Algorithm for Finding Nearest Neighbors
Friedman, J. H., Baskett, F., & Shustek, L. J. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224110 · Cited by 394
Self-citationOptimization of k nearest neighbor density estimates
Fukunaga, K., & Hostetler, L. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055003 · Cited by 188
On the Optimality of Elia's Algorithm for Performing Best-Match Searches.
Rivest, R. L. (1974) · IFIP Congress · Cited by 32
Research works printed but not linked: 2
- PIZER , S.M. Numerical Computing and Mathematical Analysis , Science Research Associates , Chicago, Ill ., 1975 , p. 88, eq. 87. PIZER, S.M. Numerical Computing and Mathematical Analysis, Science Research Associates, Chicago, Ill., 1975, p. 88, eq. 87.
- SHAMOS , M.I. Geometric Complexity. Conf. Rec. Seventh Annual ACM Syrup. on Theory of Comptng , Albuquerque, N.Mex. , May 1975 , 224 - 233 . 10.1145/800116.803772 SHAMOS, M.I. Geometric Complexity. Conf. Rec. Seventh Annual ACM Syrup. on Theory of Comptng, Albuquerque, N.Mex., May 1975, 224-233. 10.1145/800116.803772 · doi:10.1145/800116.803772
Cited by
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Self-citationTop 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667
“Friedman [ 25 ] suggested moving instances with missing splitter attributes into both left and right child nodes and making a final class assignment by pooling all nodes in which an instance appears.”
Background(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Determining embedding dimension for phase-space reconstruction using a geometrical construction
Kennel, M. B., Brown, R., & Abarbanel, H. D. I. (1992) · Physical Review A · doi:10.1103/physreva.45.3403 · Cited by 3,776
(1999) · Cited by 3,186
Theoretical and Empirical Analysis of ReliefF and RReliefF
Robnik-Šikonja, M., & Kononenko, I. (2003) · Machine Learning · doi:10.1023/a:1025667309714 · Cited by 3,025
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
“( Several multi-dimensional indexing methods, such as the popular KD-tree [5] or other branch and bound techniques, have been proposed to reduce the search time.”
MethodA Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
(2009) · Proceedings of the Fourth International Conference on Computer Vision Theory and Applications · doi:10.5220/0001787803310340 · Cited by 2,640
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y. (1998) · Journal of the ACM · doi:10.1145/293347.293348 · Cited by 2,300
Accelerating t-SNE using tree-based algorithms
van der Maaten, L. (2014) · doi:10.5555/2627435.2697068 · Cited by 2,226
The Quadtree and Related Hierarchical Data Structures
Samet, H. (1984) · ACM Computing Surveys · doi:10.1145/356924.356930 · Cited by 2,205
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
The analysis of observed chaotic data in physical systems
Abarbanel, H. D. I., Brown, R., Sidorowich, J. J., & Tsimring, L. S. (1993) · Reviews of Modern Physics · doi:10.1103/revmodphys.65.1331 · Cited by 1,848
FAST-LIO2: Fast Direct LiDAR-Inertial Odometry
Xu, W., Cai, Y., He, D., Lin, J., & Zhang, F. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3141876 · Cited by 1,750
Atkeson, C. G., Moore, A. W., & Schaal, S. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006559212014 · Cited by 1,671
Scalable Nearest Neighbor Algorithms for High Dimensional Data
Muja, M., & Lowe, D. G. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2321376 · Cited by 1,407
Roussopoulos, N., Kelley, S., & Vincent, F. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223794 · Cited by 1,402
A review of methods for spike sorting: the detection and classification of neural action potentials
Lewicki, M. S. (1998) · Network Computation in Neural Systems · doi:10.1088/0954-898x/9/4/001 · Cited by 1,370
Salakhutdinov, R., & Hinton, G. (2009) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2008.11.006 · Cited by 1,246
Local Regression and Likelihood
Loader, C. (1999) · Statistics and Computing · doi:10.1007/b98858 · Cited by 1,195
Mondrian Multidimensional K-Anonymity
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.101 · Cited by 1,124
Efficient clustering of high-dimensional data sets with application to reference matching
McCallum, A., Nigam, K., & Ungar, L. H. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347123 · Cited by 1,096
A Survey of Recent Advances in Hierarchical Clustering Algorithms
Murtagh, F. (1983) · The Computer Journal · doi:10.1093/comjnl/26.4.354 · Cited by 1,058
(1993) · doi:10.5555/313559.313789 · Cited by 998
Network Intrusion Detection for IoT Security Based on Learning Techniques
Chaabouni, N., Mosbah, M., Zemmari, A., Sauvignac, C., & Faruki, P. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2896380 · Cited by 940
Kernelized locality-sensitive hashing for scalable image search
Kulis, B., & Grauman, K. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459466 · Cited by 890
Shape indexing using approximate nearest-neighbour search in high-dimensional spaces
Beis, J. S., & Lowe, D. G. (2002) · Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1997.609451 · Cited by 879
Frank, M., Biedert, R., Ma, E., Martinovic, I., & Song, D. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2012.2225048 · Cited by 844
“For all consecutive decisions, a sliding window of the preceding strokes is available for robust decision.”
BackgroundBöhm, C., Berchtold, S., & Keim, D. A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502809 · Cited by 827
Cover trees for nearest neighbor
Beygelzimer, A., Kakade, S., & Langford, J. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143857 · Cited by 813
Semi-Supervised Hashing for Large-Scale Search
Wang, J., Kumar, S., & Chang, S.-F. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.48 · Cited by 810
Structure from motion photogrammetry in physical geography
Smith, M. W., Carrivick, J. L., & Quincey, D. J. (2016) · Progress in Physical Geography: Earth and Environment · doi:10.1177/0309133315615805 · Cited by 772
Weinmann, M., Jutzi, B., Hinz, S., & Mallet, C. (2015) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2015.01.016 · Cited by 709
Optimised KD-trees for fast image descriptor matching
Silpa-Anan, C., & Hartley, R. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587638 · Cited by 677
Kulis, B. (2013) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000019 · Cited by 672
Relative neighborhood graphs and their relatives
Jaromczyk, J. W., & Toussaint, G. T. (1992) · Proceedings of the IEEE · doi:10.1109/5.163414 · Cited by 664
Color image quantization for frame buffer display
Heckbert, P. (1982) · Proceedings of the 9th annual conference on Computer graphics and interactive techniques · doi:10.1145/800064.801294 · Cited by 656
Real-time texture synthesis by patch-based sampling
Liang, L., Liu, C., Xu, Y.-Q., Guo, B., & Shum, H.-Y. (2001) · ACM Transactions on Graphics · doi:10.1145/501786.501787 · Cited by 655
Similarity indexing with the SS-tree
White, D. A., & Jain, R. (2002) · Proceedings of the Twelfth International Conference on Data Engineering · doi:10.1109/icde.1996.492202 · Cited by 635
Data Structures for Range Searching
Bentley, J. L., & Friedman, J. H. (1979) · ACM Computing Surveys · doi:10.1145/356789.356797 · Cited by 622
Self-citationThe Trimmed Iterative Closest Point algorithm
Chetverikov, D., Svirko, D., Stepanov, D., & Krsek, P. (2003) · Object recognition supported by user interaction for service robots · doi:10.1109/icpr.2002.1047997 · Cited by 617
Semi-supervised hashing for scalable image retrieval
Wang, J., Kumar, S., & Chang, S.-F. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539994 · Cited by 601
Cleveland, W. S., Devlin, S. J., & Grosse, E. (1988) · Journal of Econometrics · doi:10.1016/0304-4076(88)90077-2 · Cited by 599
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 594
Geometric structures for three-dimensional shape representation
Boissonnat, J.-D. (1984) · ACM Transactions on Graphics · doi:10.1145/357346.357349 · Cited by 581
Color image quantization for frame buffer display
Heckbert, P. (1982) · ACM SIGGRAPH Computer Graphics · doi:10.1145/965145.801294 · Cited by 549
An Efficient Program for Many-Body Simulation
Appel, A. W. (1985) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0906008 · Cited by 546
Sparse Iterative Closest Point
Bouaziz, S., Tagliasacchi, A., & Pauly, M. (2013) · Computer Graphics Forum · doi:10.1111/cgf.12178 · Cited by 534
A Survey Of Free-Form Object Representation and Recognition Techniques
Campbell, R. J., & Flynn, P. J. (2001) · Computer Vision and Image Understanding · doi:10.1006/cviu.2000.0889 · Cited by 509
Statistical aspects of neural networks
Ripley, B. D. (1993) · Networks and Chaos — Statistical and Probabilistic Aspects · doi:10.1007/978-1-4899-3099-6_2 · Cited by 504
Pajouh, H. H., Javidan, R., Khayami, R., Dehghantanha, A., & Choo, K.-K. R. (2019) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2016.2633228 · Cited by 503
A new approach for semi-automatic rock mass joints recognition from 3D point clouds
Riquelme, A. J., Abellán, A., Tomás, R., & Jaboyedoff, M. (2014) · Computers & Geosciences · doi:10.1016/j.cageo.2014.03.014 · Cited by 491
Variable Kernel Estimates of Multivariate Densities
Breiman, L., Meisel, W., & Purcell, E. (1977) · Technometrics · doi:10.1080/00401706.1977.10489521 · Cited by 488
Kulis, B. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601986979 · Cited by 482
6D SLAM—3D mapping outdoor environments
Nüchter, A., Lingemann, K., Hertzberg, J., & Surmann, H. (2007) · Journal of Field Robotics · doi:10.1002/rob.20209 · Cited by 450
Optimal multi-step k-nearest neighbor search
Seidl, T., & Kriegel, H.-P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276319 · Cited by 442
Sharma, G., & Trussell, H. J. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.597268 · Cited by 440
Index-driven similarity search in metric spaces (Survey Article)
Hjaltason, G. R., & Samet, H. (2003) · ACM Transactions on Database Systems · doi:10.1145/958942.958948 · Cited by 439
CART (Classification and Regression Trees)
(2004) · The SAGE Encyclopedia of Social Science Research Methods · doi:10.4135/9781412950589.n88 · Cited by 430
yaImpute: An R Package for k NN Imputation
Crookston, N. L., & Finley, A. O. (2008) · Journal of Statistical Software · doi:10.18637/jss.v023.i10 · Cited by 418
Multidimensional Binary Search Trees in Database Applications
Bentley, J. L. (1979) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1979.234200 · Cited by 410
Self-citationBredfeldt, J. S., Liu, Y., Pehlke, C. A., Conklin, M. W., Szulczewski, J. M., Inman, D. R., Keely, P. J., Nowak, R. D., Mackie, T. R., & Eliceiri, K. W. (2014) · Journal of Biomedical Optics · doi:10.1117/1.jbo.19.1.016007 · Cited by 412
Automatic Target Recognition: State of the Art Survey
Bhanu, B. (1986) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.1986.310772 · Cited by 409
Optimal pruning with applications to tree-structured source coding and modeling
Chou, P. A., Lookabaugh, T., & Gray, R. M. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.32124 · Cited by 407
A new vector quantization clustering algorithm
Equitz, W. H. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.35395 · Cited by 405
A review of instance selection methods
Olvera-López, J. A., Carrasco-Ochoa, J. A., Martínez-Trinidad, J. F., & Kittler, J. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-010-9165-y · Cited by 394
Illuminating search spaces by mapping elites
Mouret, J.-B., & Clune, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.04909 · Cited by 386
A cost model for nearest neighbor search in high-dimensional data space
Berchtold, S., Böhm, C., Keim, D. A., & Kriegel, H.-P. (1997) · Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/263661.263671 · Cited by 373
Projection-based model reduction: Formulations for physics-based machine learning
Swischuk, R., Mainini, L., Peherstorfer, B., & Willcox, K. (2019) · Computers & Fluids · doi:10.1016/j.compfluid.2018.07.021 · Cited by 372
FAST SEMANTIC SEGMENTATION OF 3D POINT CLOUDS WITH STRONGLY VARYING DENSITY
Hackel, T., Wegner, J. D., & Schindler, K. (2016) · ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences · doi:10.5194/isprs-annals-iii-3-177-2016 · Cited by 371
A Recursive Partitioning Decision Rule for Nonparametric Classification
Friedman (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674849 · Cited by 368
Heo, J.-P., Lee, Y., He, J., Chang, S.-F., & Yoon, S.-E. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6248024 · Cited by 362
Models for early prediction of at-risk students in a course using standards-based grading
Marbouti, F., Diefes-Dux, H. A., & Madhavan, K. (2016) · Computers & Education · doi:10.1016/j.compedu.2016.09.005 · Cited by 360
Computing the Lyapunov spectrum of a dynamical system from an observed time series
Brown, R., Bryant, P., & Abarbanel, H. D. I. (1991) · Physical Review A · doi:10.1103/physreva.43.2787 · Cited by 355
Routing in Socially Selfish Delay Tolerant Networks
Li, Q., Zhu, S., & Cao, G. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462138 · Cited by 351
Ogutu, J. O., Piepho, H.-P., Said, M. Y., Ojwang, G. O., Njino, L. W., Kifugo, S. C., & Wargute, P. W. (2016) · PLOS ONE · doi:10.1371/journal.pone.0163249 · Cited by 350
Two algorithms for nearest-neighbor search in high dimensions
Kleinberg, J. M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258653 · Cited by 348
Matching 2.5D face scans to 3D models
Lu, X., Jain, A. K., & Colbry, D. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.15 · Cited by 339
Kernelized Locality-Sensitive Hashing
Kulis, B., & Grauman, K. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.219 · Cited by 331
Variable Resolution Discretization in Optimal Control
Munos, R., & Moore, A. (2002) · Machine Learning · doi:10.1023/a:1017992615625 · Cited by 321
Computational methods for local regression
Cleveland, W. S., & Grosse, E. (1991) · Statistics and Computing · doi:10.1007/bf01890836 · Cited by 319
Slicing: A New Approach for Privacy Preserving Data Publishing
Li, T., Li, N., Zhang, J., & Molloy, I. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.236 · Cited by 312
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 311
Hand PointNet: 3D Hand Pose Estimation Using Point Sets
Ge, L., Cai, Y., Weng, J., & Yuan, J. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00878 · Cited by 311
Approximated and User Steerable tSNE for Progressive Visual Analytics
Pezzotti, N., Lelieveldt, B. P. F., Maaten, L. V. D., Hollt, T., Eisemann, E., & Vilanova, A. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2016.2570755 · Cited by 308
Atkeson, C. G., Moore, A. W., & Schaal, S. (1997) · Lazy Learning · doi:10.1007/978-94-017-2053-3_2 · Cited by 308
Visualizing Large-scale and High-dimensional Data
Tang, J., Liu, J., Zhang, M., & Mei, Q. (2016) · Proceedings of the 25th International Conference on World Wide Web · doi:10.1145/2872427.2883041 · Cited by 306
Approximate nearest neighbor queries in fixed dimensions
Arya, S., & Mount, D. M. (1993) · doi:10.5555/313559.313768 · Cited by 303
ImageRover: a content-based image browser for the World Wide Web
Sclaroff, S., Taycher, L., & La Cascia, M. (1997) · 1997 Proceedings IEEE Workshop on Content-Based Access of Image and Video Libraries · doi:10.1109/ivl.1997.629714 · Cited by 300
Independent quantization: an index compression technique for high-dimensional data spaces
Berchtold, S., Bohm, C., Jagadish, H. V., Kriegel, H.-P., & Sander, J. (2002) · Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073) · doi:10.1109/icde.2000.839456 · Cited by 291
Analysis of human faces using a measurement-based skin reflectance model
Weyrich, T., Matusik, W., Pfister, H., Bickel, B., Donner, C., Tu, C., McAndless, J., Lee, J., Ngan, A., Jensen, H. W., et al. (2006) · ACM Transactions on Graphics · doi:10.1145/1141911.1141987 · Cited by 291
Computational Geometry—A Survey
Lee, & Preparata (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676388 · Cited by 283
A comprehensive review of current local features for computer vision
Li, J., & Allinson, N. M. (2008) · Neurocomputing · doi:10.1016/j.neucom.2007.11.032 · Cited by 280
Fast image search for learned metrics
Jain, P., Kulis, B., & Grauman, K. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587841 · Cited by 279
Spectral Methods for Dimensionality Reduction
Saul, L. K., Weinberger, K. Q., Sha, F., Ham, J., & Lee, D. D. (2006) · Semi-Supervised Learning · doi:10.7551/mitpress/6173.003.0022 · Cited by 272
Metadata
- Authors
- Friedman, J. H., Bentley, J. L., & Finkel, R. A.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 1977-09
- Volume
- 3
- Issue
- 3
- Pages
- 209-226
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2024668293
- Cited by
- 2,813
- References
- 10
- FWCI
- 9.38
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.