Sciweavers

1246 search results - page 3 / 250
» High Performance Clustering Based on the Similarity Join
Sort
View
DEXA
2003
Springer
193views Database» more  DEXA 2003»
15 years 2 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
15 years 1 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
IDEAS
2009
IEEE
192views Database» more  IDEAS 2009»
15 years 4 months ago
A cluster-based approach to XML similarity joins
A natural consequence of the widespread adoption of XML as standard for information representation and exchange is the redundant storage of large amounts of persistent XML documen...
Leonardo Ribeiro, Theo Härder, Fernanda S. Pi...
ICDE
2009
IEEE
194views Database» more  ICDE 2009»
15 years 11 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...
ICDE
2010
IEEE
801views Database» more  ICDE 2010»
15 years 9 months ago
The Similarity Join Database Operator
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
Mohamed H. Ali, Walid G. Aref, Yasin N. Silva