Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms

  title={Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms},
  author={Tao Zhou and Yan-Li Lee and Guannan Wang},

Figures from this paper

Discriminating abilities of threshold-free evaluation metrics in link prediction
This article proposes a method to measure the discriminating abilities of any given metric, and applies this method to the above three threshold-free metrics, showing that AUC and AUPR are remarkably more discriminate than BP, and AUC is slightly more discriminating than AUPR.
Multiple Order Local Information model for link prediction in complex networks
Reconnecting the Estranged Relationships: Optimizing the Influence Propagation in Evolving Networks
It is proved that the RT 𝑙 R problem is NP-hard, which aims to find number of previous existing relationships but being estranged later, such that reconnecting these relationships will maximize the expected number of influenced users by the given group in a future period.
Adaptive Network Automata Modelling of Complex Networks
This study compares Cannistraci-Hebb adaptive (CHA) network automaton against state-of-the-art link prediction methods such as structural perturbation method (SPM), stochastic block models (SBM) and artificial intelligence algorithms for graph embedding and highlights that CHA offers the key advantage to explicitly explain the mechanistic rule of self-organization which leads to the link prediction performance, whereas SPM and graph embeding not.
Diffusion profile embedding as a basis for graph vertex similarity
A tool developed to characterize the accuracy of the similarity values in detecting community structures, the uncertainty index, is introduced in this paper as a measure of the quality of similarity methods.
Progresses and challenges in link prediction
  • T. Zhou
  • Computer Science
  • 2021
Short Note on Comparing Stacking Modelling Versus Cannistraci-Hebb Adaptive Network Automata for Link Prediction in Complex Networks
It is concluded that brute-force stacking of algorithms by AI does not perform better than (and is often significantly outperformed by) SPM and one simple brain-bioinspired rule such as CH, which agrees with the Gödel incompleteness.


Link prediction via linear optimization
Predicting missing links via local information
A new similarity measure, motivated by the resource allocation process taking place on networks, is proposed and shown to have higher prediction accuracy than common neighbours, which can remarkably enhance the prediction accuracy.
Link Prediction via Matrix Completion
This work introduces the method of robust principal component analysis (robust PCA) into link prediction, and estimates the missing entries of the adjacency matrix to demonstrate the effectiveness of this method when the target network is connected and sufficiently dense.
Playing the role of weak clique property in link prediction: A friend recommendation model
This work proposes a local friend recommendation (FR) index, utilizing the PWCS phenomenon, which improves the accuracy of link prediction and proposes a mixed friend recommendation index (labelled MFR), which further improves the accuracies of links prediction.
Accurate and diverse recommendations via eliminating redundant correlations
This paper introduces a personalized recommendation algorithm, called network-based inference (NBI), which has higher accuracy than the classical algorithm, namely collaborative filtering and can even outperform the Latent Dirichlet Allocation algorithm, which requires much longer computational time.
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Local-ring network automata and the impact of hyperbolic geometry in complex network link-prediction
The results suggest that SBM, whose computational time is high, cannot in general overcome the Cannistraci-Hebb (CH) network automaton model that is a simple local-learning-rule of topological self-organization proved as the current best local-based and parameter-free deterministic rule for link-prediction.
Evaluating Network Models: A Likelihood Analysis
The results suggest that the Generalized Linear Preferential (GLP) model outperforms the Tel Aviv Network Generator (Tang), while both two models are better than the Barab\'asi-Albert (BA) and Erdos-R\'enyi (ER) models.
Mining the evolution of networks using Local-Cross-Communities-Paradigm
Empirical analysis on twelve real networks show that LCCP performs better than CN, PA and LCP on link prediction problems, and a variant named Local-Cross-Communities-Paradigm (LCCP) is proposed.