Learning Scale-Free Networks by Dynamic Node Specific Degree Prior

  title={Learning Scale-Free Networks by Dynamic Node Specific Degree Prior},
  author={Qingming Tang and Siqi Sun and Jinbo Xu},
Learning network structure underlying data is an important problem in machine learning. This paper presents a novel degree prior to study the inference of scale-free networks, which are widely used to model social and biological networks. In particular, this paper formulates scale-free network inference using Gaussian Graphical model (GGM) regularized by a node degree prior. Our degree prior not only promotes a desirable global degree distribution, but also exploits the estimated degree of an… CONTINUE READING


Publications referenced by this paper.

A convex formulation for learning scale-free networks via submodular relaxation

  • Defazio, Aaron, Caetano, S Tiberio
  • In Advances in Neural Information Processing…
  • 2012

A note on the group lasso and a sparse group lasso

  • Friedman, Jerome, Hastie, Trevor, Tibshirani, Robert
  • arXiv preprint arXiv:1001.0736,
  • 2010
1 Excerpt

Similar Papers

Loading similar papers…