The DOI matches its Crossref record; 74 of the 76 references it cites were found in a registry or an index.
Approximate nearest neighbors: towards removing the curse of dimensionality
Abstract
Article Free Access Share on Approximate nearest neighbors: towards removing the curse of dimensionality Authors: Piotr Indyk Department of Computer Science, Stanford University, Stanford, CA Department of Computer Science, Stanford University, Stanford, CAView Profile , Rajeev Motwani Department of Computer Science, Stanford University, Stanford, CA Department of Computer Science, Stanford University, Stanford, CAView Profile Authors Info & Claims STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computingMay 1998 Pages 604–613https://doi.org/10.1145/276698.276876Online:23 May 1998Publication History 2,363citation11,545DownloadsMetricsTotal Citations2,363Total Downloads11,545Last 12 Months769Last 6 weeks97 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
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
“However, SSTH suffers from serious efficiency issue due to the involvement of de-binarization and de-LSTM.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“Given six query videos of different topics, the proposed algorithm makes fewer mistakes in retrieving the similar videos for each query compared with SSTH.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“SSTH [29] / / 8.21h / / 8.23h / / 8.48h / / 8.55h”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“For example, the precision@100 at 64 bits reaches 26.1% under the proposed framework and the difference over SSTH (20.4%) is 5.7%.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“For examples, the mAP@5 values at the code length of 128 are 59.3% and 57.1% for UDVH-TSN and UDVH-LSTM on FCVID, which are at least 7% higher than that in SSTH (50.1%).”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“Moreover, the UDVH-based methods substantially yield better retrieval performance over SSTH, which is consistent with the results reported in Fig. 5 and further demonstrates the superiority of our self-taught training strategy involving clustering and balanced rotation.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“Considering the deep architectures usually converge within t = 5 loops for the UDVH-based methods, the total training cost is less than 4.5 hours, which is much shorter than training SSTH (over 8 hours), thus indicating the high efficiency of the proposed hashing framework.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“The most time-consuming parts of SSTH include the backpropagation of Binary LSTM units when updating their binary outputs and the complex network structures [29], which are not adopted in our algorithm.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“Specifically, as shown in Fig. 9(a), the mAP@5 values at 128 bits on FCVID are 50.1% and 57.1% for SSTH and UDVH-LSTM, which are over 15% higher than the values achieved when using CNN features.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
Citations
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,621
Rayward-Smith, V. J., Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1991) · Journal of the Operational Research Society · doi:10.2307/2583667 · Cited by 16,958
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 9,743
Analysis of a complex of statistical variables into principal components.
Hotelling, H. (1933) · Journal of Educational Psychology · doi:10.1037/h0071325 · Cited by 9,691
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,498
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,055
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,098
Self-citationPattern classification and scene analysis
Chien, Y. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100577 · Cited by 3,421
Flagged first, then by citations
2 of the 76 references couldn’t be matched to a known paper.
Cited by
Sorted by citations
Items 601–700 of 1,008
Efficient Large-Scale Approximate Nearest Neighbor Search on the GPU
Wieschollek, P., Wang, O., Sorkine‐Hornung, A., & Lensch, H. P. A. (2016) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2016.223 · Cited by 55
Li, T., Wu, H., & Wang, M. D. (2020) · Methods · doi:10.1016/j.ymeth.2020.07.008 · Cited by 55
Lower bounds on locality sensitive hashing
Motwani, R., Naor, A., & Panigrahi, R. (2006) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1137856.1137881 · Cited by 55
Self-citationTighter bounds for nearest neighbor search and related problems in the cell probe model
Barkol, O., & Rabani, Y. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335350 · Cited by 55
The black-box complexity of nearest-neighbor search
Krauthgamer, R., & Lee, J. R. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.09.017 · Cited by 55
DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node
Subramanya, S. J., Devvrit, F., Simhadri, H. V., Krishnawamy, R., & Kadekodi, R. (2019) · neural information processing systems · Cited by 54
Rapid detection of identity-by-descent tracts for mega-scale datasets
Shemirani, R., Belbin, G. M., Avery, C. L., Kenny, E. E., Gignoux, C. R., & Ambite, J. L. (2021) · Nature Communications · doi:10.1038/s41467-021-22910-w · Cited by 55
Lower Bounds on Near Neighbor Search via Metric Expansion
Panigrahy, R., Talwar, K., & Wieder, U. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.82 · Cited by 54
Error-Tolerant Searchable Encryption
Bringer, J., Chabanne, H., & Kindarji, B. (2009) · International Conference on Communications · doi:10.1109/icc.2009.5199004 · Cited by 54
Local Distance Functions: A Taxonomy, New Algorithms, and an Evaluation
Ramanan, D., & Baker, S. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.127 · Cited by 55
Parallel search of k-nearest neighbors with synchronous operations
Sismanis, N., Pitsianis, N. P., & Sun, X. (2012) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2012.6408667 · Cited by 54
Engineering a direct k-way Hypergraph Partitioning Algorithm
Akhremtsev, Y., Heuer, T., Sanders, P., & Schlag, S. (2017) · Workshop on Algorithm Engineering and Experiments (ALENEX) · doi:10.1137/1.9781611974768.3 · Cited by 54
A Revisit of Hashing Algorithms for Approximate Nearest Neighbor Search
Cai, D. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2953897 · Cited by 54
Fast nearest neighbor search through sparse random projections and voting
Hyvönen, V., Pitkanen, T., Tasoulis, S. K., Jääsaari, E., Tuomainen, R. O. O., Wang, L., Corander, J., & Roos, T. (2016) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2016.7840682 · Cited by 54
Adaptive Local Embedding Learning for Semi-Supervised Dimensionality Reduction
Nie, F., Wang, Z., Wang, R., & Li, X. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3049371 · Cited by 54
Polynomial-time approximation schemes for geometric min-sum median clustering
Ostrovsky, R., & Rabani, Y. (2002) · Journal of the ACM · doi:10.1145/506147.506149 · Cited by 54
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
Thorup, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48224-5_21 · Cited by 54
Zhang, J., Tao, J., Hu, Y., & Ma, L. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3327105 · Cited by 53
A variant of the Johnson–Lindenstrauss lemma for circulant matrices
Vybíral, J. (2010) · Journal of Functional Analysis · doi:10.1016/j.jfa.2010.11.014 · Cited by 53
Scaling distributional similarity to large corpora
Gorman, J., & Curran, J. R. (2006) · International Conference on Computational Linguistics · doi:10.3115/1220175.1220221 · Cited by 53
Derandomized Dimensionality Reduction with Applications
Engebretsen, L., Indyk, P., & O’Donnell, R. (2001) · Cited by 53
Self-citationA lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
Chakrabarti, A., Chazelle, B., Gum, B., & Lvov, A. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301325 · Cited by 53
Fast Mining of Distance-Based Outliers in High-Dimensional Datasets
Ghoting, A., Parthasarathy, S., & Otey, M. E. (2006) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972764.70 · Cited by 53
Improved asymmetric locality sensitive hashing (ALSH) for Maximum Inner Product Search (MIPS)Preprint
Shrivastava, A., & Li, P. (2015) · Cited by 53
The AIMe registry for artificial intelligence in biomedical research
Matschinske, J., Alcaraz, N., Benis, A., Golebiewski, M., Grimm, D. G., Heumos, L., Kacprowski, T., Lazareva, O., List, M., Louadi, Z., et al. (2021) · Nature Methods · doi:10.1038/s41592-021-01241-0 · Cited by 54
Ortega, J. L. G., Han, L., Whittacker, N., & Bowring, N. J. (2015) · Science and Information Conference · doi:10.1109/sai.2015.7237185 · Cited by 52
Nearest Neighbor based Greedy Coordinate Descent
Dhillon, I. S., Ravikumar, P., & Tewari, A. (2011) · Cited by 52
Computational biology in the 21st century
Berger, B., Daniels, N. M., & Yu, Y. W. (2016) · Communications of the ACM · doi:10.1145/2957324 · Cited by 59
Tetef, S., Govind, N., & Seidler, G. T. (2021) · Physical Chemistry Chemical Physics · doi:10.1039/d1cp02903g · Cited by 56
Meta-class features for large-scale object categorization on a budget
Bergamo, A., & Torresani, L. (2012) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2012.6248040 · Cited by 52
Dataset Discovery and Exploration: A Survey
Paton, N. W., Chen, J., & Wu, Z. (2023) · ACM Computing Surveys · doi:10.1145/3626521 · Cited by 51
Application of Information Retrieval Techniques for Source Code Authorship Attribution
Burrows, S., Uitdenbogerd, A. L., & Turpin, A. H. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00887-0_61 · Cited by 51
Rank-Based Similarity Search: Reducing the Dimensional Dependence
Houle, M. E., & Nett, M. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2343223 · Cited by 55
Lower Bounds on Locality Sensitive Hashing
Motwani, R., Naor, A., & Panigrahy, R. (2007) · SIAM Journal on Discrete Mathematics · doi:10.1137/050646858 · Cited by 51
Self-citationEfficiently matching sets of features with random histograms
Dong, W., Wang, Z., Charikar, M., & Li, K. (2008) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/1459359.1459384 · Cited by 51
Mashrgy, M. A., Bdiri, T., & Bouguila, N. (2014) · Knowledge-Based Systems · doi:10.1016/j.knosys.2014.01.007 · Cited by 51
A distance based clustering method for arbitrary shaped clusters in large datasets
Patra, B. K., Nandi, S., & Pulabaigari, V. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2011.04.027 · Cited by 51
Use of permutation prefixes for efficient and scalable approximate similarity search
Esuli, A. (2011) · Information Processing & Management · doi:10.1016/j.ipm.2010.11.011 · Cited by 51
Li, F., Yao, B., & Kumar, P. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.181 · Cited by 51
Park, J. Y., Yap, H. L., Rozell, C. J., & Wakin, M. B. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2166546 · Cited by 51
Korman, S., & Avidan, S. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2477814 · Cited by 51
Breast Histopathological Image Retrieval Based on Latent Dirichlet Allocation
Ma, Y., Jiang, Z., Zhang, H., Xie, F., Zheng, Y., Shi, H., & Zhao, Y. (2016) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2016.2611615 · Cited by 52
Chen, J., He, K., Deng, L., Yuan, Q., Du, R., Xiang, Y., & Wu, J. (2017) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2017.2765323 · Cited by 51
Implementing Randomized Matrix Algorithms in Parallel and Distributed Environments
Yang, J., Meng, X., & Mahoney, M. W. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2494219 · Cited by 51
A Review for Weighted MinHash Algorithms
Wu, W., Li, B., Chen, L., Gao, J., & Zhang, C. (2020) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3021067 · Cited by 51
Nonlinear Estimators and Tail Bounds for Dimension Reduction in l 1 Using Cauchy Random Projections
Li, P., Hastie, T. J., & Church, K. (2007) · Springer eBooks · doi:10.1007/978-3-540-72927-3_37 · Cited by 51
Space-efficient approximate Voronoi diagrams
Arya, S., Malamatos, T., & Mount, D. M. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.510011 · Cited by 51
The GC-tree: a high-dimensional index structure for similarity search in image databases
Cha, G.-H., & Chung, C. (2002) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2002.1017736 · Cited by 51
Efficient Second Order Online Learning by SketchingPreprint
Luo, H., Agarwal, A., Cesa‐Bianchi, N., & Langford, J. C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.02202 · Cited by 51
µtune: auto-tuned threading for OLDI microservices
Sriraman, A., & Wenisch, T. F. (2018) · Operating Systems Design and Implementation · doi:10.5555/3291168.3291182 · Cited by 50
Scaling up top-K cosine similarity search
Zhu, S., Wu, J., Xiong, H., & Xia, G. (2010) · Data & Knowledge Engineering · doi:10.1016/j.datak.2010.08.004 · Cited by 51
Cluster-based delta compression of a collection of files
Ouyang, Z., Memon, N. D., Suel, T., & Trendafilov, D. (2003) · International Conference on Web Information Systems Engineering (WISE) · doi:10.1109/wise.2002.1181662 · Cited by 50
Distance Encoded Product Quantization
Heo, J., Lin, Z., & Yoon, S. (2014) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2014.274 · Cited by 50
Fingerprint indexing based on minutiae pairs and convex core point
Khodadoust, J., & Khodadoust, A. M. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.01.022 · Cited by 50
A Fast Nearest Neighbor Search Scheme Over Outsourced Encrypted Medical Images
Guo, C., Su, S., Choo, K. R., & Tang, X. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2883680 · Cited by 50
Locally Private k-Means Clustering
Stemmer, U. (2019) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975994.33 · Cited by 50
Lv, Q., Josephson, W. K., Wang, Z., Charikar, M., & Li, K. (2006) · European Conference on Computer Systems · doi:10.1145/1217935.1217966 · Cited by 50
High-Dimensional Feature Matching: Employing the Concept of Meaningful Nearest Neighbors
Omerčević, D., Drbohlav, O., & Leonardis, A. (2007) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2007.4408880 · Cited by 50
Off the Beaten Path: Let's Replace Term-Based Retrieval with k-NN Search
Boytsov, L., Novak, D., Malkov, Y., & Nyberg, E. (2016) · Proceedings of the 25th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2983323.2983815 · Cited by 50
Neural ranking models for document retrieval
Trabelsi, M., Chen, Z., Davison, B. D., & Heflin, J. (2021) · Information Retrieval · doi:10.1007/s10791-021-09398-0 · Cited by 56
Using Distributed Reinforcement Learning for Resource Orchestration in a Network Slicing Scenario
Mason, F., Nencioni, G., & Zanella, A. (2022) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2022.3187310 · Cited by 49
SmartEye: Real-time and efficient cloud image sharing for disaster environments
Hua, Y., He, W., Liu, X., & Feng, D. (2015) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2015.7218541 · Cited by 49
Efficient partial-duplicate detection based on sequence matching
Zhang, Q., Zhang, Y., Yu, H., & Huang, X. (2010) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1835449.1835562 · Cited by 49
Asymmetric distances for binary embeddings
Gordo, A., & Perronnin, F. (2011) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2011.5995505 · Cited by 49
A Sketch Algorithm for Estimating Two-Way and Multi-Way Associations
Li, P., & Church, K. (2007) · Computational Linguistics · doi:10.1162/coli.2007.33.3.305 · Cited by 49
Knowledge discovery in clinical decision support systems for pain management: A systematic review
Pombo, N. G. C. C., Araújo, P., & Viana, J. (2013) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2013.11.005 · Cited by 49
Scalable music recommendation by search
Cai, R., Zhang, C., Zhang, L., & Ma, W. (2007) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/1291233.1291466 · Cited by 49
Dubiner, M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2050814 · Cited by 49
Tattoo Image Search at Scale: Joint Detection and Compact Representation Learning
Han, H., Li, J., Jain, A. K., Shan, S., & Chen, X. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2891584 · Cited by 52
Joint Multi-View Hashing for Large-Scale Near-Duplicate Video Retrieval
Nie, X., Jing, W., Cui, C., Zhang, C., Zhu, L., & Yin, Y. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2913383 · Cited by 49
LAM: Locality affine-invariant feature matching
Li, J., Hu, Q., & Ai, M. (2019) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2019.05.006 · Cited by 49
Cottontail DB: An Open Source Database System for Multimedia Retrieval and Analysis
Gasser, R., Rossetto, L., Heller, S., & Schuldt, H. (2020) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/3394171.3414538 · Cited by 49
Fed-LTD: Towards Cross-Platform Ride Hailing via Federated Learning to Dispatch
Wang, Y., Tong, Y., Zhou, Z., Ren, Z., Xu, Y., Wu, G., & Lv, W. (2022) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3534678.3539047 · Cited by 49
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems
Charikar, M., Indyk, P., & Panigrahy, R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45465-9_39 · Cited by 49
Self-citationPrivacy-preserving speech processing: cryptographic and string-matching frameworks show promise
Pathak, M. A., Raj, B., Rane, S. D., & Smaragdis, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2230222 · Cited by 49
Protein sequence classification using feature hashing
Caragea, C., Silvescu, A., & Mitra, P. (2012) · Proteome Science · doi:10.1186/1477-5956-10-s1-s14 · Cited by 49
A novel metric reveals previously unrecognized distortion in the analysis of scRNA-seq dataPreprint
Hamilton, T., Sparta, B., Cooley, S. M., Aragones, S. D., Ray, J. C. J., & Deeds, E. J. (2019) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/689851 · Cited by 53
A survey of mobile crowdsensing and crowdsourcing strategies for smart mobile device users
Ray, A., Chowdhury, C., Bhattacharya, S., & Roy, S. (2022) · CCF Transactions on Pervasive Computing and Interaction · doi:10.1007/s42486-022-00110-9 · Cited by 48
High-Throughput Vector Similarity Search in Knowledge Graphs
Mohoney, J., Pacaci, A., Chowdhury, S. R., Mousavi, A., Ilyas, I. F., Minhas, U. F., Pound, J., & Rekatsinas, T. (2023) · Proceedings of the ACM on Management of Data · doi:10.1145/3589777 · Cited by 48
DB-LSH 2.0: Locality-Sensitive Hashing With Query-Based Dynamic Bucketing
Tian, Y., Zhao, X., & Zhou, X. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2023.3295831 · Cited by 48
Superpixel Graph Label Transfer with Learned Distance Metric
Gould, S. J., Zhao, J., He, X., & Zhang, Y. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10590-1_41 · Cited by 48
Hierarchical Indexing Structure for Efficient Similarity Search in Video Retrieval
Lu, H., Ooi, B. C., Shen, H. T., & Xue, X. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.174 · Cited by 48
Accelerating Nearest Neighbor Search on Manycore Systems
Cayton, L. (2012) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2012.45 · Cited by 48
Extreme Learning Machine and Its Applications in Big Data Processing
Chen, C., Li, K., Duan, M., & Li, K. (2017) · Elsevier eBooks · doi:10.1016/b978-0-12-809393-1.00006-4 · Cited by 48
Semantic-aware top-k spatial keyword queries
Qian, Z., Xu, J., Zheng, K., Zhao, P., & Zhou, X. (2017) · World Wide Web · doi:10.1007/s11280-017-0472-y · Cited by 48
Liong, V. E., Lu, J., & Tan, Y. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2018.02.002 · Cited by 48
I-LSH: I/O Efficient c-Approximate Nearest Neighbor Search in High-Dimensional Space
Liu, W., Wang, H., Zhang, Y., Wang, W., & Qin, L. (2019) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2019.00169 · Cited by 48
Fluency and rule breaking behaviour in the frontal cortex
Cipolotti, L., Molenberghs, P., Domínguez, J. F., Smith, N., Smirni, D., Xu, T., Shallice, T., & Chan, E. (2019) · Neuropsychologia · doi:10.1016/j.neuropsychologia.2019.107308 · Cited by 49
An Efficient Near-Duplicate Video Shot Detection Method Using Shot-Based Interest Points
Zhou, X., Zhou, X., Chen, L., Bouguettaya, A., Xiao, N., & Taylor, J. (2009) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2009.2021794 · Cited by 48
Applying link-based classification to label blogs
Bhagat, S., Rozenbaum, I., & Cormode, G. (2007) · doi:10.1145/1348549.1348560 · Cited by 48
TreeCANN - k-d Tree Coherence Approximate Nearest Neighbor Algorithm
Olonetsky, I., & Avidan, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33765-9_43 · Cited by 47
High-confidence near-duplicate image detection
Dong, W., Wang, Z., Charikar, M., & Li, K. (2012) · International Conference on Multimedia Retrieval · doi:10.1145/2324796.2324798 · Cited by 47
Malkov, Y. A., Ponomarenko, A., Logvinov, A., & Krylov, V. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32153-5_10 · Cited by 47
Clustering Billions of Reads for DNA Data Storage
Rashtchian, C., Makarychev, K., Rácz, M. Z., Ang, S. D., Jevdjic, D., Yekhanin, S., Ceze, L., & Strauß, K. (2017) · neural information processing systems · Cited by 47
When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
Trevisan, L. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539799352735 · Cited by 47
Better algorithms for high-dimensional proximity problems via asymmetric embeddings
Indyk, P. (2003) · Cited by 47
Self-citationThe optimal distance measure for object detection
Mahamud, S., & Hebert, M. (2003) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2003.1211361 · Cited by 47
Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches
Goldstein, J., & Ramakrishnan, R. (2000) · Very Large Data Bases · Cited by 47
On the Difficulty of Nearest Neighbor SearchPreprint
He, J., Kumar, S., & Chang, S. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.6411 · Cited by 47
Distilling Knowledge by Mimicking Features
Wang, G., Ge, Y., & Wu, J. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3103973 · Cited by 46
Metadata
- Authors
- Indyk, P., & Motwani, R.
- Affiliations
- Stanford University (US)
- ORCID
- Indyk, Piotr
- Venue
- Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98
- Publisher
- ACM Press
- Published
- 1998
- Pages
- 604-613
- OpenAlex
- W2147717514
- Cited by
- 4,188
- References
- 76
- Citations by year
- 2026: 152 · 2025: 162 · 2024: 164 · 2023: 133 · 2022: 160 · 2021: 223 · 2020: 245 · 2019: 250 · 2018: 249 · 2017: 251 · 2016: 277 · 2015: 280 · 2014: 260 · 2013: 224 · 2012: 208
- FWCI
- 23.46
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM Symposium on Theory of Computing (STOC) (publishedVersion)
- Funders
- National Science Foundation
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- Physical Sciences › Computer Science › Information Systems › Data Management and Algorithms
- Keywords
- approximate nearest neighbor search, curse of dimensionality, nearest neighbor search, metric spaces, metric embeddings, randomized algorithms
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