1091 search results - page 79 / 219 » Approximation in Databases |
214
click to vote
VLDB
2006
ACM
16 years 2 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
188
click to vote
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving kanonymity...
115
Voted
CIKM
2007
Springer
15 years 8 months ago
2007
Springer
In this work a method for detecting distance-based outliers in data streams is presented. We deal with the sliding window model, where outlier queries are performed in order to de...
138
click to vote
CINQ
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
108
click to vote
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...