15 search results - page 1 / 3 » Supporting Similarity Operations Based on Approximate String... |
COOPIS
2004
IEEE
13 years 8 months ago
2004
IEEE
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
DEBU
2010
13 years 5 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
BTW
2009
Springer
13 years 11 months ago
2009
Springer
: Frequent successful publications by specific institutions are indicators for identifying outstanding centres of research. This institution data are present in scholarly papers as...
AAAI
2010
13 years 6 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...