3777 search results - page 285 / 756 » Estimating the Quality of Databases |
158
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Protecting data privacy is an important problem in microdata distribution. Anonymization algorithms typically aim to protect individual privacy, with minimal impact on the quality...
189
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...
166
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Schema mapping algorithms rely on value correspondences ? i.e., correspondences among semantically related attributes ? to produce complex transformations among data sources. Thes...
148
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Subgroup discovery is a local pattern discovery task, in which descriptions of subpopulations of a database are evaluated against some quality function. As standard quality functio...
168
click to vote
ICDE
2007
IEEE
16 years 29 days ago
2007
IEEE
Querying semantically related data sources depends on the ability to map between their schemas. Unfortunately, in most cases matching between schema is still largely performed man...