Similarity estimation techniques from rounding algorithms
Explore this paper's citation graph
Summary
It is shown that rounding algorithms for LPs and SDPs used in the context of approximation algorithms can be viewed as locality sensitive hashing schemes for several interesting collections of objects.
- Type
- article
- Published
- 2002-05-19
- Cited by
- 2,823
- References
- 43
- OpenAlex
- https://openalex.org/W2012833704
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:4229473
Keywords
Rounding, Computer science, Similarity (geometry), Algorithm, Estimation
References
- Scalable Techniques for Clustering the Web
- Similarity Search in High Dimensions via Hashing
- The Earth Mover''s Distance: Lower Bounds and Invariance under Translation
- Perceptual metrics for image database navigation
- Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields
- On approximate nearest neighbors in non-Euclidean spaces
- Approximation algorithms for the metric labeling problem via a new linear programming formulation
- Corner detection in textured color images
- A constant factor approximation algorithm for a class of classification problems
- Selectively estimation for Boolean queries
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Non-Expansive Hashing
- Min-wise independent permutations (extended abstract)
- A small approximately min-wise independent family of hash functions
- Locality-preserving hashing in multidimensional spaces
- Tracking join and self-join sizes in limited storage
- Approximation algorithms for the 0-extension problem
- On approximating arbitrary metrices by tree metrics
- Fast, small-space algorithms for approximate histogram maintenance
- Finding interesting associations without support pruning
Cited by
- Space Constrained Dynamic Covering
- The Pyramid Match: Efficient Learning with Partial Correspondences
- In Defense of Locality-Sensitive Hashing
- Streaming and Sketch Algorithms for Large Data NLP
- Authorship Identification and Verification of JavaScript Source Code: An Evaluation of Techniques
- Enriching iTunes App Store Categories via Topic Modeling
- Data Analysis, Machine Learning, and Applications
- Hashing-basierte Indizierung: Anwendungsszenarien, Theorie und Methoden
- Evaluation of EPCI: Extracting Potentially Copyright Infringement texts by using a Search Engine
- Towards Population Scale Activity Recognition: A Framework for Handling Data Diversity
- Compressive Parameter Estimation with Emd
- Near-duplicate document detection with improved similarity measurement
- Consistent Weighted Sampling
- FARMER: A novel approach to file access correlation mining and evaluation reference model
- Text categorization and similarity analysis: similarity measure, literature review
- Reciprocal Hash Tables for Nearest Neighbor Search
- Learning paraphrases from text
- Unsupervised Graph-Based Similarity Learning Using Heterogeneous Features
- Alibi framework for identifying insider jamming attacks in half-duplex wireless local area networks
- Performance of near-duplicate detection algorithms for Crawljax
Related papers
- Children’s mixed-rounding strategy use in computational estimation
- Rounding of Floating Point Intervals
- On Methods for Rounding Probabilities and Other Fractions
- Rounding with multiplier methods: An efficient algorithm and applications in statistics
- Systematic IEEE rounding method for high-speed floating-point multipliers
- Surface volumes of rounding polytopes
- Data Rounding in Mechanical Property Tests
- An estimate of the effect of rounding errors on the accuracy of the elimination of variables in sets of linear inequalities
- Research on Rounding Methods for High-Speed Floating-Point Multipliers