40 search results - page 3 / 8 » Efficient Merging and Filtering Algorithms for Approximate S... |
WWW
2004
ACM
14 years 6 months ago
2004
ACM
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
CPM
1998
Springer
13 years 10 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
GBRPR
2007
Springer
13 years 9 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
LCN
2008
IEEE
14 years 5 days ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
SSDBM
2010
IEEE
13 years 10 months ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....