Dependency Networks for Collaborative Filtering and Data Visualization
Abstract
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 a 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 collaborative filtering (the task of predicting preferences) and the visualization of predictive relationships.
Cite
Text
Heckerman et al. "Dependency Networks for Collaborative Filtering and Data Visualization." Conference on Uncertainty in Artificial Intelligence, 2000.Markdown
[Heckerman et al. "Dependency Networks for Collaborative Filtering and Data Visualization." Conference on Uncertainty in Artificial Intelligence, 2000.](https://mlanthology.org/uai/2000/heckerman2000uai-dependency/)BibTeX
@inproceedings{heckerman2000uai-dependency,
title = {{Dependency Networks for Collaborative Filtering and Data Visualization}},
author = {Heckerman, David and Chickering, David Maxwell and Meek, Christopher and Rounthwaite, Robert and Kadie, Carl Myers},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2000},
pages = {264-273},
url = {https://mlanthology.org/uai/2000/heckerman2000uai-dependency/}
}