Pages that link to "Item:Q5550283"

The following pages link to Approximating discrete probability distributions with dependence trees (Q5550283):

Displaying 50 items.

• Mixture-based estimation of entropy (Q82866) (← links)
• Clustering Data with Nonignorable Missingness using Semi-Parametric Mixture Models (Q118021) (← links)
• On using Bayesian networks for complexity reduction in decision trees (Q257492) (← links)
• Model-based clustering for conditionally correlated categorical data (Q269537) (← links)
• Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers (Q280459) (← links)
• Efficient approximation of probability distributions with \(k\)-order decomposable models (Q282916) (← links)
• Approximating optimally discrete probability distribution with \(k\)th-order dependency for combining multiple decisions (Q287037) (← links)
• Learning a flexible \(K\)-dependence Bayesian classifier from the chain rule of joint probability distribution (Q296380) (← links)
• Reverses of the Jensen inequality in terms of first derivative and applications (Q384115) (← links)
• Discovering a junction tree behind a Markov network by a greedy algorithm (Q402234) (← links)
• Inference and learning with hierarchical shape models (Q408927) (← links)
• Bounded approximate decentralised coordination via the max-sum algorithm (Q543622) (← links)
• Fusion, propagation, and structuring in belief networks (Q578932) (← links)
• Recombination operators and selection strategies for evolutionary Markov chain Monte Carlo algorithms (Q613018) (← links)
• Multi-dimensional classification with Bayesian networks (Q648355) (← links)
• Learning genetic population structures using minimization of stochastic complexity (Q653380) (← links)
• Regularization in discriminant analysis: an overview (Q673293) (← links)
• Probabilistic methods in cancer biology (Q693685) (← links)
• High-dimensional structure estimation in Ising models: local separation criterion (Q693728) (← links)
• Bayesian and quasi-Bayesian estimators for mutual information from discrete data (Q742724) (← links)
• Have I seen you before? Principles of Bayesian predictive classification revisited (Q746252) (← links)
• Operations and evaluation measures for learning possibilistic graphical models (Q814501) (← links)
• Robust inference of trees (Q819944) (← links)
• Discriminative learning of Bayesian network parameters by differential evolution (Q823426) (← links)
• Classification using hierarchical naïve Bayes models (Q851860) (← links)
• Learning decomposable Markov networks in pseudo-independent domains with local evaluation (Q851873) (← links)
• Inference of structures of models of probabilistic dependences from statistical data (Q852242) (← links)
• Reducing the structure space of Bayesian classifiers using some general algorithms (Q894536) (← links)
• Learning extended tree augmented naive structures (Q895526) (← links)
• A scalable pairwise class interaction framework for multidimensional classification (Q895535) (← links)
• Domains of competence of the semi-naive Bayesian network classifiers (Q903594) (← links)
• Reconstructing Markov processes from independent and anonymous experiments (Q906437) (← links)
• Decomposing a relation into a tree of binary relations (Q909447) (← links)
• Methods of constructing Bayesian networks based on scoring functions (Q946743) (← links)
• Distribution of mutual information from complete and incomplete data (Q957142) (← links)
• Supervised classification using probabilistic decision graphs (Q961276) (← links)
• Bayesian classifiers based on kernel density estimation: flexible classifiers (Q962861) (← links)
• High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression (Q973867) (← links)
• Structural-EM for learning PDG models from incomplete data (Q985145) (← links)
• Feature selection for Bayesian network classifiers using the MDL-FS score (Q990984) (← links)
• Boosted Bayesian network classifiers (Q1009291) (← links)
• Estimating high-dimensional intervention effects from observational data (Q1043733) (← links)
• A conditional independence algorithm for learning undirected graphical models (Q1049272) (← links)
• Structuring causal trees (Q1074340) (← links)
• A unique formal system for binary decompositions of database relations, probability distributions, and graphs (Q1177386) (← links)
• Structure identification in relational data (Q1204870) (← links)
• The pattern discrimination problem from the perspective of relation theory (Q1222520) (← links)
• The use of context in pattern recognition (Q1247177) (← links)
• Approximate representation of probabilistic data in expert systems (Q1278337) (← links)
• Inferencing the graphs of causal Markov fields (Q1368483) (← links)