Similarity indices based on link weight assignment for link prediction of unweighted complex networks

2017 ◽  
Vol 31 (02) ◽  
pp. 1650254 ◽  
Author(s):  
Shuxin Liu ◽  
Xinsheng Ji ◽  
Caixia Liu ◽  
Yi Bai
Keyword(s):  
Complex Networks ◽  
Link Prediction ◽  
Prediction Accuracy ◽  
Prediction Methods ◽  
Close Attention ◽  
Common Neighbor ◽  
Link Weight ◽  
Similarity Indices ◽  
Clustered Networks ◽  
Local Path

Many link prediction methods have been proposed for predicting the likelihood that a link exists between two nodes in complex networks. Among these methods, similarity indices are receiving close attention. Most similarity-based methods assume that the contribution of links with different topological structures is the same in the similarity calculations. This paper proposes a local weighted method, which weights the strength of connection between each pair of nodes. Based on the local weighted method, six local weighted similarity indices extended from unweighted similarity indices (including Common Neighbor (CN), Adamic-Adar (AA), Resource Allocation (RA), Salton, Jaccard and Local Path (LP) index) are proposed. Empirical study has shown that the local weighted method can significantly improve the prediction accuracy of these unweighted similarity indices and that in sparse and weakly clustered networks, the indices perform even better.

Prediction of missing links and reconstruction of complex networks

2016 ◽  
Vol 27 (10) ◽  
pp. 1650120 ◽  
Author(s):  
Cheng-Jun Zhang ◽  
An Zeng
Keyword(s):  
Complex Networks ◽  
Link Prediction ◽  
Prediction Accuracy ◽  
High Performance ◽  
Point Of View ◽  
Prediction Methods ◽  
Online Systems ◽  
Network Properties ◽  
High Prediction ◽  
Simple Link

Predicting missing links in complex networks is of great significance from both theoretical and practical point of view, which not only helps us understand the evolution of real systems but also relates to many applications in social, biological and online systems. In this paper, we study the features of different simple link prediction methods, revealing that they may lead to the distortion of networks’ structural and dynamical properties. Moreover, we find that high prediction accuracy is not definitely corresponding to a high performance in preserving the network properties when using link prediction methods to reconstruct networks. Our work highlights the importance of considering the feedback effect of the link prediction methods on network properties when designing the algorithms.

ZERO NODES EFFECT: VALID LINK PREDICTION IN SPARSE NETWORKS

2013 ◽  
Vol 27 (12) ◽  
pp. 1350052 ◽  
Author(s):  
CHEN-XI SHAO ◽  
HUI-LING DOU ◽  
RONG-XU YANG ◽  
BING-HONG WANG
Keyword(s):  
Complex Networks ◽  
Link Prediction ◽  
Prediction Accuracy ◽  
Preferential Attachment ◽  
Hybrid Index ◽  
Evolution Mechanism ◽  
Evolutionary Forces ◽  
Similarity Indices ◽  
Zero Degree ◽  
Sparse Networks

Zero-degree nodes are an important difficulty in sparse networks' link prediction. Clustering and preferential attachment, as the most important characteristics of complex networks, have been paid little attention in similarity indices. Inspired by the coexistence of clustering and preferential attachment in real networks, this paper proposes a new preferential attachment index and new clustering index, which have here been integrated into a hybrid index that considers the dynamic evolutionary forces of complex networks and can solve the problem of excessive zero-degree nodes in sparse networks and check evolution mechanism. Experiments proved prediction accuracy can be remarkably enhanced.

scholarly journals A novel similarity measure for missing link prediction in social networks

2020 ◽  
Vol 19 (2) ◽  
pp. 1071
Author(s):  
Gogulamudi Naga Chandrika ◽  
E. Srinivasa Reddy
Keyword(s):  
Social Networks ◽  
Complex Networks ◽  
Similarity Measure ◽  
Network Theory ◽  
Link Prediction ◽  
Prediction Methods ◽  
Missing Link ◽  
The Social ◽  
Hidden Patterns ◽  
Over Time

<p><span>Social Networks progress over time by the addition of new nodes and links, form associations with one community to the other community. Over a few decades, the fast expansion of Social Networks has attracted many researchers to pay more attention towards complex networks, the collection of social data, understand the social behaviors of complex networks and predict future conflicts. Thus, Link prediction is imperative to do research with social networks and network theory. The objective of this research is to find the hidden patterns and uncovered missing links over complex networks. Here, we developed a new similarity measure to predict missing links over social networks. The new method is computed on common neighbors with node-to-node distance to get better accuracy of missing link prediction. </span><span>We tested the proposed measure on a variety of real-world linked datasets which are formed from various linked social networks. The proposed approach performance is compared with contemporary link prediction methods. Our measure makes very effective and intuitive in predicting disappeared links in linked social networks.</span></p>

scholarly journals Path-based extensions of local link prediction methods for complex networks

2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Furqan Aziz ◽  
Haji Gul ◽  
Irfan Uddin ◽  
Georgios V. Gkoutos
Keyword(s):  
Complex System ◽  
Link Prediction ◽  
Network Science ◽  
State Of The Art ◽  
Superior Performance ◽  
Prediction Methods ◽  
Local Similarity ◽  
Fundamental Interest ◽  
Current State ◽  
Similarity Indices

AbstractLink prediction in a complex network is a problem of fundamental interest in network science and has attracted increasing attention in recent years. It aims to predict missing (or future) links between two entities in a complex system that are not already connected. Among existing methods, local similarity indices are most popular that take into account the information of common neighbours to estimate the likelihood of existence of a connection between two nodes. In this paper, we propose global and quasi-local extensions of some commonly used local similarity indices. We have performed extensive numerical simulations on publicly available datasets from diverse domains demonstrating that the proposed extensions not only give superior performance, when compared to their respective local indices, but also outperform some of the current, state-of-the-art, local and global link-prediction methods.

scholarly journals A Potential Information Capacity Index for Link Prediction of Complex Networks Based on the Cannikin Law

Entropy ◽  
2019 ◽  
Vol 21 (9) ◽  
pp. 863 ◽  
Author(s):  
Xing Li ◽  
Shuxin Liu ◽  
Hongchang Chen ◽  
Kai Wang
Keyword(s):  
Complex Networks ◽  
Information Transmission ◽  
Link Prediction ◽  
Information Capacity ◽  
Prediction Methods ◽  
Transmission Process ◽  
Capacity Index ◽  
Definition Of ◽  
Definition Of Information ◽  
Transmission Capability

Recently, a number of similarity-based methods have been proposed for link prediction of complex networks. Among these indices, the resource-allocation-based prediction methods perform very well considering the amount of resources in the information transmission process between nodes. However, they ignore the information channels and their information capacity in information transmission process between two endpoints. Motivated by the Cannikin Law, the definition of information capacity is proposed to quantify the information transmission capability between any two nodes. Then, based on the information capacity, a potential information capacity (PIC) index is proposed for link prediction. Empirical study on 15 datasets has shown that the PIC index we proposed can achieve a good performance, compared with eight mainstream baselines.

scholarly journals Tourism Destination Preference Prediction Based on Edge Computing

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Bin Deng ◽  
Jun Xu ◽  
Xin Wei
Keyword(s):  
Link Prediction ◽  
Prediction Accuracy ◽  
Prediction Method ◽  
Edge Computing ◽  
Prediction Methods ◽  
Random Forest Algorithm ◽  
Tourism Destination ◽  
Prediction Time ◽  
Weight Value ◽  
Destination Selection

In view of the fact that the important characteristics of tourism destination selection preference are not considered in the current prediction methods of tourism destination selection preference, resulting in low prediction accuracy and comprehensive accuracy and long prediction time, a tourism destination selection preference prediction method based on edge calculation is proposed. This paper uses edge computing to construct the characteristics of tourism destination selection preference and uses a random forest algorithm to select important features and carry out preliminary estimation and ranking. Using the multiple logit selection model, the tourists’ preference sequence for tourism destination selection is obtained and sorted and the tourism destination selection preference model is obtained. By calculating the weight value of tourism destination selection preference, the weight set of tourism destination selection preference is determined and the tourism destination selection preference is determined according to the link prediction method to realize the tourism destination selection preference prediction. The experimental results show that the comprehensive accuracy of the proposed method is good, which can effectively improve the prediction accuracy of tourism destination selection preference and shorten the prediction time of tourism destination selection preference.

SIMILARITY INDEX BASED ON THE INFORMATION OF NEIGHBOR NODES FOR LINK PREDICTION OF COMPLEX NETWORK

2013 ◽  
Vol 27 (06) ◽  
pp. 1350039 ◽  
Author(s):  
JING WANG ◽  
LILI RONG
Keyword(s):  
Link Prediction ◽  
High Efficiency ◽  
Similarity Index ◽  
Similarity Measures ◽  
Nearest Neighbors ◽  
Clustering Coefficient ◽  
Local Similarity ◽  
Common Neighbor ◽  
Similarity Indices ◽  
Node Similarity

Link prediction in complex networks has attracted much attention recently. Many local similarity measures based on the measurements of node similarity have been proposed. Among these local similarity indices, the neighborhood-based indices Common Neighbors (CN), Adamic-Adar (AA) and Resource Allocation (RA) index perform best. It is found that the node similarity indices required only information on the nearest neighbors are assigned high scores and have very low computational complexity. In this paper, a new index based on the contribution of common neighbor nodes to edges is proposed and shown to have competitively good or even better prediction than other neighborhood-based indices especially for the network with low clustering coefficient with its high efficiency and simplicity.

scholarly journals Seven-Layer Model in Complex Networks Link Prediction: A Survey

Sensors ◽  
2020 ◽  
Vol 20 (22) ◽  
pp. 6560
Author(s):  
Hui Wang ◽  
Zichun Le
Keyword(s):  
Complex Networks ◽  
Supervised Learning ◽  
Link Prediction ◽  
Complex Analysis ◽  
Auxiliary Information ◽  
Prediction Method ◽  
Prediction Methods ◽  
Layer Model ◽  
The Future ◽  
High Level

Link prediction is the most basic and essential problem in complex networks. This study analyzes the observed topological, time, attributive, label, weight, directional, and symbolic features and auxiliary information to find the lack of connection and predict the future possible connection. For discussion and analysis of the evolution of the network, the network model is of great significance. In the past two decades, link prediction has attracted extensive attention from experts in various fields, who have published numerous high-level papers, but few combine interdisciplinary characteristics. This survey analyzes and discusses the existing link prediction methods. The idea of stratification is introduced into the classification system of link prediction for the first time and proposes the design idea of a seven-layer model, namely the network, metadata, feature classification, selection input, processing, selection, and output layers. Among them, the processing layer divides link prediction methods into similarity-based, probabilistic, likelihood, supervised learning, semi-supervised learning, unsupervised learning, and reinforcement learning methods. The input features, evaluation metrics, complex analysis, experimental comparisons, relative merits, common dataset and open-source implementations for each link prediction method are then discussed in detail. Through analysis and comparison, we found that the link prediction method based on graph structure features has better prediction performance. Finally, the future development direction of link prediction in complex networks is discussed.

A Link Prediction Model Based on Similarity between Links

2014 ◽  
Vol 651-653 ◽  
pp. 1748-1752
Author(s):  
Fu Li Xie ◽  
Guang Quan Cheng
Keyword(s):  
Prediction Model ◽  
Link Prediction ◽  
Prediction Accuracy ◽  
Network Science ◽  
The Other ◽  
Prediction Methods ◽  
Good Prediction ◽  
Prediction Problem ◽  
Model Based ◽  
Good Prediction Accuracy

With the development of network science, the link prediction problem has attracted more and more attention. Among which, link prediction methods based on similarity has been most widely studied. Previous methods depicting similarity of nodes mainly consider their common neighbors. But in this paper, from the view of network environment of nodes, which is to analysis the links around the pair of nodes, derive nodes similarity through that of links, a new way to solve the link prediction problem is provided. This paper establishes a link prediction model based on similarity between links, presents the LE index. Finally, the LE index is tested on five real datasets, and compared with existing similarity-based link prediction methods, the experimental results show that LE index can achieve good prediction accuracy, especially outperforms the other methods in the Yeast network.

scholarly journals Comparação de Técnicas de Predição de Links em Sub-redes de Coautoria Formada por Currículos da Plataforma Lattes

2017 ◽  
Author(s):  
Douglas V. Santos ◽  
Thiago C. Cunha ◽  
Antônio B. O. Silva ◽  
Fernando S. Parreiras ◽  
Orlando A. Gomes
Keyword(s):  
Link Prediction ◽  
Prediction Accuracy ◽  
Prediction Methods ◽  
Spectral Evolution ◽  
Technology And Innovation ◽  
Coauthorship Network ◽  
Science Technology ◽  
Science Technology And Innovation ◽  
Over Time ◽  
Better Than

The study of Lattes platform allows addressing and analyzing Brazil researchers network which could be useful for defining politics to improve science, technology, and innovation. This work evaluated Lattes Platform coauthorship network. This network evolves over time, which means that new coauthorships will arise in future. Therefore, using link prediction methods in this network would help to identify growing knowledge areas in Brazil. The used technics were Spectral Evolution, wich is new in this context, Common Neighbors, Adamic-Adar and Jaccard. The main goal was to evaluate the link prediction accuracy with different methods at the coauthorship network of Lattes Platform. The Spectral Evolution was worse than the others. Adamic-Adar method presented the best result - 817 times better than the random link prediction.

Sign in / Sign up

Export Citation Format

Share Document