Link prediction via sparse Gaussian graphical model (Q1793509): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: QUIC / rank | |||
Normal rank |
Revision as of 02:04, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Link prediction via sparse Gaussian graphical model |
scientific article |
Statements
Link prediction via sparse Gaussian graphical model (English)
0 references
12 October 2018
0 references
Summary: 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.
0 references