English

Fast Learning of Relational Dependency Networks

Machine Learning 2014-12-10 v2

Abstract

A Relational Dependency Network (RDN) is a directed graphical model widely used for multi-relational data. These networks allow cyclic dependencies, necessary to represent relational autocorrelations. We describe an approach for learning both the RDN's structure and its parameters, given an input relational database: First learn a Bayesian network (BN), then transform the Bayesian network to an RDN. Thus fast Bayes net learning can provide fast RDN learning. The BN-to-RDN transform comprises a simple, local adjustment of the Bayes net structure and a closed-form transform of the Bayes net parameters. This method can learn an RDN for a dataset with a million tuples in minutes. We empirically compare our approach to state-of-the art RDN learning methods that use functional gradient boosting, on five benchmark datasets. Learning RDNs via BNs scales much better to large datasets than learning RDNs with boosting, and provides competitive accuracy in predictions.

Keywords

Cite

@article{arxiv.1410.7835,
  title  = {Fast Learning of Relational Dependency Networks},
  author = {Oliver Schulte and Zhensong Qian and Arthur E. Kirkpatrick and Xiaoqian Yin and Yan Sun},
  journal= {arXiv preprint arXiv:1410.7835},
  year   = {2014}
}

Comments

17 pages, 2 figures, 3 tables, Accepted as long paper by ILP 2014, September 14- 16th, Nancy, France. Added the Appendix: Proof of Consistency Characterization

R2 v1 2026-06-22T06:39:35.404Z