1083 search results - page 77 / 217 » Efficient Discovery of Confounders in Large Data Sets |
206
click to vote
DPD
2006
15 years 6 months ago
2006
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
175
click to vote
PVLDB
2008
15 years 5 months ago
2008
Dirty data is a serious problem for businesses leading to incorrect decision making, inefficient daily operations, and ultimately wasting both time and money. Dirty data often ari...
158
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
We introduce the Multi-Structural Database, a new data framework to support efficient analysis of large, complex data sets. An instance of the model consists of a set of data obje...
176
click to vote
VLDB
1997
ACM
15 years 9 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
161
click to vote
JMLR
2010
15 years 1 months ago
2010
Collapsed Gibbs sampling is a frequently applied method to approximate intractable integrals in probabilistic generative models such as latent Dirichlet allocation. This sampling ...