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 201–300 of 1,008
Information Retrieval: Recent Advances and Beyond
Hambarde, K., & Proença, H. P. M. C. (2023) · IEEE Access · doi:10.1109/access.2023.3295776 · Cited by 212
Low-Dimensional Models for Dimensionality Reduction and Signal Recovery: A Geometric Perspective
Baraniuk, R. G., Cevher, V., & Wakin, M. B. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2038076 · Cited by 175
Max-Margin Object DetectionPreprint
King, D. E. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.00046 · Cited by 175
Detecting code clones in binary executables
Sæbjørnsen, A., Willcock, J. J., Panas, T., Quinlan, D. J., & Su, Z. (2009) · ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) · doi:10.1145/1572272.1572287 · Cited by 174
Li, P., & König, C. (2010) · International World Wide Web Conference (WWW) · doi:10.1145/1772690.1772759 · Cited by 173
Capturing sequence diversity in metagenomes with comprehensive and scalable probe design
Metsky, H. C., Siddle, K. J., Gladden, A. D., Qu, J., Yang, D. K., Brehio, P., Goldfarb, A., Piantadosi, A. L., Wohl, S., Carter, A., et al. (2019) · Nature Biotechnology · doi:10.1038/s41587-018-0006-x · Cited by 172
Analysis of approximate nearest neighbor searching with clustered point sets
Maneewongvatana, S., & Mount, D. M. (2002) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/059/06 · Cited by 171
Revisiting kd-tree for Nearest Neighbor Search
Ram, P., & Sinha, K. (2019) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3292500.3330875 · Cited by 171
Semantic similarity between search engine queries using temporal correlation
Chien, S., & Immorlica, N. (2005) · International World Wide Web Conference (WWW) · doi:10.1145/1060745.1060752 · Cited by 170
Unsupervised Semantic-Preserving Adversarial Hashing for Image Search
Deng, C. D., Yang, E., Liu, T., Li, J., Liu, W., & Tao, D. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2903661 · Cited by 169
Chi, L., & Xingquan Zhu, A. (2017) · ACM Computing Surveys · doi:10.1145/3047307 · Cited by 168
Korman, S., & Avidan, S. (2011) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2011.6126421 · Cited by 167
Fast and Accurate Image Matching with Cascade Hashing for 3D Reconstruction
Cheng, J., Leng, C., Wu, J., Cui, H., & Lu, H. (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.8 · Cited by 165
The string edit distance matching problem with moves
Cormode, G., & Muthukrishnan, S. (2007) · ACM Transactions on Algorithms · doi:10.1145/1186810.1186812 · Cited by 165
Finding motifs using random projections
Buhler, J. D., & Tompa, M. (2001) · doi:10.1145/369133.369172 · Cited by 165
Fast Exact Search in Hamming Space With Multi-Index Hashing
Norouzi, M., Punjani, A., & Fleet, D. J. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.231 · Cited by 164
Complementary hashing for approximate nearest neighbor search
Xu, H., Wang, J., Zhu Li, B., Zeng, G., Li, S., & Yu, N. (2011) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2011.6126424 · Cited by 164
Speeding up the Xbox recommender system using a euclidean transformation for inner-product spaces
Bachrach, Y., Finkelstein, Y., Gilad-Bachrach, R., Katzir, L., Koenigstein, N., Nice, N., & Paquet, U. (2014) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2645710.2645741 · Cited by 163
Privacy-Preserving Record Linkage for Big Data: Current Approaches and Research Challenges
Vatsalan, D., Sehili, Z., Christen, P., & Rahm, E. (2017) · Springer eBooks · doi:10.1007/978-3-319-49340-4_25 · Cited by 170
An Adaptive Mean-Shift Framework for MRI Brain Segmentation
Mayer, A., & Greenspan, H. K. (2009) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2009.2013850 · Cited by 162
Yu, X., Hughes, C. J., Satish, N., & Devadas, S. (2015) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/2830772.2830807 · Cited by 162
A deep neural network based multi-task learning approach to hate speech detection
Kapil, P., & Ekbal, A. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2020.106458 · Cited by 166
Levenshtein Distance, Sequence Comparison and Biological Database Search
Berger, B., Waterman, M. S., & Yu, Y. W. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2996543 · Cited by 174
Uncovering the functional diversity of rare CRISPR-Cas systems with deep terascale clustering
Altae-Tran, H., Kannan, S., Suberski, A. J., Mears, K. S., Demircioglu, F. E., Moeller, L., Kocalar, S., Oshiro, R., Makarova, K. S., Macrae, R. K., et al. (2023) · Science · doi:10.1126/science.adi1910 · Cited by 167
Weakly-supervised hashing in kernel space
Mu, Y., Shen, J., & Yan, S. (2010) · 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.2010.5540024 · Cited by 157
Metwally, A., & Faloutsos, C. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2212351.2212353 · Cited by 156
Theobald, M., Siddharth, J., & Paepcke, A. (2008) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1390334.1390431 · Cited by 155
Learning to Navigate the Energy Landscape
Valentin, J., Dai, A., Nießner, M., Kohli, P., Torr, P. H. S., Izadi, S., & Keskin, C. (2016) · International Conference on 3D Vision (3DV) · doi:10.1109/3dv.2016.41 · Cited by 155
SSDH: Semi-Supervised Deep Hashing for Large Scale Image Retrieval
Zhang, J., & Peng, Y. (2017) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2017.2771332 · Cited by 155
Anomaly Detection Using Program Control Flow Graph Mining From Execution Logs
Nandi, A., Mandal, A., Atreja, S., Dasgupta, G. B., & Bhattacharya, S. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939712 · Cited by 154
Tamersoy, A., Roundy, K., & Chau, D. H. (2014) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623342 · Cited by 154
Learning to Break Deep Perceptual Hashing: The Use Case NeuralHash
Struppek, L., Hintersdorf, D., Neider, D., & Kersting, K. (2022) · 2022 ACM Conference on Fairness Accountability and Transparency · doi:10.1145/3531146.3533073 · Cited by 153
Computer Vision for Music Identification
Yan, K., Hoiem, D., & Sukthankar, R. (2005) · 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.2005.105 · Cited by 153
Max-margin additive classifiers for detection
Maji, S., & Berg, A. C. (2009) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2009.5459203 · Cited by 160
Karimi, D., Nir, G., Fazli, L., Black, P. C., Goldenberg, L., & Salcudean, S. E. (2019) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2019.2944643 · Cited by 160
Zhu, E., Nargesian, F., Pu, K. Q., & Miller, R. J. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/2994509.2994534 · Cited by 151
Scalable similarity search with optimized kernel hashing
He, J., Liu, W., & Chang, S. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835946 · Cited by 150
A Survey of Text-to-SQL in the Era of LLMs: Where Are We, and Where Are We Going?
Liu, X., Shen, S., Li, B., Ma, P., Jiang, R., Zhang, Y., Fan, J., Li, G., Tang, N., & Luo, Y. (2025) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2025.3592032 · Cited by 257
Shape contexts enable efficient retrieval of similar shapes
Mori, G., Belongie, S., & Malik, J. (2005) · 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.2001.990547 · Cited by 152
Li, Y. (2012) · Forensic Science International · doi:10.1016/j.forsciint.2012.10.031 · Cited by 150
Multidimensional adaptive sampling and reconstruction for ray tracing
Hachisuka, T., Jarosz, W., Weistroffer, R. P., Dale, K. M., Humphreys, G., Zwicker, M., & Jensen, H. W. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360632 · Cited by 149
A Deep Learning Approach to Link Prediction in Dynamic Networks
Li, X., Du, N., Li, H., Li, K., Gao, J., & Zhang, A. (2014) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611973440.33 · Cited by 149
Kleyko, D. V., Rachkovskij, D. A., Osipov, E., & Rahimi, A. (2022) · ACM Computing Surveys · doi:10.1145/3538531 · Cited by 195
Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval
Wu, G., Han, J., Guo, Y., Liu, L., Ding, G., Ni, Q., & Shao, L. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2882155 · Cited by 148
Scalable Techniques for Clustering the Web.
Haveliwala, T. H., Gionis, A., & Indyk, P. (2000) · Cited by 148
Self-citationLatent Semantic Minimal Hashing for Image Retrieval
Lu, X., Zheng, X., & Li, X. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2627801 · Cited by 148
Sun, Y., Wang, W., Qin, J., Zhang, Y., & Lin, X. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2735461.2735462 · Cited by 148
Maximum inner-product search using cone trees
Ram, P., & Gray, A. (2012) · Cited by 147
A replacement for Voronoi diagrams of near linear size
Har-Peled, S. (2001) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959884 · Cited by 147
Compressed Sensing With Cross Validation
Ward, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2032712 · Cited by 146
Hashing-Based Scalable Remote Sensing Image Search and Retrieval in Large Archives
Demir, B., & Bruzzone, L. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2015.2469138 · Cited by 146
Bayesian locality sensitive hashing for fast similarity search
Satuluri, V., & Parthasarathy, S. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2140436.2140440 · Cited by 144
Wei, C., Wu, B., Wang, S., Lou, R., Zhan, C., Li, F., & Cai, Y. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3415478.3415541 · Cited by 144
Dasgupta, A., Kumar, R., & Sarlós, T. (2010) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1806689.1806737 · Cited by 143
The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy
Blocki, J., Blum, A. L., Datta, A., & Sheffet, O. (2012) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2012.67 · Cited by 160
Meta-Path Guided Embedding for Similarity Search in Large-Scale Heterogeneous Information NetworksPreprint
Shang, J., Qu, M., Liu, J., Kaplan, L., Han, J., & Peng, J. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.09769 · Cited by 142
Kumar, R., Satyanarayan, A., Torres, C., Lim, M., Ahmad, S., Klemmer, S., & Talton, J. O. (2013) · CHI Conference on Human Factors in Computing Systems · doi:10.1145/2470654.2466420 · Cited by 141
Efficient spoken term discovery using randomized algorithms
Jansen, A., & Durme, B. V. (2011) · IEEE Workshop on Automatic Speech Recognition and Understanding (ASRU) · doi:10.1109/asru.2011.6163965 · Cited by 141
Fast locality-sensitive hashing
Dasgupta, A., Kumar, R., & Sarlós, T. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020578 · Cited by 141
Neural Networks for Entity Matching: A Survey
Barlaug, N., & Gulla, J. A. (2021) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3442200 · Cited by 159
Modeling LSH for performance tuning
Dong, W., Wang, Z., Josephson, W. K., Charikar, M., & Li, K. (2008) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1458082.1458172 · Cited by 140
Machine Knowledge: Creation and Curation of Comprehensive Knowledge Bases
Weikum, G., Dong, X. L., Razniewski, S., & Suchanek, F. M. (2021) · Foundations and Trends in Databases · doi:10.1561/1900000064 · Cited by 161
A Survey on Privacy in Social Media
Beigi, G., & Liu, H. (2020) · ACM/IMS Transactions on Data Science · doi:10.1145/3343038 · Cited by 153
Slow Down to Go Better: A Survey on Slow Feature Analysis
Song, P., & Zhao, C. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3201621 · Cited by 141
Ciaccia, P., & Patella, M. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2000.839417 · Cited by 138
Clustering for approximate similarity search in high-dimensional spaces
Li, C., Chang, E., García-Molina, H., & Wiederhold, G. C. M. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1019214 · Cited by 138
Searchable Symmetric Encryption
Poh, G. S., Chin, J., Yau, W., Choo, K. R., & Mohamad, M. S. (2017) · ACM Computing Surveys · doi:10.1145/3064005 · Cited by 136
Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings
Ren, H., Hu, W., & Leskovec, J. (2020) · arXiv · doi:10.48550/arxiv.2002.05969 · Cited by 135
Jiang, P., Winkley, J., Zhao, C. H., Munnoch, R., Min, G., & Yang, L. (2014) · IEEE Systems Journal · doi:10.1109/jsyst.2014.2308324 · Cited by 135
Detection of false data attacks in smart grid with supervised learning
Yan, J., Tang, B., & He, H. (2016) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2016.7727361 · Cited by 135
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
Laarhoven, T. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47989-6_1 · Cited by 134
Targeting Prospective Customers: Robustness of Machine-Learning Methods to Typical Data Challenges
Simester, D., Timoshenko, A., & Zoumpoulis, S. I. (2020) · Management Science · doi:10.1287/mnsc.2019.3308 · Cited by 133
Query Recommendations for Interactive Database Exploration
Chatzopoulou, G., Eirinaki, M., & Polyzotis, N. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02279-1_2 · Cited by 133
Dataset Discovery in Data Lakes
Bogatu, A., Fernandes, A. A. A., Paton, N. W., & Κωνσταντίνου, Ν. (2020) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde48307.2020.00067 · Cited by 133
Deep Polarized Network for Supervised Learning of Accurate Binary Hashing Codes
Fan, L., Ng, K. W., Ju, C., Zhang, T., & Chan, C. S. (2020) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2020/115 · Cited by 133
Syriopoulos, P. K., Kalampalikis, N. G., Kotsiantis, S. B., & Vrahatis, M. N. (2023) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-023-09882-x · Cited by 133
On the impossibility of dimension reduction in l 1
Brinkman, B., & Charikar, M. (2005) · Journal of the ACM · doi:10.1145/1089023.1089026 · Cited by 132
Scalable Active Learning for Multiclass Image Classification
Joshi, A. J., Porikli, F., & Papanikolopoulos, N. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.21 · Cited by 131
Semantic Models for the First-Stage Retrieval: A Comprehensive Review
Guo, J., Cai, Y., Fan, Y., Sun, F., Zhang, R., & Cheng, X. (2022) · ACM Transactions on Information Systems · doi:10.1145/3486250 · Cited by 153
Low-Distortion Embeddings of Finite Metric Spaces
Indyk, P., & Matoušek, J. (2004) · doi:10.1201/9781315119601-8 · Cited by 129
Self-citationWhat Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Kumar, N., Zhang, L., & Nayar, S. K. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88688-4_27 · Cited by 129
Leng, C., Wu, J., Cheng, J., Bai, X. P., & Lu, H. (2015) · 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.2015.7298865 · Cited by 128
Is the k -NN classifier in high dimensions affected by the curse of dimensionality?
Pestov, V. (2012) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2012.09.011 · Cited by 128
On the Performance of Clustering in Hilbert Spaces
Gérard Biau, A., Devroye, L., & Lugosi, G. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913516 · Cited by 128
Liu, X., He, J., Deng, C. D., & Lang, B. (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.275 · Cited by 128
Communication complexity of document exchange
Cormode, G., Paterson, M. S., Şahinalp, S. C., & Vishkin, U. (2026) · Symposium on Discrete Algorithms · doi:10.82444/warw.33642076 · Cited by 128
ENN: Extended Nearest Neighbor Method for Pattern Recognition [Research Frontier]
Tang, B., & He, H. (2015) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2015.2437512 · Cited by 128
Nearest-neighbor-preserving embeddings
Indyk, P., & Naor, A. (2007) · ACM Transactions on Algorithms · doi:10.1145/1273340.1273347 · Cited by 127
Self-citationDeep Hashing for Scalable Image Search
Lu, J., Liong, V. E., & Zhou, J. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2678163 · Cited by 130
Deep Semantic Multimodal Hashing Network for Scalable Image-Text and Video-Text Retrievals
Jin, L., Li, Z., & Tang, J. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2997020 · Cited by 128
Grauman, K., & Leibe, B. (2011) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.2200/s00332ed1v01y201103aim011 · Cited by 126
Data-driven suggestions for creativity support in 3D modeling
Chaudhuri, S., & Koltun, V. (2010) · ACM SIGGRAPH Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia (SIGGRAPH Asia) · doi:10.1145/1866158.1866205 · Cited by 125
Static malware detection and attribution in android byte-code through an end-to-end deep system
Amin, M., Tanveer, T. A., Tehseen, M., Khan, M., Khan, F. A., & Anwar, S. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.07.070 · Cited by 126
Proximity-preserving labeling schemes
Peleg, D. (2000) · Journal of Graph Theory · doi:10.1002/(sici)1097-0118(200003)33:3 · Cited by 125
Acceleration of randomized Kaczmarz method via the Johnson–Lindenstrauss Lemma
Eldar, Y. C., & Needell, D. M. (2011) · Numerical Algorithms · doi:10.1007/s11075-011-9451-z · Cited by 123
Efficient and accurate nearest neighbor and closest pair search in high-dimensional space
Tao, Y., Yi, K., Sheng, C., & Kalnis, P. (2010) · ACM Transactions on Database Systems · doi:10.1145/1806907.1806912 · Cited by 123
Kernels as features: On kernels, margins, and low-dimensional mappings
Balcan, M.-F., Blum, A. L., & Vempala, S. (2006) · Machine Learning · doi:10.1007/s10994-006-7550-1 · Cited by 124
Large-Scale Discovery of Spatially Related Images
Chum, O., & Matas, J. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.166 · Cited by 122
Deep Hash Learning for Remote Sensing Image Retrieval
Liu, C., Ma, J., Tang, X., Liu, F., Zhang, X., & Jiao, L. (2020) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2020.3007533 · Cited by 125
Qiu, S., & Lane, T. D. R. (2009) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2008.139 · Cited by 121
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
