Approximating discrete probability distributions with dependence trees
From MaRDI portal
Publication:5550283
DOI10.1109/TIT.1968.1054142zbMath0165.22305OpenAlexW2163166770MaRDI QIDQ5550283
No author found.
Publication date: 1968
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1968.1054142
Related Items (only showing first 100 items - show all)
Efficient learning of discrete graphical models* ⋮ Graphical models for complex networks: an application to Italian museums ⋮ 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 ⋮ Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models ⋮ A Unified Framework for Structured Graph Learning via Spectral Constraints ⋮ Graphical Models and Message-Passing Algorithms: Some Introductory Lectures ⋮ An optimization-based approach for the design of Bayesian networks ⋮ Inequalities of the Jensen and Edmundson-Lah-Ribarič type for 3-convex functions with applications ⋮ Evaluating Bayesian Networks via Data Streams ⋮ Estimating finite mixture of continuous trees using penalized mutual information ⋮ Algorithms for computing estimates in document retrieval systems ⋮ A NEW DIRECTED DIVERGENCE MEASURE AND ITS CHARACTERIZATION∗ ⋮ Unnamed Item ⋮ Artificial intelligence in healthcare operations to enhance treatment outcomes: a framework to predict lung cancer prognosis ⋮ Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis ⋮ Generative modeling via tree tensor network states ⋮ General Lebesgue integral inequalities of Jensen and Ostrowski type for differentiable functions whose derivatives in absolute value are h-convex and applications ⋮ Identifiability in robust estimation of tree structured models ⋮ Region selection in Markov random fields: Gaussian case ⋮ Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms ⋮ Bayesian detection of event spreading pattern from multivariate binary time series ⋮ Spectral Bayesian network theory ⋮ Generalizations of Levinson type inequalities via new Green functions with applications to information theory ⋮ Bounds of some divergence measures using Hermite polynomial via diamond integrals on time scales ⋮ What to expect from a set of itemsets? ⋮ A Discriminative Learning Method of TAN Classifier ⋮ Polyhedral approaches to learning Bayesian networks ⋮ Structure estimation for discrete graphical models: generalized covariance matrices and their inverses ⋮ AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms ⋮ Learning Minimal Latent Directed Information Polytrees ⋮ Inferring gene regulatory networks by an order independent algorithm using incomplete data sets ⋮ Incomplete graphical model inference via latent tree aggregation ⋮ Approximate inverse Ising models close to a Bethe reference point ⋮ General decompositions of multiattribute utility functions with partial utility independence ⋮ Sparse model selection in the highly under-sampled regime ⋮ Mixture of Markov Trees for Bayesian Network Structure Learning with Small Datasets in High Dimensional Space ⋮ Unnamed Item ⋮ Adaptive Evolutionary Algorithm Based on a Cliqued Gibbs Sampling over Graphical Markov Model Structure ⋮ The Gaussian Polytree EDA with Copula Functions and Mutations ⋮ SOME REVERSES OF THE JENSEN INEQUALITY WITH APPLICATIONS ⋮ A formal approach to using data distributions for building causal polytree structures ⋮ Safe projections of binary data sets ⋮ A hybrid methodology for learning belief networks: BENEDICT ⋮ Classification using hierarchical Naïve Bayes models ⋮ Feature selection based on the best-path algorithm in high dimensional graphical models ⋮ Learning polynomial transformations via generalized tensor decompositions ⋮ A Survey of Reverse Inequalities for f-Divergence Measure in Information Theory ⋮ Independency relationships and learning algorithms for singly connected networks ⋮ A discrete-valued clustering algorithm with applications to biomolecular data ⋮ Supervised classification with conditional Gaussian networks: increasing the structure complexity from naive Bayes ⋮ Learning from imprecise data: possibilistic graphical models. ⋮ Robustness to Dependency in Portfolio Optimization Using Overlapping Marginals ⋮ A Bayesian network model for surface roughness prediction in the machining process ⋮ A focused information criterion for graphical models ⋮ Paralinear distance and its algorithm for hierarchical clustering of high-dimensional discrete variables ⋮ Sparse nonparametric graphical models ⋮ Statistical learning methods for information security: fundamentals and case studies ⋮ Bayesian networks for evaluating climate change influence in olive crops in Andalusia, Spain ⋮ Bayesian inference of graph-based dependencies from mixed-type data ⋮ Tensor recovery in high-dimensional Ising models ⋮ Statistical computational learning ⋮ Belief graphical models for uncertainty representation and reasoning ⋮ Generalizations of Levinson-type inequalities via new Green functions and Hermite interpolating polynomial ⋮ Applications of hybrid dynamic Bayesian networks to water reservoir management ⋮ The Costs of Ignoring High-Order Correlations in Populations of Model Neurons ⋮ Unnamed Item ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Worst-Case Expected Shortfall with Univariate and Bivariate Marginals ⋮ Property testing in high-dimensional Ising models ⋮ Unnamed Item ⋮ Copulas in Machine Learning ⋮ Scatter search in software testing, comparison and collaboration with estimation of distribution algorithms ⋮ Retrieval models in on-line documentary information systems: An analytic review ⋮ Probabilistic interactive models of data base clustering for document retrieval systems ⋮ 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 ⋮ Recoverability from direct quantum correlations ⋮ Unnamed Item ⋮ Discrete Bayesian Network Classifiers ⋮ Robust inference of trees ⋮ Model-based clustering for conditionally correlated categorical data ⋮ Discriminative learning of Bayesian network parameters by differential evolution ⋮ Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers ⋮ Discriminant analysis with Gaussian graphical tree models ⋮ Efficient approximation of probability distributions with \(k\)-order decomposable models ⋮ Approximating optimally discrete probability distribution with \(k\)th-order dependency for combining multiple decisions ⋮ Learning a flexible \(K\)-dependence Bayesian classifier from the chain rule of joint probability distribution ⋮ 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 ⋮ Classification using hierarchical naïve Bayes models ⋮ Learning decomposable Markov networks in pseudo-independent domains with local evaluation
This page was built for publication: Approximating discrete probability distributions with dependence trees
