BibSonomyburst/bibtex/3e9b05638c537f23a276ef4e09d4b9d4BibSonomy RSS feed for /bibtex/3e9b05638c537f23a276ef4e09d4b9d42012-02-17T08:27:23+01:00http://www.bibsonomy.org/bibtex/2e8d7e47dafc145c54846bb69e1c1be39/stroehstroeh2011-07-07T11:07:43+02:00detection duplicate resemblance <span class="authorEditorList"><a href="/author/Broder">Andrei Z. Broder</a> </span><em>Compression and Complexity of Sequences, </em><em>page 21--29. </em><em>Salerno, Italy, </em><em>IEEE Computer Society Press, </em>(<em>June 1997</em>)Thu Jul 07 11:07:43 CEST 2011Salerno, ItalyCompression and Complexity of SequencesJune21--29On the resemblance and containment of documents1997detection duplicate resemblance Given two documents A and B we define two mathematical notions: their resemblance r(A, B) and their containment c(A, B) that seem to capture well the informal notions of “roughly the same� and “roughly contained.� The basic idea is to reduce these issues to set intersection problems that can be easily evaluated by a process of random sampling that can be done independently for each document. Furthermore, the resemblance can be evaluated using a fixed size sample for each document. This paper discusses the mathematical properties of these measures and the efficient implementation of the sampling process using Rabin (1981) fingerprintsNot previously uploadedhttp://www.bibsonomy.org/bibtex/278b3f3faced79adfcda4e3a57f7e57ff/mstrohmmstrohm2009-08-19T01:22:38+02:00INFLUENTIAL information-retrieval similarity <span class="authorEditorList"><a href="/author/Broder">A. Broder</a> </span><em>SEQUENCES &#039;97: Proceedings of the Compression and Complexity of Sequences 1997, </em><em>page 21. </em><em>Washington, DC, USA, </em><em>IEEE Computer Society, </em>(<em>1997</em>)Wed Aug 19 01:22:38 CEST 2009Washington, DC, USASEQUENCES '97: Proceedings of the Compression and Complexity of Sequences 199721On the Resemblance and Containment of Documents1997INFLUENTIAL information-retrieval similarity on shingleshttp://www.bibsonomy.org/bibtex/22948189a910501dfdb86469a3e13505a/neilernstneilernst2006-09-25T06:32:37+02:00shingles database <span class="authorEditorList"><a href="/author/Broder">A. Z. Broder</a> </span><em>Compression and Complexity of Sequences, </em><em>page 21--29. </em><em>Salerno, Italy, </em><em>IEEE Computer Society Press, </em>(<em>June 1997</em>)Mon Sep 25 06:32:37 CEST 2006Salerno, ItalyCompression and Complexity of SequencesJune21--29On the resemblance and containment of documents1997shingles database Given two documents A and B we define two mathematical notions: their resemblance r(A, B) and their containment c(A, B) that seem to capture well the informal notions of “roughly the same� and “roughly contained.� The basic idea is to reduce these issues to set intersection problems that can be easily evaluated by a process of random sampling that can be done independently for each document. Furthermore, the resemblance can be evaluated using a fixed size sample for each document. This paper discusses the mathematical properties of these measures and the efficient implementation of the sampling process using Rabin (1981) fingerprintsNot previously uploaded