Approximating discrete probability distributions with dependence trees
From MaRDI portal
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)- Boosted Bayesian network classifiers
- Estimating high-dimensional intervention effects from observational data
- A conditional independence algorithm for learning undirected graphical models
- Structuring causal trees
- A unique formal system for binary decompositions of database relations, probability distributions, and graphs
- Clustering Data with Nonignorable Missingness using Semi-Parametric Mixture Models
- Structure identification in relational data
- The pattern discrimination problem from the perspective of relation theory
- The use of context in pattern recognition
- Approximate representation of probabilistic data in expert systems
- Inferencing the graphs of causal Markov fields
- Bayesian network classifiers
- Using hidden nodes in Bayesian networks
- Using a priori knowledge to create probabilistic models for optimization.
- Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithms.
- Results in statistical discriminant analysis: A review of the former Soviet Union literature.
- Bayesian network classifiers for identifying the slope of the customer lifecycle of long-life customers.
- Density estimation with distribution element trees
- Learning Bayesian networks from data: An information-theory based approach
- Prior knowledge for learning networks in non-probabilistic settings
- Discriminant analysis with Gaussian graphical tree models
- Accurate parameter estimation for Bayesian network classifiers using hierarchical Dirichlet processes
- Predicting pediatric clinic no-shows: a decision analytic framework using elastic net and Bayesian belief network
- A generalization of HH \(f\)-divergence
- A family of block-wise one-factor distributions for modeling high-dimensional binary data
- Structure learning in Bayesian networks using regular vines
- Hybrid learning of Bayesian multinets for binary classification
- Latent tree models for hierarchical topic detection
- Efficient parameter learning of Bayesian network classifiers
- Kernel mixture model for probability density estimation in Bayesian classifiers
- Scalability of using restricted Boltzmann machines for combinatorial optimization
- Structural extension to logistic regression: Discriminative parameter learning of belief net classifiers
- TAN classifiers based on decomposable distributions
- Learning Bayesian network classifiers: Searching in a space of partially directed acyclic graphs
- Possibilistic conditional independence: A similarity-based measure and its application to causal network learning
- A prallel algorithm for building possibilistic causal networks
- Maximum likelihood bounded tree-width Markov networks
- Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution
- Beyond independence: an extension of the a contrario decision procedure
- Learning to detect incidents from noisily labeled data
- High-dimensional consistency in score-based and hybrid structure learning
- A global approach for learning sparse Ising models
- Smaller feature subset selection for real-world datasets using a new mutual information with Gaussian gain
- \textsc{Strudel}: A fast and accurate learner of structured-decomposable probabilistic circuits
- The perfect marriage and much more: combining dimension reduction, distance measures and covariance
- Estimation of divergences on time scales via the Green function and Fink's identity
- Learning a tree-structured Ising model in order to make predictions
- Data projections by skewness maximization under scale mixtures of skew-normal vectors
- Certifiably optimal sparse inverse covariance estimation
- A model-free Bayesian classifier
- A circular-linear dependence measure under Johnson-Wehrly distributions and its application in Bayesian networks
- New estimates for Csiszár divergence and Zipf-Mandelbrot entropy via Jensen-Mercer's inequality
- Inequalities of the Edmundson-Lah-Ribarič type for \(n\)-convex functions with applications
- A decomposition-based algorithm for learning the structure of multivariate regression chain graphs
- Copula selection for graphical models in continuous estimation of distribution algorithms
- Greedy learning of latent tree models for multidimensional clustering
- Associative naïve Bayes classifier: automated linking of gene ontology to medline documents
- Epidemiologic network inference
- Discriminant analysis for discrete variables derived from a tree-structured graphical model
- Sum-product graphical models
- Rainfall data simulation by hidden Markov model and discrete wavelet transformation
- Combining gene expression data and prior knowledge for inferring gene regulatory networks via Bayesian networks using structural restrictions
- Property testing in high-dimensional Ising models
- Estimation of positive definite M-matrices and structure learning for attractive Gaussian Markov random fields
- Linear estimating equations for exponential families with application to Gaussian linear concentration models
- Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks
- Graphical models for statistical inference and data assimilation
- A novel Chow-Liu algorithm and its application to gene differential analysis
- Characteristic imsets for learning Bayesian network structure
- An optimization-based approach for the design of Bayesian networks
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
- A formal approach to using data distributions for building causal polytree structures
- Safe projections of binary data sets
- Classification using hierarchical Naïve Bayes models
- Supervised classification with conditional Gaussian networks: increasing the structure complexity from naive Bayes
- Scatter search in software testing, comparison and collaboration with estimation of distribution algorithms
- On using Bayesian networks for complexity reduction in decision trees
- Artificial intelligence in healthcare operations to enhance treatment outcomes: a framework to predict lung cancer prognosis
- Model-based clustering for conditionally correlated categorical data
- A survey of reverse inequalities for f-divergence measure in information theory
- Robustness to dependency in portfolio optimization using overlapping marginals
- Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers
- Efficient approximation of probability distributions with \(k\)-order decomposable models
- Copulas in machine learning
- Approximating optimally discrete probability distribution with \(k\)th-order dependency for combining multiple decisions
- A copulas-based approach to modeling dependence in decision trees
- General Lebesgue integral inequalities of Jensen and Ostrowski type for differentiable functions whose derivatives in absolute value are h-convex and applications
- Learning a flexible \(K\)-dependence Bayesian classifier from the chain rule of joint probability distribution
- Polyhedral approaches to learning Bayesian networks
- General decompositions of multiattribute utility functions with partial utility independence
- Mixture of Markov trees for Bayesian network structure learning with small datasets in high dimensional space
- Analyzing Markov random fields using t-cherry junction tree structures
- Evaluating Bayesian networks via data streams
- Approximate inverse Ising models close to a Bethe reference point
- Sparse model selection in the highly under-sampled regime
- scientific article; zbMATH DE number 3872489 (Why is no real title available?)
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- A NEW DIRECTED DIVERGENCE MEASURE AND ITS CHARACTERIZATION∗
- Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
- A Discriminative Learning Method of TAN Classifier
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)
