Name
Abstract | ||
|---|---|---|
We present a Bayesian search algorithm for learning the structure of latent variable models of continuous variables. We stress the importance of applying search operators designed especially for the parametric family used in our models. This is performed by searching for subsets of the observed variables whose covariance matrix can be represented as a sum of a matrix of low rank and a diagonal matrix of residuals. The resulting search procedure is relatively efficient, since the main search operator has a branch factor that grows linearly with the number of variables. The resulting models are often simpler and give a better fit than models based on generalizations of factor analysis or those derived from standard hill-climbing methods. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1145/1143844.1143948 | ICML |
Keywords | Field | DocType |
structural model,search operator,covariance matrix,resulting search procedure,bayesian search algorithm,continuous variable,better fit,factor analysis,branch factor,diagonal matrix,main search operator,graphical models,relative efficiency,bayesian learning,latent variable,hill climbing,bayesian inference,search algorithm | Variable-order Bayesian network,Parametric family,Matrix (mathematics),Latent variable model,Latent variable,Artificial intelligence,Covariance matrix,Graphical model,Diagonal matrix,Machine learning,Mathematics | Conference |
ISBN | Citations | PageRank |
1-59593-383-2 | 4 | 0.50 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ricardo Bezerra de Andrade e Silva | 1 | 109 | 24.56 |
| Richard Scheines | 2 | 256 | 37.19 |