Predicting missing links via local information
From MaRDI portal
Abstract: Missing link prediction of networks is of both theoretical interest and practical significance in modern science. In this paper, we empirically investigate a simple framework of link prediction on the basis of node similarity. We compare nine well-known local similarity measures on six real networks. The results indicate that the simplest measure, namely common neighbors, has the best overall performance, and the Adamic-Adar index performs the second best. 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 neighbors. It is found that many links are assigned same scores if only the information of the nearest neighbors is used. We therefore design another new measure exploited information of the next nearest neighbors, which can remarkably enhance the prediction accuracy.
Recommendations
- An evidential link prediction method and link predictability based on Shannon entropy
- Accurate similarity index based on activity and connectivity of node for link prediction
- Link prediction via controlling the leading eigenvector
- Toward link predictability of complex networks
- Link prediction in complex networks incorporating the degree and community information
Cites work
- A critical point for random graphs with a given degree sequence
- A new status index derived from sociometric analysis
- Assessing experimentally derived interactions in a small world
- Collective dynamics of `small-world' networks
- Community structure in social and biological networks
- Complex networks: structure and dynamics
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 3829300 (Why is no real title available?)
- Learning to construct knowledge bases from the World Wide Web
- MODELLING COLLABORATION NETWORKS BASED ON NONLINEAR PREFERENTIAL ATTACHMENT
- Random walks on graphs
- Statistical mechanics of complex networks
- The matrix-forest theorem and measuring relations in small social groups
- The Structure and Function of Complex Networks
Cited in
(85)- linkprediction
- Predicting the structural evolution of networks by applying multivariate time series
- Strong ties promote the epidemic prevalence in susceptible-infected-susceptible spreading dynamics
- Identifying influential spreaders in complex networks based on gravity formula
- Link prediction based on temporal similarity metrics using continuous action set learning automata
- Identification of influential nodes in complex networks: method from spreading probability viewpoint
- Evaluating user reputation in online rating systems via an iterative group-based ranking method
- Inter-variable correlation prediction with fuzzy connected-triples
- Structure-oriented prediction in complex networks
- Predicting link directions via a recursive subgraph-based ranking
- The science of science: from the perspective of complex systems
- Link prediction in complex network via penalizing noncontribution relations of endpoints
- Discovering missing \texttt{me} edges across social networks
- An efficient algorithm for link prediction in temporal uncertain social networks
- Degree-corrected stochastic block models and reliability in networks
- Potential links by neighbor communities
- Link prediction via sparse Gaussian graphical model
- Big networks: a survey
- Integrating social influence modeling and user modeling for trust prediction in signed networks
- Biased random walk with restart for link prediction with graph embedding method
- Link prediction techniques, applications, and performance: a survey
- HM-EIICT: fairness-aware link prediction in complex networks using community information
- Vertex entropy based link prediction in unweighted and weighted complex networks
- Link prediction in multiplex networks using intralayer probabilistic distance and interlayer co-evolving factors
- Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths
- Multiple order local information model for link prediction in complex networks
- An evidential link prediction method and link predictability based on Shannon entropy
- Measure the structure similarity of nodes in complex networks based on relative entropy
- Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks
- Measuring transferring similarity via local information
- A comprehensive comparison of network similarities for link prediction and spurious link elimination
- Toward link predictability of bipartite networks based on structural enhancement and structural perturbation
- Link prediction via linear optimization
- Link prediction in multiplex networks based on interlayer similarity
- Robust non-negative matrix factorization for link prediction in complex networks using manifold regularization and sparse learning
- A three-stage algorithm for local community detection based on the high node importance ranking in social networks
- Supervised classification for link prediction in Facebook ego networks with anonymized profile information
- A novel visibility graph transformation of time series into weighted networks
- Link prediction in temporal networks: integrating survival analysis and game theory
- Link prediction via controlling the leading eigenvector
- Sampling-based algorithm for link prediction in temporal networks
- Projection-based link prediction in a bipartite network
- An adaptive granulation algorithm for community detection based on improved label propagation
- RankMerging: a supervised learning-to-rank framework to predict links in large social networks
- Link prediction via convex nonnegative matrix factorization on multiscale blocks
- Identifying multiple influential spreaders by a heuristic clustering algorithm
- Link prediction in multiplex networks
- Link prediction based on the mutual information with high-order clustering structure of nodes in complex networks
- Network refinement: denoising complex networks for better community detection
- Toward link predictability of complex networks
- Mining hidden links in social networks to achieve equilibrium
- Performance of local information-based link prediction: a sampling perspective
- Inferring network topology via the propagation process
- Enhancing community detection by using local structural information
- Dynamic community detection based on network structural perturbation and topological similarity
- Link prediction in complex networks incorporating the degree and community information
- Degree correlation of bipartite network on personalized recommendation
- Identifying missing and spurious connections via the bi-directional diffusion on bipartite networks
- Similarity-based classification in partially labeled networks
- Trust your data or not -- StQP remains StQP: community detection via robust standard quadratic optimization
- Similarity-based local community detection for bipartite networks
- Bi-scale link prediction on networks
- Supervised Link Weight Prediction Using Node Metadata
- Link prediction in scale-free networks using a partial observation
- Relative-path-based algorithm for link prediction on complex networks using a basic similarity factor
- Sampling-based link prediction in complex networks
- Accurate similarity index based on activity and connectivity of node for link prediction
- Tensor decomposition for link prediction in temporal directed networks*
- EAMCD: an efficient algorithm based on minimum coupling distance for community identification in complex networks
- Reconstructing production networks using machine learning
- PNR: how to optimally combine different link prediction approaches?
- Interplay between topology and edge weights in real-world graphs: concepts, patterns, and an algorithm
- Temporal link prediction methods based on behavioral synchrony
- Link prediction in protein-protein interaction network: a similarity multiplied similarity algorithm with paths of length three
- Maximizing synchronizability of networks with community structure based on node similarity
- ClusterLP: a novel cluster-aware link prediction model in undirected and directed graphs
- Effect of second-order network structure on link prediction
- Adversarial nonnegative matrix factorization for temporal link prediction
- Community detection in hypernetwork via density-ordered tree partition
- Link prediction using motif-based dual graph-regularized autoencoder-like non-negative matrix factorization
- A similarity Laplacian energy perspective on critical node identification in complex networks
- Predictability of complex systems
- Current flow centrality based link prediction in unipartite and bipartite complex networks
- Planted clique recovery in random geometric graphs
- Complex systems: features, similarity and connectivity
This page was built for publication: Predicting missing links via local information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q148014)
