Learning the Structure of Hub Network Based on Graph Model

Abstract

In this paper, we focus on the structure learning problem of the hub network. In the neighborhood selection framework, we use the L1 and L2 regularizers to incorporate the sparse and group prior of the hub network, so as to make the network easier to generate Hub. We employ the coordinate descent algorithm to solve the resulting model. Simulation and real data analysis show that the proposed method is effective and applicable in parameter estimation and model selection, and results illustrate the influence ability of the control parameter on the model.

Keywords

• graphical model
• network
• hub
• neighborhood selection