1083 search results - page 1 / 217 » Efficient Discovery of Confounders in Large Data Sets |
ICDM
2009
IEEE
13 years 2 months ago
2009
IEEE
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
CORR
2012
Springer
12 years 7 days ago
2012
Springer
Given a set of experiments in which varying subsets of observed variables are subject to intervention, we consider the problem of identifiability of causal models exhibiting late...
GIS
2004
ACM
14 years 5 months ago
2004
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock,...
DAWAK
1999
Springer
13 years 8 months ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
KDD
2006
ACM
14 years 4 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...