Infectious texts: Modeling text reuse in nineteenth-century newspapers

Proceedings - 2013 IEEE International Conference on Big Data, Big Data 2013

Volumn , Issue , 2013, Pages 86-94

  Smith, David A ^a   Cordell, Ryan ^b   Dillon, Elizabeth Maddock ^b  

^a Northeastern University   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

clustering algorithms; nearest neighbor searches

Indexed keywords

BIG DATA; CLUSTERING ALGORITHMS; COPYRIGHTS; NEAREST NEIGHBOR SEARCH;

CIVIL WAR; NETWORK CONNECTION; TIME DYNAMIC;

NEWSPRINT;

EID: 84893253373     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BigData.2013.6691675     Document Type: Conference Paper

References (17)

1. J. Leskovec, L. Backstrom, and J. Kleinberg, "Meme-tracking and the dynamics of the news cycle," in KDD, 2009.
2. H. Ryu, M. Lease, and N. Woodward, "Finding and exploring memes in social media," in Hypertext, 2012.
3. G. M. Namata, S. Kok, and L. Getoor, "Collective graph identification," in KDD, 2011.
4. M. L. McGill, American Literature and the Culture of Reprinting, 1834-1853. U. Penn. Press, 2003.
5. M. Henzinger, "Finding near-duplicate web pages: A large-scale evaluation of algorithms," in SIGIR, 2006.
6. A. Andoni, A. Goldberger, A. McGregor, and E. Porat, "Homomorphic fingerprints under misalignments: Sketching edit and shift distances," in STOC, 2013.
7. C. Suen, S. Huang, C. Eksombatchai, R. Sosi?c, and J. Leskovec, "NIFTY: A system for large scale information flow tracking and clustering," in WWW, 2013.
8. O. Kolak and B. N. Schilit, "Generating links by mining quotations," in Hypertext, 2008.
9. J. Seo and W. B. Croft, "Local text reuse detection," in SIGIR, 2008.
10. R. Horton, M. Olsen, and G. Roe, "Something borrowed: Sequence alignment and the identification of similar passages in large text collections," Digital Studies / Le champ numerique, vol. 2, no. 1, 2010.
11. Y. Bernstein and J. Zobel, "A scalable system for identifying co-derivative documents," in SPIRE, 2004.
12. S. Huston, A. Moffat, and W. B. Croft, "Efficient indexing of repeated n-grams," in WSDM, 2011.
13. T. Elsayed, J. Lin, and D. W. Oard, "Pairwise document similarity in large collections with MapReduce," in ACL Short Papers, 2008.
14. I. Z. Yalniz, E. F. Can, and R. Manmatha, "Partial duplicate detection for large book collections," in CIKM, 2011.
15. D. Gusfield, Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
16. R. E. Tarjan, "Efficiency of a good but not linear set union algorithm," J. ACM, vol. 22, no. 2, pp. 215-225, 1975.
17. J. Friedman, T. Hastie, and R. Tibshirani, "Regularization paths for generalized linear models via coordinate descent," J. Statistical Software, vol. 33, no. 1, 2008.