Uncovering missing links with cold ends

@article{Zhu2011UncoveringML,
  title={Uncovering missing links with cold ends},
  author={Yu-Xiao Zhu and Linyuan Lu and Qian-Ming Zhang and Tao Zhou},
  journal={ArXiv},
  year={2011},
  volume={abs/1104.0395}
}

Figures and Tables from this paper

Performance of Local Information Based Link Prediction: A Sampling Perspective
TLDR
This paper tries to re-evaluate the performance of local information-based link predictions through sampling method governed division of the training set and the probe set and finds that for different sampling methods, each prediction approach performs unevenly.
Measuring the robustness of link prediction algorithms under noisy environment
TLDR
This paper comprehensively study the robustness of the existing link prediction algorithms in the real networks where some links are missing, fake or swapped with other links and finds that missing links are more destructive than fake and swapped links for prediction accuracy.
Predicting missing links via correlation between nodes
Accurate link prediction method based on path length between a pair of unlinked nodes and their degree
TLDR
A new node similarity measure based on the path depth between the source and destination nodes and their degrees is proposed, which is very easy to compute and very effective in solving the link prediction problem.
Mean Received Resources Meet Machine Learning Algorithms to Improve Link Prediction Methods
TLDR
A new parameterized method to enhance the AUC value of the link prediction metrics by combining them with the mean received resources (MRRs) is proposed and experiments show that the proposed method improves the performance of the state-of-the-art metrics.
Structural Importance-based Link Prediction Techniques in Social Network
TLDR
This paper argued that nodes having same status of centralization along with high similarity can connect to each other in a future and compared structural importance-based link prediction techniques with state-of-the-art techniques.
Centrality and Community Scoring Functions in Incomplete Networks: Their Sensitivity, Robustness, and Reliability
TLDR
This paper focuses on two distinct types of parameters—community scoring functions and centrality measures and identifies the effect of removal of edges in terms of the sensitivity, robustness and reliability, and discusses, in detail, how the joint community-like andcentrality-like characteristic of permanence makes it an interesting metric for noisy graphs.
Predicting the evolution of complex networks via local information
Link Prediction in Heterogeneous Social Networks
TLDR
The problem of link prediction in heterogeneous networks as a multi-task, metric learning (MTML) problem is posed and the MT-SPML method is extended to account for task correlations, robustness to non-informative features and non-stationary degree distribution across networks.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 66 REFERENCES
Predicting missing links via local information
TLDR
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 in weighted networks: The role of weak ties
TLDR
This letter uses local similarity indices to estimate the likelihood of the existence of links in weighted networks, including Common Neighbor, Adamic-Adar Index, Resource Allocation Index, and their weighted versions, and gives a semi-quantitative explanation based on the motif analysis.
Similarity index based on local paths for link prediction of complex networks.
TLDR
A local path index to estimate the likelihood of the existence of a link between two nodes, and a network model with controllable density and noise strength in generating links, as well as collect data of six real networks.
Link Prediction in Complex Networks: A Survey
Evaluating Network Models: A Likelihood Analysis
TLDR
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.
Link prediction in complex networks: a local naïve Bayes model
TLDR
It is argued that different common neighbors may play different roles and thus lead to different contributions, and a local Bayes model accordingly is proposed, which can provide more accurate predictions.
Effects of missing data in social networks
Missing and spurious interactions and the reconstruction of complex networks
TLDR
This work is able to reliably identify both missing and spurious interactions in noisy network observations and enables network reconstructions that yield estimates of the true network properties that are more accurate than those provided by the observations themselves.
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
TLDR
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.
Link prediction based on local random walk
TLDR
This letter proposed a method based on local random walk, which can give competitively good or even better prediction than other random-walk–based methods while having a much lower computational complexity.
...
1
2
3
4
5
...