pith. sign in

arxiv: 1301.3862 · v1 · pith:6P73QUEDnew · submitted 2013-01-16 · 💻 cs.AI · cs.IR· cs.LG

Dependency Networks for Collaborative Filtering and Data Visualization

classification 💻 cs.AI cs.IRcs.LG
keywords networkdependencybayesiandescribecollaborativedatafilteringgraph
0
0 comments X
read the original abstract

We describe a graphical model for probabilistic relationships---an alternative to the Bayesian network---called a dependency network. The graph of a dependency network, unlike a Bayesian network, is potentially cyclic. The probability component of a dependency network, like a Bayesian network, is a set of conditional distributions, one for each node given its parents. We identify several basic properties of this representation and describe a computationally efficient procedure for learning the graph and probability components from data. We describe the application of this representation to probabilistic inference, collaborative filtering (the task of predicting preferences), and the visualization of acausal predictive relationships.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Discrete Stochastic Localization for Non-autoregressive Generation

    cs.LG 2026-02 unverdicted novelty 7.0

    Discrete Stochastic Localization lets a single trained network support an entire family of per-token SNR paths for discrete sequence generation, with masked diffusion as a special case, and improves MAUVE scores when ...