Sciweavers

43 search results - page 1 / 9
» Efficient similarity joins for near duplicate detection
Sort
View
WWW
2008
ACM
14 years 5 months ago
Efficient similarity joins for near duplicate detection
With the increasing amount of data and the need to integrate data from multiple data sources, a challenging issue is to find near duplicate records efficiently. In this paper, we ...
Chuan Xiao, Wei Wang 0011, Xuemin Lin, Jeffrey Xu ...
ICDE
2009
IEEE
194views Database» more  ICDE 2009»
14 years 6 months ago
Top-k Set Similarity Joins
Abstract-- Similarity join is a useful primitive operation underlying many applications, such as near duplicate Web page detection, data integration, and pattern recognition. Tradi...
Chuan Xiao, Wei Wang 0011, Xuemin Lin, Haichuan Sh...
ESWS
2010
Springer
13 years 8 months ago
Efficient Semantic-Aware Detection of Near Duplicate Resources
Abstract. Efficiently detecting near duplicate resources is an important task when integrating information from various sources and applications. Once detected, near duplicate reso...
Ekaterini Ioannou, Odysseas Papapetrou, Dimitrios ...
SIGIR
2008
ACM
13 years 5 months ago
SpotSigs: robust and efficient near duplicate detection in large web collections
Motivated by our work with political scientists who need to manually analyze large Web archives of news sites, we present SpotSigs, a new algorithm for extracting and matching sig...
Martin Theobald, Jonathan Siddharth, Andreas Paepc...
PVLDB
2010
126views more  PVLDB 2010»
13 years 3 months ago
Set Similarity Join on Probabilistic Data
Set similarity join has played an important role in many real-world applications such as data cleaning, near duplication detection, data integration, and so on. In these applicati...
Xiang Lian, Lei Chen 0002