Similarity estimation techniques from rounding algorithms

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 380-388

  Charikar, Moses S ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ESTIMATION; FUNCTIONS; INFORMATION THEORY; VECTORS;

HASH FUNCTIONS; ROUNDING ALGORITHMS; SIMILARITY ESTIMATION;

COMPUTATION THEORY;

EID: 0036040277     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509965     Document Type: Conference Paper

References (42)

1. Tracking join and self-join sizes in limited storage
2. The space complexity of approximating the frequency moments
3. Probabilistic approximation of metric spaces and its algorithmic application
4. On approximating arbitrary metrics by tree metrics
5. On the resemblance and containment of documents
6. Filtering near-duplicate documents
7. Min-wise independent permutations
8. Syntactic clustering of the web
9. Improved classification via connectivity information
10. Approximation algorithms for the O-extension problem
11. Approximation algorithms for the metric labeling problem via a new linear programming formulation
12. Counting twig matches in a tree
13. Selectivity estimation for Boolean queries
14. Finding interesting associations without support pruning
15. The earth mover's distance under transformation sets
16. The earth mover's distance: Lower bounds and invariance under translation
17. Derandomized dimensionality reduction with applications
18. Synopsis data structures for massive data sets
19. Surfing wavelets on streams: One-pass summaries for approximate aggregate queries
20. QuickSAND: Quick summary and analysis of network data
21. Efficient and tunable similar set retrieval
22. Similarity search in high dimensions via Hashing
23. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
24. Clustering data streams
25. A constant factor approximation algorithm for a class of classification problems
26. Scalable techniques for clustering the web
27. A small approximately min-wise independent family of hash functions
28. On approximate nearest neighbors in non-Euclidean spaces
29. Stable distributions, pseudorandom generators. Embeddings and data stream computation
30. Approximate nearest neighbors: Towards removing the curse of dimensionality
31. Locality-preserving hashing in multidimensional spaces
32. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields
33. Non-expansive hashing
34. Pseudorandom sequences for space bounded computations
35. Perceptual metrics for image database navigation
36. The earth mover's distance, multi-dimensional scaling, and color-based image retrieval
37. Texture metrics
38. A metric for distributions with applications to image databases
39. The earth mover's distance as a metric for image retrieval
40. Color edge detection with the compass operator
41. Corner detection in textured color images