Bayesian networks for data mining

D Heckerman - Data mining and knowledge discovery, 1997 - Springer
A Bayesian network is a graphical model that encodesprobabilistic relationships among
variables of interest. When used inconjunction with statistical techniques, the graphical …

A characterization of Markov equivalence classes for acyclic digraphs

SA Andersson, D Madigan, MD Perlman - The Annals of Statistics, 1997 - projecteuclid.org
Undirected graphs and acyclic digraphs (ADG's), as well as their mutual extension to chain
graphs, are widely used to describe dependencies among variables in multiviarate …

[PDF][PDF] Sistemas expertos y modelos de redes probabilısticas

E Castillo, JM Gutiérrez… - Academia de Ingenierıa, 1997 - computo.fismat.umich.mx
En las dos últimas décadas se ha producido un notable desarrollo en el área de la
inteligencia artificial y, en particular, en la de los sistemas expertos. Debido a su carácter …

[PDF][PDF] Causality in crisis

VR McKim, SP Turner - … of the Notre Dame Conference on …, 1997 - researchgate.net
Since the development of Quetelet's homme moyen in the early nineteenth century, social
scientists have employed statistical concepts and methods to help them understand their …

On the Markov equivalence of chain graphs, undirected graphs, and acyclic digraphs

SA Andersson, D Madigan… - Scandinavian Journal of …, 1997 - Wiley Online Library
Graphical Markov models use undirected graphs (UDGs), acyclic directed graphs (ADGs), or
(mixed) chain graphs to represent possible dependencies among random variables in a …

A recovery algorithm for chain graphs

M Studený - International Journal of Approximate Reasoning, 1997 - Elsevier
The class of chain graphs (CGs) involving both undirected graphs (= Markov networks) and
directed acyclic graphs (= Bayesian networks) was introduced in middle eighties for …

A characterization of Markov equivalence for directed cyclic graphs

T Richardson - International Journal of Approximate Reasoning, 1997 - Elsevier
The concept of d-separation (Pearl, 1988) was originally defined for acyclic directed graphs,
but there is a natural extension of the concept to directed graphs with cycles. When exactly …

On the use of independence relationships for learning simplified belief networks

LM de Campos, JF Huete - International Journal of Intelligent …, 1997 - Wiley Online Library
Belief networks are graphic structures capable of representing dependence and
independence relationships among variables in a given domain of knowledge. We focus on …

A graphical characterization of lattice conditional independence models

SA Andersson, D Madigan, MD Perlman… - Annals of Mathematics …, 1997 - Springer
Lattice conditional independence (LCI) models for multivariate normal data recently have
been introduced for the analysis of non-monotone missing data patterns and of nonnested …

[图书][B] Bayesian model averaging for censored survival models

CT Volinsky - 1997 - search.proquest.com
In this dissertation, I address problems with the standard practice of model selection, which
does not account for the uncertainty in the model selection procedure. Using Bayesian …