Sciweavers

Share
1083 search results - page 1 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
9 years 11 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
CORR
2012
Springer
184views Education» more  CORR 2012»
8 years 9 months ago
Noisy-OR Models with Latent Confounding
Given a set of experiments in which varying subsets of observed variables are subject to intervention, we consider the problem of identi´Čüability of causal models exhibiting late...
Antti Hyttinen, Frederick Eberhardt, Patrik O. Hoy...
GIS
2004
ACM
11 years 2 months ago
Efficient detection of motion patterns in spatio-temporal data sets
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,...
Joachim Gudmundsson, Marc J. van Kreveld, Bettina ...
DAWAK
1999
Springer
10 years 5 months ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
11 years 1 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...
books