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 101–200 of 1,008
UNICORN: Runtime Provenance-Based Detector for Advanced Persistent Threats
Han, X., Pasquier, T., Bates, A., Mickens, J., & Seltzer, M. (2020) · Proceedings 2020 Network and Distributed System Security Symposium · doi:10.14722/ndss.2020.24046 · Cited by 349
Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS)Preprint
Shrivastava, A., & Li, P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.5869 · Cited by 345
Finding interesting associations without support pruning
Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J. D., & Yang, C. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.908981 · Cited by 343
Self-citationFast and accurate long-range phasing in a UK Biobank cohort
Loh, P.-R., Palamara, P. F., & Price, A. L. (2016) · Nature Genetics · doi:10.1038/ng.3571 · Cited by 342
Efficient near-duplicate detection and sub-image retrieval
Ke, Y. (2004) · Cited by 342
Geometric Approximation Algorithms
Har-Peled, S. (2011) · Mathematical surveys and monographs · doi:10.1090/surv/173 · Cited by 336
Outlier Detection: Methods, Models, and Classification
Boukerche, A., Zheng, L., & Alfandi, O. (2021) · ACM Computing Surveys · doi:10.1145/3381028 · Cited by 334
Distributed representations of tuples for entity resolution
Ebraheem, M., Thirumuruganathan, S., Joty, S., Ouzzani, M., & Tang, N. (2018) · Proceedings of the VLDB Endowment · doi:10.14778/3236187.3236198 · Cited by 361
A theory of multineuronal dimensionality, dynamics and measurement
Gao, P., Trautmann, E., Yu, B., Santhanam, G., Ryu, S., Shenoy, K., & Ganguli, S. (2017) · doi:10.1101/214262 · Cited by 332
Kernelized Locality-Sensitive Hashing
Kulis, B., & Grauman, K. L. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.219 · Cited by 331
Efficient similarity joins for near-duplicate detection
Xiao, C., Wang, W., Lin, X., Yu, J. X., & Wang, G. (2011) · ACM Transactions on Database Systems · doi:10.1145/2000824.2000825 · Cited by 330
Image driven machine learning methods for microstructure recognition
Chowdhury, A., Kautz, E. J., Yener, B., & Lewis, D. (2016) · Computational Materials Science · doi:10.1016/j.commatsci.2016.05.034 · Cited by 331
Randomized numerical linear algebra: Foundations and algorithms
Martinsson, P., & Tropp, J. A. (2020) · Acta Numerica · doi:10.1017/s0962492920000021 · Cited by 421
An algorithmic theory of learning: Robust concepts and random projection
Arriaga, R. I., & Vempala, S. (2006) · Machine Learning · doi:10.1007/s10994-006-6265-7 · Cited by 318
Navigating nets: simple algorithms for proximity search
Krauthgamer, R., & Lee, J. R. (2015) · Cited by 308
Fast, Accurate Detection of 100,000 Object Classes on a Single Machine
Dean, T., Ruzon, M. A., Segal, M., Shlens, J., Vijayanarasimhan, S., & Yagnik, J. (2013) · 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.2013.237 · Cited by 307
Elnaggar, A., Heinzinger, M., Dallago, C., Rihawi, G., Wang, Y., Jones, L., Gibbs, T., Fehér, T., Angerer, C. M., Steinegger, M., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.06225 · Cited by 364
The Concentration of Fractional Distances
François, D., Vincent Wertz, B., & Verleysen, M. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1037 · Cited by 303
Fast Memory-efficient Anomaly Detection in Streaming Heterogeneous Graphs
Manzoor, E., Milajerdi, S. M., & Akoglu, L. (2016) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2939672.2939783 · Cited by 325
Column Sampling Based Discrete Supervised Hashing
Kang, W.-C., Li, W.-J., & Zhou, Z. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10176 · Cited by 299
Finding generalized projected clusters in high dimensional spaces
Aggarwal, C. C., & Yu, P. S. (2000) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/342009.335383 · Cited by 297
New directions in nearest neighbor searching with applications to lattice sieving
Becker, A., Ducas, L., Gama, N., & Laarhoven, T. (2015) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974331.ch2 · Cited by 296
Fast image search for learned metrics
Jain, P., Kulis, B., & Grauman, K. L. (2008) · 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.2008.4587841 · Cited by 280
Hierarchical semantic cognition for urban functional zones with VHR satellite images and POI data
Zhang, X., Du, S., & Wang, Q. (2017) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2017.09.007 · Cited by 280
Supervised hashing with latent factor models
Zhang, P., Zhang, W., Li, W.-J., & Guo, M. (2014) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2600428.2609600 · Cited by 276
RNN-DBSCAN: A Density-Based Clustering Algorithm Using Reverse Nearest Neighbor Density Estimates
Bryant, A. C., & Cios, K. J. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2787640 · Cited by 279
Pretrained Transformers for Text Ranking: BERT and Beyond
Lin, J., Nogueira, R. F., & Yates, A. (2021) · Synthesis lectures on human language technologies · doi:10.2200/s01123ed1v01y202108hlt053 · Cited by 328
Efficient Similarity Search over Encrypted Data
Kuzu, M., Islam, M. S., & Kantarcıoğlu, M. (2012) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2012.23 · Cited by 271
Dynamically-Stable Motion Planning for Humanoid Robots
Kuffner, J., Kagami, S., Nishiwaki, K., Inaba, M., & Inoue, H. (2002) · Autonomous Robots · doi:10.1023/a:1013219111657 · Cited by 267
Toward Privacy in Public Databases
Chawla, S., Dwork, C., McSherry, F., Smith, A., & Wee, H. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30576-7_20 · Cited by 267
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
Har-Peled, S., & Mendel, M. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704446281 · Cited by 263
Fast search in Hamming space with multi-index hashing
Norouzi, M., Punjani, A., & Fleet, D. J. (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.6248043 · Cited by 263
Efficient search for approximate nearest neighbor in high dimensional spaces
Eyal Kushilevitz, Z., Ostrovsky, R., & Rabani, Y. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276877 · Cited by 261
Content-Based Copy Retrieval Using Distortion-Based Probabilistic Similarity Search
Joly, A., Buisson, O., & Frélicot, C. (2007) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2006.886278 · Cited by 261
Relational autoencoder for feature extraction
Meng, Q., Catchpoole, D. R., Skillicom, D., & Kennedy, P. J. (2017) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2017.7965877 · Cited by 274
Fast Similarity Search for Learned Metrics
Kulis, B., Jain, P., & Grauman, K. L. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.151 · Cited by 258
Accurate Estimation of Neural Population Dynamics without Spike Sorting
Trautmann, E. M., Stavisky, S. D., Lahiri, S., Ames, K. C., Kaufman, M. T., O’Shea, D. J., Vyas, S., Sun, X., Ryu, S. I., Ganguli, S., et al. (2019) · Neuron · doi:10.1016/j.neuron.2019.05.003 · Cited by 255
C2TAM: A Cloud framework for cooperative tracking and mapping
Riazuelo, L., Civera, J., & Montiel, J. M. M. (2014) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2013.11.007 · Cited by 254
Efficient large-scale sequence comparison by locality-sensitive hashing
Buhler, J. D. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.5.419 · Cited by 253
Ganguli, S., & Sompolinsky, H. (2012) · Annual Review of Neuroscience · doi:10.1146/annurev-neuro-062111-150410 · Cited by 262
Algorithmic applications of low-distortion geometric embeddings
Indyk, P. (2001) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959878 · Cited by 251
Self-citationDictionary matching and indexing with errors and don't cares
Cole, R. J., Gottlieb, L.-A. J., & Lewenstein, M. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007374 · Cited by 249
A scalable pattern mining approach to web graph compression with communities
Buehrer, G., & Chellapilla, K. (2008) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1341531.1341547 · Cited by 254
Space-time tradeoffs for approximate nearest neighbor searching
Arya, S., Malamatos, T., & Mount, D. M. (2009) · Journal of the ACM · doi:10.1145/1613676.1613677 · Cited by 243
Optimizing Bloom Filter: Challenges, Solutions, and Comparisons
Luo, L., Guo, D., Ma, R. T. B., Rottenstreich, O., & Luo, X. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2889329 · Cited by 243
A Survey on Deep Hashing Methods
Luo, X., Wang, H., Wu, D., Chen, C., Deng, M., Huang, J., & Hua, X.-S. (2023) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3532624 · Cited by 241
Stable distributions, pseudorandom generators, embeddings and data stream computation
Indyk, P. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892082 · Cited by 238
Self-citationAdaptive Blocking: Learning to Scale Up Record Linkage
Bilenko, M., Kamath, B., & Mooney, R. J. (2006) · Proceedings · doi:10.1109/icdm.2006.13 · Cited by 236
Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection
Chen, J., Fang, H., & Saad, Y. (2008) · Cited by 236
Locality-sensitive hashing scheme based on dynamic collision counting
Gan, J., Feng, J., Fang, Q., & Ng, W. (2012) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2213836.2213898 · Cited by 235
Efficient Nonlocal Means for Denoising of Textural Patterns
Brox, T., Kleinschmidt, O., & Cremers, D. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.924281 · Cited by 234
Quality and efficiency in high dimensional nearest neighbor search
Tao, Y., Yi, K., Sheng, C., & Kalnis, P. (2009) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1559845.1559905 · Cited by 230
Geometric min-Hashing: Finding a (thick) needle in a haystack
Chum, O., Perďoch, M., & Matas, J. (2009) · 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.2009.5206531 · Cited by 230
Randomized Dimensionality Reduction for $k$ -Means Clustering
Boutsidis, C., Zouzias, A., Mahoney, M. W., & Petros Drineas, B. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2375327 · Cited by 229
3D Shape Matching with 3D Shape Contexts
Körtgen, M., Park, G.-J., Novotni, M., & Klein, R. (2003) · Cited by 227
Automatic fault detection for laser powder-bed fusion using semi-supervised machine learning
Okaro, I. A., Jayasinghe, S., Sutcliffe, C. J., Black, K., Paoletti, P., & Green, P. L. (2019) · Additive manufacturing · doi:10.1016/j.addma.2019.01.006 · Cited by 221
Survey of vector database management systems
Pan, J. J., Wang, J., & Li, G. (2024) · The VLDB Journal · doi:10.1007/s00778-024-00864-x · Cited by 221
Properties of embedding methods for similarity searching in metric spaces
Hjaltason, G. R., & Samet, H. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1195989 · Cited by 217
Babenko, A., & Lempitsky, V. (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.6248038 · Cited by 232
Semantic content-based image retrieval: A comprehensive study
Alzu’bi, A., Amira, A., & Ramzan, N. (2015) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2015.07.012 · Cited by 218
Yang, Z., Moczulski, M., Denil, M., De Freitas, N., Song, L., & Wang, Z. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.173 · Cited by 215
Query-aware locality-sensitive hashing for approximate nearest neighbor search
Huang, Q., Feng, J., Zhang, Y., Fang, Q., & Ng, W. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2850469.2850470 · Cited by 213
Margin Analysis of the LVQ Algorithm
Crammer, K., Gilad-Bachrach, R., Navot, A., & Tishby, N. (2002) · Cited by 212
A survey on data leakage prevention systems
Alneyadi, S., Sithirasenan, E., & Muthukkumarasamy, V. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2016.01.008 · Cited by 211
Identifying Representative Trends in Massive Time Series Data Sets Using Sketches
Indyk, P., Koudas, N., & Muthukrishnan, S. (2000) · Very Large Data Bases · Cited by 208
Self-citationHash Kernels for Structured Data
Shi, Q., PettersonJames, Dror, G., Langford, J. C., & Smola, A. J. (2009) · ANU Open Research (Australian National University) · doi:10.5555/1577069.1755873 · Cited by 207
Ravichandran, D., Pantel, P., & Hovy, E. H. (2005) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/1219840.1219917 · Cited by 206
Experiments with random projections for machine learning
Fradkin, D., & Madigan, D. (2003) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956750.956812 · Cited by 205
Hoffart, J., Seufert, S., Nguyen, D. B., Theobald, M., & Weikum, G. (2012) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2396761.2396832 · Cited by 204
ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms
Aumüller, M., Bernhardsson, E., & Faithfull, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-68474-1_3 · Cited by 206
A probabilistic model for multimodal hash function learning
Zhen, Y., & Yeung, D. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339678 · Cited by 201
Data integration: challenges for drug discovery
Searls, D. B. (2005) · Nature Reviews Drug Discovery · doi:10.1038/nrd1608 · Cited by 204
TopicSketch: Real-Time Bursty Topic Detection from Twitter
Xie, W., Zhu, F., Jiang, J., Lim, E., & Wang, K. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2556661 · Cited by 203
Improved Consistent Sampling, Weighted Minhash and L1 Sketching
Ioffe, S. (2010) · Proceedings · doi:10.1109/icdm.2010.80 · Cited by 199
Recent Advance in Content-based Image Retrieval: A Literature SurveyPreprint
Zhou, W., Li, H., & Tian, Q. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.06064 · Cited by 199
Active Learning Query Strategies for Classification, Regression, and Clustering: A Survey
Kumar, P. R., & Gupta, A. K. (2020) · Journal of Computer Science and Technology · doi:10.1007/s11390-020-9487-4 · Cited by 208
Privacy-Preserving Patient Similarity Learning in a Federated Environment: Development and Analysis
Lee, J., Sun, J., Wang, F., Wang, S., Jun, C.-H., & Jiang, X. (2018) · JMIR Medical Informatics · doi:10.2196/medinform.7744 · Cited by 196
Babenko, A., & Lempitsky, V. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2361319 · Cited by 209
Stein, B., Lipka, N., & Prettenhofer, P. (2011) · Language Resources and Evaluation · doi:10.1007/s10579-010-9115-y · Cited by 194
Fast mining of distance-based outliers in high-dimensional datasets
Ghoting, A., Parthasarathy, S., & Otey, M. E. (2008) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-008-0093-2 · Cited by 194
Pest24: A large-scale very small object data set of agricultural pests for multi-target detection
Wang, Q.-J., Zhang, S., Dong, S., Zhang, G., Yang, J., Li, R., & Wang, H. (2020) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2020.105585 · Cited by 200
Sublinear time algorithms for metric space problems
Indyk, P. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301366 · Cited by 193
Self-citationWeakly-supervised Semantic Guided Hashing for Social Image Retrieval
Li, Z., Tang, J., Zhang, L., & Yang, J. (2020) · International Journal of Computer Vision · doi:10.1007/s11263-020-01331-0 · Cited by 192
Unsupervised feature selection via multiple graph fusion and feature weight learning
Tang, C., Zheng, X., Zhang, W., Liu, X., Zhu, X., & Zhu, E. (2023) · Science China Information Sciences · doi:10.1007/s11432-022-3579-1 · Cited by 191
Co-Regularized Hashing for Multimodal Data
Zhen, Y., & Yeung, D. (2012) · Cited by 190
Optimal Data-Dependent Hashing for Approximate Near Neighbors
Andoni, A., & Razenshteyn, I. (2015) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2746539.2746553 · Cited by 189
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes
Ailon, N., & Liberty, E. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9110-x · Cited by 188
Neighborhood Discriminant Hashing for Large-Scale Image Retrieval
Tang, J., Li, Z., Wang, M., & Zhao, R. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2421443 · Cited by 186
A probabilistic molecular fingerprint for big data settings
Probst, D., & Reymond, J. (2018) · Journal of Cheminformatics · doi:10.1186/s13321-018-0321-8 · Cited by 190
Solving the Problem of the K Parameter in the KNN Classifier Using an Ensemble Learning ApproachPreprint
Hassanat, A. B. A., Abbadi, M. A., Tarawneh, A. S., & Alhasanat, A. A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.0919 · Cited by 186
Approximation of functions over redundant dictionaries using coherence
Gilbert, A. C., Muthukrishnan, S., & Strauss, M. J. (2003) · doi:10.5555/644108.644149 · Cited by 185
Randomized algorithms for matrices and dataPreprint
Mahoney, M. W. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1104.5557 · Cited by 219
Approximate Range Selection Queries in Peer-to-Peer Systems
Gupta, A., Agrawal, D., & Abbadi, A. E. (2003) · Cited by 183
Entropy based nearest neighbor search in high dimensions
Panigrahy, R. (2006) · doi:10.5555/1109557.1109688 · Cited by 182
Face recognition experiments with random projection
Goel, N., Bebis, G. N., & Nefian, A. (2005) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.605553 · Cited by 182
On Approximate Geometric k -Clustering
Matoušek, J. (2000) · Discrete & Computational Geometry · doi:10.1007/s004540010019 · Cited by 181
A self-organizing map for adaptive processing of structured data
Hagenbuchner, M., Sperduti, A., & Tsoi, A. C. (2003) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2003.810735 · Cited by 180
Fingerprint Indexing Based on Minutia Cylinder-Code
Cappelli, R., Ferrara, M., & Maltoni, D. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.228 · Cited by 179
On variants of the Johnson–Lindenstrauss lemma
Matoušek, J. (2008) · Random Structures and Algorithms · doi:10.1002/rsa.20218 · Cited by 178
Embedding Logical Queries on Knowledge Graphs
Hamilton, W. L., Bajaj, P., Zitnik, M., Jurafsky, D., & Leskovec, J. (2018) · arXiv · doi:10.48550/arxiv.1806.01445 · Cited by 176
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
