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 801–900 of 1,008
A faster algorithm for solving general LPs
Jiang, S., Song, Z., Weinstein, O., & Zhang, H. (2021) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3406325.3451058 · Cited by 39
Object Recognition for the Internet of Things
Quack, T., Bay, H., & Gool, L. V. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78731-0_15 · Cited by 39
Two-dimensional random projection
Eftekhari, A., Babaie‐Zadeh, M., & Moghaddam, H. A. (2011) · Signal Processing · doi:10.1016/j.sigpro.2011.01.002 · Cited by 39
Distributed Graph Summarization
Liu, X., Tian, Y., He, Q., Lee, W.-C., & McPherson, J. (2014) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2661829.2661862 · Cited by 39
Efficient and secure encrypted image search in mobile cloud computing
Zou, Q., Wang, J., Ye, J., Shen, J., & Chen, X. (2016) · Soft Computing · doi:10.1007/s00500-016-2153-7 · Cited by 39
Finding near neighbors through cluster pruning
Chierichetti, F., Panconesi, A., Raghavan, P., Sozio, M., Tiberi, A., & Upfal, E. (2007) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1265530.1265545 · Cited by 39
Detecting protein sequence conservation via metric embeddings
Halperin, E., Buhler, J. D., Karp, R. M., Krauthgamer, R., & Westover, B. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg1016 · Cited by 39
Indexing raw acoustic features for scalable zero resource search
Jansen, A., & Durme, B. V. (2012) · Interspeech (USB) · doi:10.21437/interspeech.2012-566 · Cited by 39
Leskovec, J., Rajaraman, A., & Ullman, J. D. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139924801.004 · Cited by 39
Norm-Ranging LSH for Maximum Inner Product SearchPreprint
Yan, X., Li, J., Dai, X., Chen, H., & Cheng, J. S.-C. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.08782 · Cited by 39
Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art
Azizi, I., Echihabi, K., & Palpanas, T. (2025) · Proceedings of the ACM on Management of Data · doi:10.1145/3709693 · Cited by 38
SoK: Watermarking for AI-Generated Content
Zhao, X., Gunn, S., Christ, M., Fairoze, J., Fábrega, A., Carlini, N., Garg, S., Hong, S., Nasr, M., Tramèr, F., et al. (2025) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp61157.2025.00178 · Cited by 95
Gao, J., Gou, Y., Xu, Y., Yang, Y., Long, C., & Wong, R. C.-W. (2025) · Proceedings of the ACM on Management of Data · doi:10.1145/3725413 · Cited by 38
On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions
Maneewongvatana, S., & Mount, D. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45545-0_96 · Cited by 38
Gordo, A., Perronnin, F., & Valveny, E. (2012) · Pattern Recognition · doi:10.1016/j.patcog.2012.12.004 · Cited by 38
Co-registration of White Matter Tractographies by Adaptive-Mean-Shift and Gaussian Mixture Modeling
Zvitia, O., Mayer, A., Shadmi, R., Miron, S., & Greenspan, H. K. (2009) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2009.2029097 · Cited by 38
Dense Neighborhoods on Affinity Graph
Liu, H., Yang, X., Latecki, L. J., & Yan, S. (2011) · International Journal of Computer Vision · doi:10.1007/s11263-011-0496-1 · Cited by 38
Towards Fast Niching Evolutionary Algorithms: A Locality Sensitive Hashing-Based Approach
Zhang, Y., Gong, Y., Zhang, H., Gu, T., & Zhang, J. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2604362 · Cited by 38
MinMax Radon Barcodes for Medical Image Retrieval
Tizhoosh, H. R., Zhu, S., Lo, H., Chaudhari, V., & Mehdi, T. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-50835-1_55 · Cited by 38
Modeling Genome Data Using Bidirectional LSTM
Tavakoli, N. (2019) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac.2019.10204 · Cited by 40
A Neural Architecture for Detecting User Confusion in Eye-tracking Data
Sims, S. D., & Conati, C. (2020) · INTERNATIONAL CONFERENCE ON MULTIMODAL INTERACTION · doi:10.1145/3382507.3418828 · Cited by 40
Simulation of Fusion Plasmas: Current Status and Future Direction
Batchelor, D. A., Beck, M., Bécoulet, A., Budny, R. V., Chang, C. S., Diamond, P. H., Dong, J., Fu, G. Y., Fukuyama, A., Hahm, T. S., et al. (2007) · Plasma Science and Technology · doi:10.1088/1009-0630/9/3/13 · Cited by 38
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
Panigrahy, R., Talwar, K., & Wieder, U. (2008) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2008.68 · Cited by 38
A Learning-Based Framework for Robot Peg-Hole-Insertion
Tang, T., Lin, H.-C., & Tomizuka, M. (2015) · ASME Dynamic Systems and Control Conference (DSCC) · doi:10.1115/dscc2015-9703 · Cited by 38
The Computational Hardness of Estimating Edit Distance
Andoni, A., & Krauthgamer, R. (2010) · SIAM Journal on Computing · doi:10.1137/080716530 · Cited by 38
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
Borodin, A., Ostrovsky, R., & Rabani, Y. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301367 · Cited by 38
Ma, L., Hong, H., Meng, F., Wu, Q., & Wu, J. (2023) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2023.3279990 · Cited by 37
Similarity join size estimation using locality sensitive hashing
Lee, H., Ng, R. T., & Shim, K. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/1978665.1978666 · Cited by 37
Viewpoint-aware object detection and continuous pose estimation
Gläsner, D., Galun, M., Alpert, S., Basri, R., & Shakhnarovich, G. (2012) · Image and Vision Computing · doi:10.1016/j.imavis.2012.09.006 · Cited by 37
Embedding edit distance to enable private keyword search
Bringer, J., & Chabanne, H. (2012) · Human-centric Computing and Information Sciences · doi:10.1186/2192-1962-2-2 · Cited by 37
Query-aware locality-sensitive hashing scheme for $$l_p$$ norm
Huang, Q., Feng, J., Fang, Q., Ng, W., & Wang, W. (2017) · The VLDB Journal · doi:10.1007/s00778-017-0472-7 · Cited by 37
Reverse image search for scientific data within and beyond the visible spectrum
Araújo, F. H. D., Silva, R., Medeiros, F. N. S., Parkinson, D., Hexemer, A., Carneiro, C. M., & Ushizima, D. M. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.05.015 · Cited by 40
Unsupervised online detection and prediction of outliers in streams of sensor data
Reunanen, N., Räty, T., Jokinen, J. J., Hoyt, T., & Culler, D. (2019) · International Journal of Data Science and Analytics · doi:10.1007/s41060-019-00191-3 · Cited by 38
Ning, L., & Shen, X. (2019) · International Conference on Supercomputing · doi:10.1145/3330345.3330384 · Cited by 37
A symbol spotting approach in graphical documents by hashing serialized graphs
Dutta, A., Lladós, J., & Pal, U. (2012) · Pattern Recognition · doi:10.1016/j.patcog.2012.10.003 · Cited by 37
Efficient Search in Document Image Collections
Kumar, M. A., Jawahar, C. V., & Manmatha, R. (2007) · Springer eBooks · doi:10.1007/978-3-540-76386-4_55 · Cited by 37
Efficient acoustic index for music retrieval with various degrees of similarity
Yang, C. (2002) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/641007.641125 · Cited by 37
Efficient and tumble similar set retrieval
Gionis, A., Gunopulos, D., & Koudas, N. (2001) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/375663.375689 · Cited by 37
Improved Densification of One Permutation HashingPreprint
Shrivastava, A., & Li, P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.4784 · Cited by 37
Wang, R., & Deng, D. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3424573.3424580 · Cited by 44
FINGER: Fast Inference for Graph-based Approximate Nearest Neighbor Search
Chen, P. H., Chang, W.-C., Jiang, J., Yu, H., Dhillon, I. S., & Hsieh, C. (2023) · International World Wide Web Conference (WWW) · doi:10.1145/3543507.3583318 · Cited by 36
Reciprocal Hash Tables for Nearest Neighbor Search
Liu, X., He, J., & Lang, B. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i1.8582 · Cited by 36
Large-Scale Image Retrieval Based on Compressed Camera Identification
Valsesia, D., Coluccia, G., Bianchi, T., & Magli, E. (2015) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2015.2455417 · Cited by 36
A Hierarchical Framework Using Approximated Local Outlier Factor for Efficient Anomaly Detection
Xu, L., Yeh, Y., Lee, Y., & Li, J. (2013) · Procedia Computer Science · doi:10.1016/j.procs.2013.06.168 · Cited by 36
Solving k-Nearest Neighbor Problem on Multiple Graphics Processors
Kato, K., & Hosino, T. (2010) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid.2010.47 · Cited by 36
Dimensionality Reduction Using Similarity-Induced Embeddings
Passalis, N., & Tefas, A. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2728818 · Cited by 36
Data-Parallel Hashing Techniques for GPU Architectures
Lessley, B. J., & Childs, H. (2019) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2019.2929768 · Cited by 36
Wang, Y., Wu, H., Zhang, H., & Rountev, A. (2018) · IEEE/ACM International Conference on Mobile Software Engineering and Systems (MOBILESoft) · doi:10.1145/3197231.3197248 · Cited by 36
Background music recommendation based on latent factors and moods
Liu, C., & Chen, Y.-C. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.07.001 · Cited by 36
Large-Scale Remote Sensing Image Retrieval Based on Semi-Supervised Adversarial Hashing
Tang, X., Liu, C., Ma, J., Zhang, X., Liu, F., & Jiao, L. (2019) · Remote Sensing · doi:10.3390/rs11172055 · Cited by 37
Location-Aware Service Recommendations With Privacy-Preservation in the Internet of Things
Lin, W., Zhang, X., Qi, L., Li, W., Li, S., Sheng, V. S., & Nepal, . (2020) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2020.2965234 · Cited by 36
Limitations of Autoregressive Models and Their Alternatives
Lin, C., Jaech, A., Li, X., Gormley, M. R., & Eisner, J. M. (2021) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/2021.naacl-main.405 · Cited by 63
Fast approximate similarity search based on degree-reduced neighborhood graphs
Aoyama, K., Saito, K., Sawada, H., & Ueda, N. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020576 · Cited by 38
Robust high performance reinforcement learning through weighted k-nearest neighbors
José Antonio Martín, H., de Lope, J., & Maravall, D. (2010) · Neurocomputing · doi:10.1016/j.neucom.2010.07.027 · Cited by 36
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
Pǎtraşcu, M., & Thorup, M. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.35 · Cited by 36
A uniform projection method for motif discovery in DNA sequences
Raphael, B. J., Liu, L.-T., & Varghese, G. (2004) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2004.14 · Cited by 36
Probabilistic near-duplicate detection using simhash
Sood, S., & Loguinov, D. (2011) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2063576.2063737 · Cited by 36
Local Community Detection in Dynamic Networks
DiTursi, D. J., Ghosh, G., & Bogdanov, P. (2017) · Proceedings · doi:10.1109/icdm.2017.103 · Cited by 36
Hu, W., Fan, Y., Xing, J., Sun, L., Cai, Z., & Maybank, S. J. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2839886 · Cited by 36
Li, Y., Pang, L., Zhao, H., Cao, Z., Liu, E., & Tian, J. (2022) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2022.3144854 · Cited by 36
Co-clustering for Federated Recommender System
He, X., Liu, S., Keung, J., & He, J. (2024) · International World Wide Web Conference (WWW) · doi:10.1145/3589334.3645626 · Cited by 41
Zhang, L., Lu, H., Du, D., & Liu, L. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2509244 · Cited by 35
Foundations of Large-Scale Multimedia Information Management and Retrieval
Chang, E. Y. (2011) · Springer eBooks · doi:10.1007/978-3-642-20429-6 · Cited by 35
Random Projections for Large-Scale Regression
Thanei, G.-A., Heinze‐Deml, C., & Meinshausen, N. (2017) · Contributions to statistics · doi:10.1007/978-3-319-41573-4_3 · Cited by 35
Deep Convolutional Hashing for Low-Dimensional Binary Embedding of Histopathological Images
Sapkota, M., Shi, X., Xing, F., & Yang, L. (2018) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2018.2827703 · Cited by 35
A fast LSH-based similarity search method for multivariate time series
Yu, C., Luo, L., Chan, L. L.-H., Rakthanmanon, T., & Nutanong, S. Y. (2018) · Information Sciences · doi:10.1016/j.ins.2018.10.026 · Cited by 36
Evolution of biosequence search algorithms: a brief survey
Kucherov, G. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz272 · Cited by 36
Sparser Johnson-Lindenstrauss Transforms
Kane, D. M., & Nelson, J. (2012) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973099.94 · Cited by 35
Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search
Wang, Y., Shrivastava, A., Wang, J., & Ryu, J. (2018) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3183713.3196925 · Cited by 39
Chao, K., & Zhang, L. (2008) · Computational biology · doi:10.1007/978-1-84800-320-0 · Cited by 35
Private Approximate Nearest Neighbor Search with Sublinear Communication
Servan-Schreiber, S., Langowski, S., & Devadas, S. (2022) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp46214.2022.9833702 · Cited by 39
Fast Adaptive Similarity Search through Variance-Aware Quantization
Paparrizos, J., Edian, I., Liu, C., Elmore, A. J., & Franklin, M. J. M. (2022) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde53745.2022.00268 · Cited by 35
Extracting Representative Information on Intra-Organizational Blogging Platforms1
Guo, X., Wei, Q., Chen, G., Zhang, J., & Qiao, D. (2017) · MIS Quarterly · doi:10.25300/misq/2017/41.4.05 · Cited by 35
Arrays of (locality-sensitive) Count Estimators (ACE)
Luo, C., & Shrivastava, A. (2018) · International World Wide Web Conference (WWW) · doi:10.1145/3178876.3186056 · Cited by 35
Link and Code: Fast Indexing with Graphs and Compact Regression Codes
Douze, M., Sablayrolles, A., & Jeǵou, H. (2018) · 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.2018.00384 · Cited by 35
Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS)Preprint
Shrivastava, A., & Li, P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.5410 · Cited by 35
International Journal INFORMATION THEORIES & APPLICATIONS
Тимофеев, А. В., Vanhoof, K., Волошин, А. Д., Eremeev, A., Aslanyan, L. H., Kleshchev, A., López, L. F. D. M., Palagin, A. V., Mintchev, M. P., Milani, A., et al. (2009) · Cited by 35
Célisse, A., & Mary‐Huard, T. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1508.04905 · Cited by 35
Spatio-temporal features for robust content-based video copy detection
Willems, G., Tuytelaars, T., & Gool, L. V. (2008) · Multimedia Information Retrieval · doi:10.1145/1460096.1460143 · Cited by 34
Learning to Recommend Related Entities to Search Users
Bi, B., Ma, H., Hsu, B.-J. P., Chu, W., Wang, K., & Cho, J. J. (2015) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2684822.2685304 · Cited by 34
Boosting multi-kernel locality-sensitive hashing for scalable image retrieval
Xia, H., Wu, P., Hoi, S. C. H., & Jin, R. (2012) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2348283.2348294 · Cited by 34
Privacy-preserving speaker verification as password matching
Pathak, M. A., & Raj, B. (2012) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2012.6288262 · Cited by 34
Large Scale Sketch Based Image Retrieval Using Patch Hashing
Bozas, K., & Ebroul Izquierdo, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33179-4_21 · Cited by 34
Iwamura, M., Sato, T., & Kise, K. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.439 · Cited by 34
Polymorphic malware detection using topological feature extraction with data mining
Fraley, J. B., & Figueroa, M. (2016) · IEEE SoutheastCon · doi:10.1109/secon.2016.7506685 · Cited by 34
Distance geometry and data science
Liberti, L. (2020) · Top · doi:10.1007/s11750-020-00563-0 · Cited by 34
Fast Item Ranking under Neural Network based Measures
Tan, S., Zhou, Z., Xu, Z., & Li, P. (2020) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3336191.3371830 · Cited by 34
R2LSH: A Nearest Neighbor Search Scheme Based on Two-dimensional Projected Spaces
Lu, K., & Kudo, M. (2020) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde48307.2020.00095 · Cited by 34
Reinforced Short-Length Hashing
Liu, X., Nie, X., Dai, Q., Huang, Y., Li, L., & Yin, Y. (2020) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2020.3040863 · Cited by 34
kNN Prototyping Schemes for Embedded Human Activity Recognition with Online Learning
Ferreira, P., Cardoso, J. M. P., & Mendes‐Moreira, J. (2020) · Computers · doi:10.3390/computers9040096 · Cited by 35
LOFS: A Lightweight Online File Storage Strategy for Effective Data Deduplication at Network Edge
Cheng, G., Guo, D., Luo, L., Xia, J., & Gu, S. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2021.3133098 · Cited by 34
Use of Machine Learning for Dosage Individualization of Vancomycin in Neonates
Tang, B., Zhang, J., Allegaert, K., Hao, G., Yao, B., Leroux, S., Thomson, A. H., Yu, Z. Y., Gao, F., Zheng, Y., et al. (2023) · Clinical Pharmacokinetics · doi:10.1007/s40262-023-01265-z · Cited by 34
Dong, Y., & Martinsson, P. (2023) · Advances in Computational Mathematics · doi:10.1007/s10444-023-10061-z · Cited by 34
Towards Population Scale Activity Recognition: A Framework for Handling Data Diversity
Abdullah, S., Lane, N. D., & Choudhury, T. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8323 · Cited by 34
Near-duplicate detection for images and videos
Yang, X. Y., Zhu, Q., & Cheng, K.-T. T. (2009) · ACM Workshop on Large-Scale Multimedia Retrieval and Mining (LS-MMRM) · doi:10.1145/1631058.1631073 · Cited by 34
Resolution-based outlier factor: detecting the top-n most outlying data points in engineering data
Fan, H., Zai͏̈ane, O. R., Foss, A., & Wu, J. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-008-0145-3 · Cited by 34
An incremental clustering scheme for data de-duplication
Costa, G., Manco, G., & Ortale, R. (2009) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-009-0155-0 · Cited by 34
Approximate similarity search for online multimedia services on distributed CPU–GPU platforms
Teodoro, G., Junior, E. A. D. V., Mariano, N., Torres, R. D. S., Meira, W., & Saltz, J. H. (2013) · The VLDB Journal · doi:10.1007/s00778-013-0329-7 · Cited by 34
PP-Index: Using Permutation Prefixes for Efficient and Scalable Approximate Similarity Search
Esuli, A. (2009) · Cited by 34
A Linear DBSCAN Algorithm Based on LSH
Wu, Y.-P., Guo, J., & Zhang, X. (2007) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2007.4370588 · Cited by 34
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