1731 search results - page 112 / 347 » Maximum likelihood analysis of algorithms and data structure... |
SDM
2003
SIAM
13 years 9 months ago
2003
SIAM
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
WWW
2010
ACM
14 years 3 months ago
2010
ACM
The Web abounds with dyadic data that keeps increasing by every single second. Previous work has repeatedly shown the usefulness of extracting the interaction structure inside dya...
DAWAK
2010
Springer
13 years 9 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
ICPR
2000
IEEE
14 years 9 months ago
2000
IEEE
The deconvolution of blurred and noisy satellite images is an ill-posed inverse problem, which can be regularized within a Bayesian context by using an a priori model of the recon...