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
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, Inference of structures of models of probabilistic dependences from statistical data, A family of block-wise one-factor distributions for modeling high-dimensional binary data, Structure learning in Bayesian networks using regular vines, Inferencing the graphs of causal Markov fields, 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, Bayesian network classifiers, Hybrid learning of Bayesian multinets for binary classification, Reverses of the Jensen inequality in terms of first derivative and applications, Latent tree models for hierarchical topic detection, Recombination operators and selection strategies for evolutionary Markov chain Monte Carlo algorithms, Using hidden nodes in Bayesian networks, Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution, Discovering a junction tree behind a Markov network by a greedy algorithm, Reducing the structure space of Bayesian classifiers using some general algorithms, Learning extended tree augmented naive structures, A scalable pairwise class interaction framework for multidimensional classification, Inference and learning with hierarchical shape models, Using a priori knowledge to create probabilistic models for optimization., Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithms., Learning a tree-structured Ising model in order to make predictions, Beyond independence: an extension of the a contrario decision procedure, Efficient parameter learning of Bayesian network classifiers, Domains of competence of the semi-naive Bayesian network classifiers, Data projections by skewness maximization under scale mixtures of skew-normal vectors, Reconstructing Markov processes from independent and anonymous experiments, Decomposing a relation into a tree of binary relations, Certifiably optimal sparse inverse covariance estimation, A model-free Bayesian classifier, Learning to detect incidents from noisily labeled data, Multi-dimensional classification with Bayesian networks, A circular-linear dependence measure under Johnson-Wehrly distributions and its application in Bayesian networks, Results in statistical discriminant analysis: A review of the former Soviet Union literature., Learning genetic population structures using minimization of stochastic complexity, Bayesian network classifiers for identifying the slope of the customer lifecycle of long-life customers., New estimates for Csiszár divergence and Zipf-Mandelbrot entropy via Jensen-Mercer's inequality, A unique formal system for binary decompositions of database relations, probability distributions, and graphs, Inequalities of the Edmundson-Lah-Ribarič type for \(n\)-convex functions with applications, Kernel mixture model for probability density estimation in Bayesian classifiers, Regularization in discriminant analysis: an overview, A decomposition-based algorithm for learning the structure of multivariate regression chain graphs, Methods of constructing Bayesian networks based on scoring functions, High-dimensional consistency in score-based and hybrid structure learning, Scalability of using restricted Boltzmann machines for combinatorial optimization, Distribution of mutual information from complete and incomplete data, A global approach for learning sparse Ising models, Supervised classification using probabilistic decision graphs, Bayesian classifiers based on kernel density estimation: flexible classifiers, Structure identification in relational data, Probabilistic methods in cancer biology, High-dimensional structure estimation in Ising models: local separation criterion, Smaller feature subset selection for real-world datasets using a new mutual information with Gaussian gain, Copula selection for graphical models in continuous estimation of distribution algorithms, Bounded approximate decentralised coordination via the max-sum algorithm, Greedy learning of latent tree models for multidimensional clustering, High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression, Mixture-based estimation of entropy, The pattern discrimination problem from the perspective of relation theory, Associative naïve Bayes classifier: automated linking of gene ontology to medline documents, 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, Structural-EM for learning PDG models from incomplete data, Fusion, propagation, and structuring in belief networks, Feature selection for Bayesian network classifiers using the MDL-FS score, Clustering Data with Nonignorable Missingness using Semi-Parametric Mixture Models, The use of context in pattern recognition, Boosted Bayesian network classifiers, Bayesian and quasi-Bayesian estimators for mutual information from discrete data, Have I seen you before? Principles of Bayesian predictive classification revisited, Epidemiologic network inference, Discriminant analysis for discrete variables derived from a tree-structured graphical model, Sum-product graphical models, Possibilistic conditional independence: A similarity-based measure and its application to causal network learning, A prallel algorithm for building possibilistic causal networks, Approximate representation of probabilistic data in expert systems, \textsc{Strudel}: A fast and accurate learner of structured-decomposable probabilistic circuits, 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, Estimating high-dimensional intervention effects from observational data, A conditional independence algorithm for learning undirected graphical models, Maximum likelihood bounded tree-width Markov networks, Learning Bayesian networks from data: An information-theory based approach, Prior knowledge for learning networks in non-probabilistic settings, Operations and evaluation measures for learning possibilistic graphical models, On using Bayesian networks for complexity reduction in decision trees, Structuring causal trees, 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, 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, Sparse nonparametric graphical models, The Costs of Ignoring High-Order Correlations in Populations of Model Neurons, 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
