CoChat
Sign Up
Cited by 55

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Principles of hash-based text retrieval

Stein, Benno·2007·Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
DOI 10.1145/1277741.1277832
Open this paper in CoChat — free account

Abstract

Hash-based similarity search reduces a continuous similarity relation to the binary concept "similar or not similar": two feature vectors are considered as similar if they are mapped on the same hash key. From its runtime performance this principle is unequaled--while being unaffected by dimensionality concerns at the same time. Similarity hashing is applied with great success for near similarity search in large document collections, and it is considered as a key technology for near-duplicate detection and plagiarism analysis. This papers reveals the design principles behind hash-based search methods and presents them in a unified way. We introduce new stress statistics that are suited to analyze the performance of hash-based search methods, and we explain the rationale of their effectiveness. Based on these insights, we show how optimum hash functions for similarity search can be derived. We also present new results of a comparative study between different hash-based search methods.

Overview

Integrity signals

Registry

Crossref · 10.1145/1277741.1277832

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 2 references

Research works printed but not linked: 25

  1. 10.1145/383952.383981 · DOI
  2. 10.1145/1060745.1060840 · DOI
  3. Broder A., 1997, conference on World Wide Web
  4. 10.1145/1076034.1076039 · DOI
  5. 10.1145/509907.509965 · DOI
  6. T. Cormen C. Leiserson and R. Rivest. Introduction to Algorithms. MIT Press Cambridge. 1990. T. Cormen C. Leiserson and R. Rivest. Introduction to Algorithms. MIT Press Cambridge. 1990.
  7. 10.1145/997817.997857 · DOI
  8. 10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9 · DOI
  9. 10.1007/BF02288367 · DOI
  10. Gionis A., 1999, The VLDB Journal
  11. 10.1145/1076034.1076039 · DOI
  12. 10.1145/1148170.1148222 · DOI
  13. N. Higham. Computing a Nearest Symmetric Positive Semidefinite Matrix. Linear Algebra and its App. 1988. N. Higham. Computing a Nearest Symmetric Positive Semidefinite Matrix. Linear Algebra and its App. 1988. · DOI
  14. Hinton G., 2006, Reducing the Dimensionality of Data with Neural Networks. Science, 313, 504
  15. 10.1023/A:1007617005950 · DOI
  16. Indyk P., 2000, Embeddings and Data Stream Computation. In FOCS'00: Proc. of the 41st symposium on foundations of computer science
  17. Jolliffe I., 1996, Springer
  18. 10.1145/258533.258653 · DOI
  19. J. Kruskal. Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis. Psychometrika 29(1) 1964. J. Kruskal. Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis. Psychometrika 29(1) 1964. · DOI
  20. 10.1142/S0218213004001466 · DOI
  21. Rose T., 2002, Proc. of the third int. conference on language resources and evaluation
  22. 10.1007/s10543-006-0056-1 · DOI
  23. Stein B., 2005, Proc. of the 5th Int. Conference on KnowledgeManagement, Graz, Journal of Universal Computer Science
  24. Weber R., 1998, Proc. of the 24th VLDB conference
  25. 10.1145/1148170.1148243 · DOI

Cited by

Sorted by citations

Metadata

Authors
Stein, B.
Affiliations
Bauhaus University Weimar, Weimar, Germany
Venue
Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Publisher
ACM
Published
2007-07-23
Pages
527-534
DOI
10.1145/1277741.1277832
Cited by
55
References
2
Licence
www.acm.org/publications/policies/copyright_policy#Background (vor)

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