Greedy learning of latent tree models for multidimensional clustering

DOI10.1007/S10994-013-5393-0zbMATH Open1321.68408OpenAlexW2112733287MaRDI QIDQ2260930FDOQ2260930

Authors: Tengfei Liu, Nevin L. Zhang, Peixian Chen, April Hua Liu, Leonard K. M. Poon, Yi Wang 

Publication date: 12 March 2015

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-013-5393-0

Recommendations

• UC-LTM: unidimensional clustering using latent tree models for discrete data
• Learning latent tree graphical models
• Model-based multidimensional clustering of categorical data
• A tractable multi-partitions clustering
• Hierarchical latent class models for cluster analysis

zbMATH Keywords

model-based clusteringlatent tree modelsmultiple partitions

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Estimating the dimension of a model
• Title not available (Why is that?)
• Elements of Information Theory
• Model-based multidimensional clustering of categorical data
• Biological Sequence Analysis
• Comparison of phylogenetic trees
• Title not available (Why is that?)
• Bayes Factors
• Approximating discrete probability distributions with dependence trees
• Title not available (Why is that?)
• 10.1162/153244303321897735
• Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
• Title not available (Why is that?)
• Hierarchical latent class models for cluster analysis
• Learning latent tree graphical models
• Title not available (Why is that?)
• Discovery of latent structures: experience with the CoIL challenge 2000 data set
• Model-based methods to identify multiple cluster structures in a data set
• A survey on latent tree models and applications

Cited In (5)

• Modelling the role of variables in model-based cluster analysis
• Title not available (Why is that?)
• 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)