https://www.bibsonomy.org/user/stroeh/shingleBibSonomy RSS Feed for /user/stroeh/shinglecan now generate all pairs $i,j$ for which $x_i^\pi$ is present in both their sketches. From these we can compute, for each pair $i,j$ with non-zero sketch overlap, a count of the number of $x_i^\pi$ values they have in common. By applying a preset threshold, we know which pairs $i,j$ have heavily overlapping sketches. For instance, if the threshold were 80%, we would need the count to be at least 160 for any $i,j$. As we identify such pairs, we run the union-find to group documents into near-duplicate ``syntactic clusters''. This is essentially a variant of the single-link clustering algorithm introduced in Section 17.2 (page [*]). http://nlp.stanford.edu/IR-book/html/htmledition/near-duplicates-and-shingling-1.htmlstroeh2011-03-09T13:51:35+01:00duplicate near shingle shingling <span itemprop="description">can now generate all pairs $i,j$ for which $x_i^\pi$ is present in both their sketches. From these we can compute, for each pair $i,j$ with non-zero sketch overlap, a count of the number of $x_i^\pi$ values they have in common. By applying a preset threshold, we know which pairs $i,j$ have heavily overlapping sketches. For instance, if the threshold were 80%, we would need the count to be at least 160 for any $i,j$. As we identify such pairs, we run the union-find to group documents into near-duplicate ``syntactic clusters&#039;&#039;. This is essentially a variant of the single-link clustering algorithm introduced in Section 17.2 (page [*]). </span>http://www.std.org/~msm/common/clustering.htmlstroeh2011-03-09T13:46:59+01:00resemblance shingle ähnlichkeitsmaß <a itemprop="url" data-versiondate="2011-03-09T13:46:59+01:00" href="http://www.std.org/~msm/common/clustering.html" rel="nofollow" class="description-link">http://www.std.org/~msm/common/clustering.html</a>http://de.wikipedia.org/wiki/N-Grammstroeh2011-03-09T13:07:34+01:00bigramm n-gramm shingle trigramm <a itemprop="url" data-versiondate="2011-03-09T13:07:34+01:00" href="http://de.wikipedia.org/wiki/N-Gramm" rel="nofollow" class="description-link">http://de.wikipedia.org/wiki/N-Gramm</a>http://en.wikipedia.org/wiki/W-shinglingstroeh2011-03-09T12:57:28+01:00detection duplicate shingle shingling w-shingling ähnlichkeitsmaß <a itemprop="url" data-versiondate="2011-03-09T12:57:28+01:00" href="http://en.wikipedia.org/wiki/W-shingling" rel="nofollow" class="description-link">http://en.wikipedia.org/wiki/W-shingling</a>