528 search results - page 17 / 106 » Structure learning with independent non-identically distribu... |
TSP
2010
13 years 2 months ago
2010
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
ECML
1997
Springer
14 years 2 days ago
1997
Springer
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...
JMLR
2010
13 years 2 months ago
2010
Deep belief networks are a powerful way to model complex probability distributions. However, it is difficult to learn the structure of a belief network, particularly one with hidd...
IJAR
2010
13 years 6 months ago
2010
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...