Predicting missing links via local information
From MaRDI portal
Publication:148014
DOI10.1140/EPJB/E2009-00335-8zbMATH Open1188.05143arXiv0901.0553OpenAlexW2007444087MaRDI QIDQ148014FDOQ148014
Linyuan Lu, Tao Zhou, Yi-Cheng Zhang, Yi-Cheng Zhang, Tao Zhou, Linyuan Lü
Publication date: October 2009
Published in: The European Physical Journal B, The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0901.0553
Cites Work
- Title not available (Why is that?)
- Statistical mechanics of complex networks
- Complex networks: structure and dynamics
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- Random walks on graphs
- The matrix-forest theorem and measuring relations in small social groups
- Learning to construct knowledge bases from the World Wide Web
- A new status index derived from sociometric analysis
- A critical point for random graphs with a given degree sequence
- MODELLING COLLABORATION NETWORKS BASED ON NONLINEAR PREFERENTIAL ATTACHMENT
- Collective dynamics of ‘small-world’ networks
- Assessing experimentally derived interactions in a small world
Cited In (73)
- Complex systems: features, similarity and connectivity
- A novel visibility graph transformation of time series into weighted networks
- Link prediction in multiplex networks
- RankMerging: a supervised learning-to-rank framework to predict links in large social networks
- Identifying influential spreaders in complex networks based on gravity formula
- Tensor decomposition for link prediction in temporal directed networks*
- Measure the structure similarity of nodes in complex networks based on relative entropy
- Predicting the structural evolution of networks by applying multivariate time series
- Strong ties promote the epidemic prevalence in susceptible-infected-susceptible spreading dynamics
- 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
- Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths
- Projection-based link prediction in a bipartite network
- Degree-corrected stochastic block models and reliability in networks
- Measuring transferring similarity via local information
- Inter-variable correlation prediction with fuzzy connected-triples
- SIMILARITY-BASED CLASSIFICATION IN PARTIALLY LABELED NETWORKS
- An efficient algorithm for link prediction in temporal uncertain social networks
- Mining hidden links in social networks to achieve equilibrium
- Structure-oriented prediction in complex networks
- DEGREE CORRELATION OF BIPARTITE NETWORK ON PERSONALIZED RECOMMENDATION
- Link prediction via controlling the leading eigenvector
- The science of science: from the perspective of complex systems
- Identifying multiple influential spreaders by a heuristic clustering algorithm
- Multiple order local information model for link prediction in complex networks
- Link prediction via linear optimization
- Big networks: a survey
- Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization
- Link prediction in temporal networks: integrating survival analysis and game theory
- Sampling-based algorithm for link prediction in temporal networks
- Link prediction in scale-free networks using a partial observation
- A comprehensive comparison of network similarities for link prediction and spurious link elimination
- Inferring network topology via the propagation process
- Toward link predictability of complex networks
- Toward link predictability of bipartite networks based on structural enhancement and structural perturbation
- Link prediction via sparse Gaussian graphical model
- Robust non-negative matrix factorization for link prediction in complex networks using manifold regularization and sparse learning
- Supervised classification for link prediction in Facebook ego networks with anonymized profile information
- Predicting link directions via a recursive subgraph-based ranking
- Integrating social influence modeling and user modeling for trust prediction in signed networks
- Identifying missing and spurious connections via the bi-directional diffusion on bipartite networks
- Biased random walk with restart for link prediction with graph embedding method
- Link prediction techniques, applications, and performance: a survey
- Dynamic community detection based on network structural perturbation and topological similarity
- An evidential link prediction method and link predictability based on Shannon entropy
- Bi-scale link prediction on networks
- Link prediction in complex network via penalizing noncontribution relations of endpoints
- linkprediction
- 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
- Community detection in hypernetwork via density-ordered tree partition
- Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks
- Link prediction in multiplex networks based on interlayer similarity
- A three-stage algorithm for local community detection based on the high node importance ranking in social networks
- Link prediction in protein-protein interaction network: a similarity multiplied similarity algorithm with paths of length three
- EAMCD: an efficient algorithm based on minimum coupling distance for community identification in complex networks
- Reconstructing production networks using machine learning
- Enhancing community detection by using local structural information
- ClusterLP: a novel cluster-aware link prediction model in undirected and directed graphs
- Relative-path-based algorithm for link prediction on complex networks using a basic similarity factor
- Similarity-based local community detection for bipartite networks
- Accurate similarity index based on activity and connectivity of node for link prediction
- Supervised Link Weight Prediction Using Node Metadata
- Link prediction based on the mutual information with high-order clustering structure of nodes in complex networks
- Effect of second-order network structure on link prediction
- Adversarial nonnegative matrix factorization for temporal link prediction
- Interplay between topology and edge weights in real-world graphs: concepts, patterns, and an algorithm
- An adaptive granulation algorithm for community detection based on improved label propagation
- Temporal link prediction methods based on behavioral synchrony
- Network refinement: denoising complex networks for better community detection
- Maximizing synchronizability of networks with community structure based on node similarity
Uses Software
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)