Sciweavers

15 search results - page 1 / 3
» Supporting Similarity Operations Based on Approximate String...
Sort
View
COOPIS
2004
IEEE
14 years 2 months ago
Supporting Similarity Operations Based on Approximate String Matching on the Web
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...
Eike Schallehn, Ingolf Geist, Kai-Uwe Sattler
DEBU
2010
108views more  DEBU 2010»
13 years 11 months ago
Weighted Set-Based String Similarity
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...
Marios Hadjieleftheriou, Divesh Srivastava
BTW
2009
Springer
145views Database» more  BTW 2009»
14 years 5 months ago
Towards web Supported Identification of Top Affiliations from Scholarly Papers
: Frequent successful publications by specific institutions are indicators for identifying outstanding centres of research. This institution data are present in scholarly papers as...
David Aumüller
AAAI
2010
14 years 20 days ago
Fast Algorithms for Top-k Approximate String Matching
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 ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
VLDB
2007
ACM
107views Database» more  VLDB 2007»
14 years 11 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
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 ...
Chen Li, Bin Wang, Xiaochun Yang