Finding the Jaccard median

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 293-311

  Chierichetti, Flavio ^a   Kumar, Ravi ^b   Pandey, Sandeep ^b   Vassilvitskii, Sergei ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC IDEAS; BINARY VECTORS; EXACT ALGORITHMS; EXPONENTIAL TIME; HARDNESS RESULT; MEDIAN PROBLEM;

ALGORITHMS;

EID: 77951707399     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.25     Document Type: Conference Paper

References (27)

1. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. SIAM J. Comput., 33(3):544-562, 2004.
2. J. Bartholdi, C. A. Tovey, and M. Trick. Voting schemes for which it can be difficult to tell who won the election. Social Choice Welfare, 6(2):157-165, 1989.
3. A. Broder. On the resemblance and containment of documents. In Proc. Compression and Complexity of Sequences, pages 21-29, 1997.
4. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. JCSS, 60(3):630-659, 2000.
5. M. Charikar. Similarity estimation techniques from rounding algorithms. In Proc. 34th STOC, pages 380-388, 2002.
6. M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem. JCSS, 65(1):129-149, 2002.
7. I. Dagan. Contextual word similarity. In R. Dale, H. Moisl, and H. Somers, editors, A Handbook of Natural Language Processing: Techniques and Applications for the Processing of Language as Text. Marcel Dekker Inc., 2000.
8. C. de la Higuera and F. Casacuberta. Topology of strings: Median string is NP-complete. TCS, 230:39-48, 2000.
9. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In Proc. 10th WWW, pages 613-622, 2001.
10. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
11. G. Grefenstette. Explorations in Automatic Thesaurus Discovery. Kluwer Academic Publishers, 1994.
12. R. A. M. Gregson. Psychometrics of Similarity. Academic Press, 1975.
13. B. Huntley and H. J. B. Birks. The past and present vegetation of the Morrone Birkwoods national nature reserve. J. Ecology, 67(2):417-446, 1979.
14. P. Jaccard. Distribution de la flore alpine dans le bassin des dranses et dans quelques régions voisines. Bulletin del la Société Vaudoise des Sciences Naturelles, 37:241-272, 1901.
15. D. Jurafsky and J. H. Martin. Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics and Speech Recognition. Prentice Hall, second edition, 2008.
16. B. Kendrick. Quantitative characters in computer taxonomy. Phenetic and Phylogenetic Classification, pages 105-114, 1964.
17. H. R. Lasker. Light dependent activity patterns among reef corals: Montastrea cavernosa. Biological Bulletin, 156:196-211, 1979.
18. E. Marczewski and H. Steinhaus. On a certain distance of sets and the corresponding distance of functions. Colloquium Mathematicum, 6:319-327, 1958.
19. F. Nicolas and E. Rivals. Complexities of the centre and median string problems. In Proc. 14th CPM, pages 315-327, 2003. (Pubitemid 36769871)
20. D. N. Osherson, J. Stern, O. Wilkie, M. Stob, and E. E. Smith. Default probability. Cognitive Science, 15:251-270, 1991.
21. S. Pandey, A. Z. Broder, F. Chierichetti, V. Josifovski, R. Kumar, and S. Vassilvitskii. Nearest-neighbor caching for content-match applications. In Proc. 18th WWW, pages 441-450, 2009.
22. M. E. Patzkowsky and S. M. Holland. Biofacies replacement in a sequence stratigraphic framework: Middle and upper Ordovician of the Nashville dome, Tennessee, USA. Palaios, 14:301-323, 1999. (Pubitemid 129760350)
23. I. C. Prentice. Non-metric ordination methods in ecology. J. Ecology, 65:85-94, 1977.
24. J. J. Sepkoski. Quantified coefficients of association and measurement of similarity. Math. Geology, 6(2):131-152, 1974.
25. H. Späth. The minisum location problem for the Jaccard metric. OR Spektrum, 3:91-94, 1981.
26. A. Tversky. Features of similarity. Psychological Review, 84(4):327-352, 1977.
27. G. A. Watson. An algorithm for the single facility location problem using the Jaccard metric. SIAM J. Sci. and Stat. Comput., 4:748-756, 1983.