Difference between revisions of "Heckerman, JMLR 2000"
Line 13: | Line 13: | ||
== Brief description of the method == | == Brief description of the method == | ||
+ | * Consistent Dependency Network | ||
+ | Given a domain of interest having set of finite variables <math>X = (X_1, ... , X_n)</math> with a positive joint distribution <math>p(x)</math>, a consistent dependency network for <math>X</math> is a pair <math>(G, P)</math> where <math>G</math> is a cyclic directed graph and <math>P</math> is a set of conditional probability distributions. | ||
+ | * General Dependency Network | ||
== Experimental Result == | == Experimental Result == |
Revision as of 18:05, 25 September 2011
Contents
Citation
Dependency Networks for Inference, Collaborative Filtering, and Data Visualization. David Heckerman, David Maxwell Chickering, Christopher Meek, Robert Rounthwaite, Carl Kadie; in JMLR, 1(Oct):49-75, 2000
Online version
Summary
In this paper, author describe a graphical model for probabilistic relationship, an alternative to the bayesian network, called dependency network. The dependency network, unlike bayesian network is potentially cyclic. The dependency network are well suited to task of predicting preferences like in collaborative filtering. The dependency network is not good for encoding causal relationship.
Brief description of the method
- Consistent Dependency Network
Given a domain of interest having set of finite variables with a positive joint distribution , a consistent dependency network for is a pair where is a cyclic directed graph and is a set of conditional probability distributions.
- General Dependency Network