Approximating discrete probability distributions with dependence trees
From MaRDI portal
Publication:5550283
Recommendations
- Approximating optimally discrete probability distribution with \(k\)th-order dependency for combining multiple decisions
- Approximation of multidimensional distribution through two-dimensional distributions in both discrete and continuous case
- Robust inference of trees
- Comparison of two methods for approximation of probability distributions with prescribed marginals
- scientific article; zbMATH DE number 67622
Cited in
(only showing first 100 items - show all)- Learning Bayesian network classifiers: Searching in a space of partially directed acyclic graphs
- A prallel algorithm for building possibilistic causal networks
- A unified framework for structured graph learning via spectral constraints
- Bayesian classifiers based on kernel density estimation: flexible classifiers
- Sparse nonparametric graphical models
- Decomposing a relation into a tree of binary relations
- Boosted Bayesian network classifiers
- Feature selection for Bayesian network classifiers using the MDL-FS score
- A NEW DIRECTED DIVERGENCE MEASURE AND ITS CHARACTERIZATION∗
- Copula selection for graphical models in continuous estimation of distribution algorithms
- Discovering a junction tree behind a Markov network by a greedy algorithm
- Rainfall data simulation by hidden Markov model and discrete wavelet transformation
- Multi-dimensional classification with Bayesian networks
- TAN classifiers based on decomposable distributions
- Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution
- Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers
- Structure identification in relational data
- Linear estimating equations for exponential families with application to Gaussian linear concentration models
- Efficient approximation of probability distributions with \(k\)-order decomposable models
- Discrete Bayesian network classifiers: a survey
- Approximating optimally discrete probability distribution with \(k\)th-order dependency for combining multiple decisions
- Bounded approximate decentralised coordination via the max-sum algorithm
- Density estimation with distribution element trees
- Learning extended tree augmented naive structures
- Learning from imprecise data: possibilistic graphical models.
- Inference and learning with hierarchical shape models
- Structural extension to logistic regression: Discriminative parameter learning of belief net classifiers
- Regularization in discriminant analysis: an overview
- Robust inference of trees
- Structuring causal trees
- Recombination operators and selection strategies for evolutionary Markov chain Monte Carlo algorithms
- Bayesian network classifiers
- Mixture-based estimation of entropy
- Learning Bayesian networks from data: An information-theory based approach
- Comparison of two methods for approximation of probability distributions with prescribed marginals
- Classification using hierarchical naïve Bayes models
- A backward selection procedure for approximating a discrete probability distribution by decomposable models
- An optimization-based approach for the design of Bayesian networks
- scientific article; zbMATH DE number 3872489 (Why is no real title available?)
- On using Bayesian networks for complexity reduction in decision trees
- Bayesian network classifiers for identifying the slope of the customer lifecycle of long-life customers.
- Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithms.
- Maximum likelihood bounded tree-width Markov networks
- Fusion, propagation, and structuring in belief networks
- A conditional independence algorithm for learning undirected graphical models
- Bayesian and quasi-Bayesian estimators for mutual information from discrete data
- High-dimensional structure estimation in Ising models: local separation criterion
- Estimating high-dimensional intervention effects from observational data
- Efficient parameter learning of Bayesian network classifiers
- Some reverses of the Jensen inequality with applications
- A copulas-based approach to modeling dependence in decision trees
- Probabilistic methods in cancer biology
- Model-based clustering for conditionally correlated categorical data
- General decompositions of multiattribute utility functions with partial utility independence
- Reverses of the Jensen inequality in terms of first derivative and applications
- Inference of structures of models of probabilistic dependences from statistical data
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- Have I seen you before? Principles of Bayesian predictive classification revisited
- A hybrid methodology for learning belief networks: BENEDICT
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
- Beyond independence: an extension of the a contrario decision procedure
- Learning genetic population structures using minimization of stochastic complexity
- Approximate inverse Ising models close to a Bethe reference point
- Results in statistical discriminant analysis: A review of the former Soviet Union literature.
- Learning a flexible \(K\)-dependence Bayesian classifier from the chain rule of joint probability distribution
- A family of block-wise one-factor distributions for modeling high-dimensional binary data
- A discrete-valued clustering algorithm with applications to biomolecular data
- A focused information criterion for graphical models
- Recoverability from direct quantum correlations
- A unique formal system for binary decompositions of database relations, probability distributions, and graphs
- Distribution of mutual information from complete and incomplete data
- Classification using hierarchical Naïve Bayes models
- Clustering Data with Nonignorable Missingness using Semi-Parametric Mixture Models
- scientific article; zbMATH DE number 4080503 (Why is no real title available?)
- Using a priori knowledge to create probabilistic models for optimization.
- scientific article; zbMATH DE number 7370598 (Why is no real title available?)
- Graphical models for statistical inference and data assimilation
- \textsc{Strudel}: A fast and accurate learner of structured-decomposable probabilistic circuits
- Bayesian detection of event spreading pattern from multivariate binary time series
- Generalizations of Levinson type inequalities via new Green functions with applications to information theory
- Safe projections of binary data sets
- A circular-linear dependence measure under Johnson-Wehrly distributions and its application in Bayesian networks
- Supervised classification using probabilistic decision graphs
- scientific article; zbMATH DE number 7626718 (Why is no real title available?)
- Scalability of using restricted Boltzmann machines for combinatorial optimization
- A survey of reverse inequalities for \(f\)-divergence measure in information theory
- Scatter search in software testing, comparison and collaboration with estimation of distribution algorithms
- Using hidden nodes in Bayesian networks
- Epidemiologic network inference
- Approximate representation of probabilistic data in expert systems
- Inequalities of the Jensen and Edmundson-Lah-Ribarič type for 3-convex functions with applications
- The perfect marriage and much more: combining dimension reduction, distance measures and covariance
- What to expect from a set of itemsets?
- Probabilistic interactive models of data base clustering for document retrieval systems
- Estimation of divergences on time scales via the Green function and Fink's identity
- A global approach for learning sparse Ising models
- The taxicab sampler: MCMC for discrete spaces with application to tree models
- The pattern discrimination problem from the perspective of relation theory
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
- scientific article; zbMATH DE number 4084718 (Why is no real title available?)
This page was built for publication: Approximating discrete probability distributions with dependence trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5550283)
