Learning with mixtures of trees.
From MaRDI portal
Recommendations
Cited in
(37)- Clustering Data with Nonignorable Missingness using Semi-Parametric Mixture Models
- Discriminant analysis with Gaussian graphical tree models
- Improving mixture tree construction using better EM algorithms
- Hybrid learning of Bayesian multinets for binary classification
- A macro-DAG structure based mixture model
- Multivariate dependence analysis via tree copula models: an application to one-year forward energy contracts
- Learning multi-linear representations of distributions for efficient inference
- An efficient extension to mixture techniques for prediction and decision trees
- Learning a tree-structured Ising model in order to make predictions
- Sum-product graphical models
- Bayesian network modeling of the consensus between experts: an application to neuron classification
- Graphical models for statistical inference and data assimilation
- Induction of hybrid decision tree based on post-discretization strategy
- Model-based clustering for conditionally correlated categorical data
- Supervised classification using hybrid probabilistic decision graphs
- Mixture of Experts Classification Using a Hierarchical Mixture Model
- Learning Bayesian network classifiers by risk minimization
- scientific article; zbMATH DE number 1934581 (Why is no real title available?)
- scientific article; zbMATH DE number 2033331 (Why is no real title available?)
- MN-EDA and the use of clique-based factorisations in EDAs
- scientific article; zbMATH DE number 1928664 (Why is no real title available?)
- scientific article; zbMATH DE number 1931863 (Why is no real title available?)
- Estimating finite mixture of continuous trees using penalized mutual information
- Incomplete graphical model inference via latent tree aggregation
- Beyond trees: classification with sparse pairwise dependencies
- Learning mixed latent tree models
- Machine Learning: ECML 2004
- Detecting irrelevant subtrees to improve probabilistic learning from tree-structured data
- Computer Vision - ECCV 2004
- Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu
- Bayesian detection of event spreading pattern from multivariate binary time series
- Subgroup analysis using Bernoulli‐gated hierarchical mixtures of experts models
- Bayesian feature selection in high-dimensional regression in presence of correlated noise
- Spectral Clustering, Bayesian Spanning Forest, and Forest Process
- Exact sampling of spanning trees via fast-forwarded random walks
- Learning tree-structured distributions
- Latent class models for classification
This page was built for publication: Learning with mixtures of trees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2782276)
