The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Scaling up all pairs similarity search
Abstract
Given a large collection of sparse vector data in a high dimensional space, we investigate the problem of finding all pairs of vectors whose similarity score (as determined by a function such as cosine distance) is above a given threshold. We propose a simple algorithm based on novel indexing and optimization strategies that solves this problem without relying on approximation methods or extensive parameter tuning. We show the approach efficiently handles a variety of datasets across a wide setting of similarity thresholds, with large speedups over previous state-of-the-art approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
(1999) · Cited by 3,186
Similarity estimation techniques from rounding algorithms
Charikar, M. S. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509965 · Cited by 2,220
Syntactic clustering of the Web
Broder, A. Z., Glassman, S. C., Manasse, M. S., & Zweig, G. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00031-7 · Cited by 1,343
(2014) · Elsevier eBooks · doi:10.1016/b978-0-12-799957-9.00002-x · Cited by 1,313
Agglomerative clustering of a search engine query log
Beeferman, D., & Berger, A. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347176 · Cited by 768
A web-based kernel function for measuring the similarity of short text snippets
Sahami, M., & Heilman, T. D. (2006) · Proceedings of the 15th international conference on World Wide Web · doi:10.1145/1135777.1135834 · Cited by 735
Efficient exact set-similarity joins
Arasu, A., Ganti, V., & Kaushik, R. (2006) · doi:10.5555/1182635.1164206 · Cited by 406
Efficient similarity search and classification via rank aggregation
Fagin, R., Kumar, R., & Sivakumar, D. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872795 · Cited by 362
Self-indexing inverted files for fast text retrieval
Moffat, A., & Zobel, J. (1996) · ACM Transactions on Information Systems · doi:10.1145/237496.237497 · Cited by 361
Query evaluation: Strategies and optimizations
Turtle, H., & Flood, J. (1995) · Information Processing & Management · doi:10.1016/0306-4573(95)00020-h · Cited by 305
Evaluating similarity measures: a large-scale study in the orkut social network
Spertus, E., Sahami, M., & Buyukkokten, O. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081956 · Cited by 296
Optimization of inverted vector searches
Buckley, C., & Lewit, A. F. (1985) · Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '85 · doi:10.1145/253495.253515 · Cited by 216
Semantic similarity between search engine queries using temporal correlation
Chien, S., & Immorlica, N. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060752 · Cited by 170
Metwally, A., Agrawal, D., & Abbadi, A. E. (2007) · International World Wide Web Conference (WWW) · doi:10.1145/1242572.1242606 · Cited by 123
Optimization strategies for complex queries
Strohman, T., Turtle, H. R., & Croft, W. B. (2005) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1076034.1076074 · Cited by 103
Document filtering for fast ranking
Persin, M. (1994) · doi:10.5555/188490.188597 · Cited by 72
High performance clustering based on the similarity join
Böhm, C., Braunmüller, B., Breunig, M. M., & Kriegel, H. (2000) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/354756.354832 · Cited by 56
Taxonomy generation for text segments
Chuang, S., & Chien, L. (2005) · ACM Transactions on Information Systems · doi:10.1145/1095872.1095873 · Cited by 49
Cited by
From Frequency to Meaning: Vector Space Models of Semantics
Turney, P. D., & Pantel, P. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2934 · Cited by 2,866
Efficient k-nearest neighbor graph construction for generic similarity measures
Dong, W., Moses, C., & Li, K. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963487 · Cited by 673
Yeh, C.-C. M., Zhu, Y., Ulanova, L., Begum, N., Ding, Y., Dau, H. A., Silva, D. F., Mueen, A., & Keogh, E. (2016) · 2016 IEEE 16th International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2016.0179 · Cited by 653
CrowdER: crowdsourcing entity resolution
Wang, J., Kraska, T., Franklin, M. J., & Feng, J. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2350229.2350263 · Cited by 507
Efficient similarity joins for near duplicate detection
Xiao, C., Wang, W., Lin, X., & Yu, J. X. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367516 · Cited by 455
Metadata
- Authors
- Bayardo, R. J., Ma, Y., & Srikant, R.
- Venue
- Proceedings of the 16th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2007-05-08
- Pages
- 131-140
- OpenAlex
- W2097776316
- Cited by
- 673
- References
- 19
- FWCI
- 25.73
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.