Leveraging Node Attributes for Incomplete Relational Data
Machine Learning
2017-06-15 v1 Machine Learning
Social and Information Networks
Abstract
Relational data are usually highly incomplete in practice, which inspires us to leverage side information to improve the performance of community detection and link prediction. This paper presents a Bayesian probabilistic approach that incorporates various kinds of node attributes encoded in binary form in relational models with Poisson likelihood. Our method works flexibly with both directed and undirected relational networks. The inference can be done by efficient Gibbs sampling which leverages sparsity of both networks and node attributes. Extensive experiments show that our models achieve the state-of-the-art link prediction results, especially with highly incomplete relational data.
Cite
@article{arxiv.1706.04289,
title = {Leveraging Node Attributes for Incomplete Relational Data},
author = {He Zhao and Lan Du and Wray Buntine},
journal= {arXiv preprint arXiv:1706.04289},
year = {2017}
}
Comments
Appearing in ICML 2017