Greedy learning of latent tree models for multidimensional clustering
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5547949 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 2188755 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- 10.1162/153244303321897735
- A survey on latent tree models and applications
- Approximating discrete probability distributions with dependence trees
- Bayes Factors
- Biological Sequence Analysis
- Comparison of phylogenetic trees
- Discovery of latent structures: experience with the CoIL challenge 2000 data set
- Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
- Elements of Information Theory
- Estimating the dimension of a model
- Hierarchical latent class models for cluster analysis
- Learning latent tree graphical models
- Model-based methods to identify multiple cluster structures in a data set
- Model-based multidimensional clustering of categorical data
Cited in
(5)- Modelling the role of variables in model-based cluster analysis
- scientific article; zbMATH DE number 6680234 (Why is no real title available?)
- UC-LTM: unidimensional clustering using latent tree models for discrete data
- Latent tree models for hierarchical topic detection
- Paralinear distance and its algorithm for hierarchical clustering of high-dimensional discrete variables
This page was built for publication: Greedy learning of latent tree models for multidimensional clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260930)