IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7213432.html
   My bibliography  Save this article

Link Prediction via Sparse Gaussian Graphical Model

Author

Listed:
  • Liangliang Zhang
  • Longqi Yang
  • Guyu Hu
  • Zhisong Pan
  • Zhen Li

Abstract

Link prediction is an important task in complex network analysis. Traditional link prediction methods are limited by network topology and lack of node property information, which makes predicting links challenging. In this study, we address link prediction using a sparse Gaussian graphical model and demonstrate its theoretical and practical effectiveness. In theory, link prediction is executed by estimating the inverse covariance matrix of samples to overcome information limits. The proposed method was evaluated with four small and four large real-world datasets. The experimental results show that the area under the curve (AUC) value obtained by the proposed method improved by an average of 3% and 12.5% compared to 13 mainstream similarity methods, respectively. This method outperforms the baseline method, and the prediction accuracy is superior to mainstream methods when using only 80% of the training set. The method also provides significantly higher AUC values when using only 60% in Dolphin and Taro datasets. Furthermore, the error rate of the proposed method demonstrates superior performance with all datasets compared to mainstream methods.

Suggested Citation

  • Liangliang Zhang & Longqi Yang & Guyu Hu & Zhisong Pan & Zhen Li, 2016. "Link Prediction via Sparse Gaussian Graphical Model," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-11, February.
  • Handle: RePEc:hin:jnlmpe:7213432
    DOI: 10.1155/2016/7213432
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2016/7213432.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2016/7213432.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/7213432?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:7213432. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.