Dependency Networks for Inference, Collaborative Filtering, and Data Visualization

D. Heckerman, D.M. Chickering, C. Meek, R. Rounthwaite, and C. Kadie

October 2000

We describe a graphical representation of probabilistic relationships — an alternative to the Bayesian network — called a dependency network. Like a Bayesian network, a dependency network has a graph and probability component. The graph component is a (cyclic) directed graph such that a node's parents render that node independent of all other nodes in the network. The probability component consists of the probability of a node given its parents for each node (as in a Bayesian network). We identify several basic properties of this representation, and describe its use in density estimation, collaborative filtering (the task of predicting preferences), and the visualization of predictive relationships.

Publication type | Article |

Published in | Journal of Machine Learning Research |

URL | http://www.ai.mit.edu/projects/jmlr/ |

Pages | 49-75 |

Volume | 1 |

Number | MSR-TR-2000-16 |

Institution | Microsoft Research |

Publisher | Journal of Machine Learning Research © Copyright 2001, JMLR |

- Asymptotic model selection for directed networks with hidden variables
- Global Partial Orders from Sequential Data
- Improved Approximate Sum-Product Inference Using Multiplicative Error Bounds

> Publications > Dependency Networks for Inference, Collaborative Filtering, and Data Visualization