178 search results - page 3 / 36 » Measuring quality of similarity functions in approximate dat... |
PVLDB
2010
13 years 4 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
DEXAW
2002
IEEE
13 years 11 months ago
2002
IEEE
We investigate techniques for similarity analysis of spatio-temporal trajectories for mobile objects. Such kind of data may contain a great amount of outliers, which degrades the ...
ISDA
2009
IEEE
14 years 24 days ago
2009
IEEE
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
KDD
2003
ACM
14 years 6 months ago
2003
ACM
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied...