Explore the vast range of titles available.

Link prediction is a popular research area with important applications in a variety of disciplines, including biology, social science, security, and medicine. The fundamental requirement of link prediction is the accurate and effective prediction of new links in networks. While there are many different methods proposed for link prediction, we argue that the practical performance potential of these methods is often unknown because of challenges in the evaluation of link prediction, which impact the reliability and reproducibility of results. We describe these challenges, provide theoretical proofs and empirical examples demonstrating how current methods lead to questionable conclusions, show how the fallacy of these conclusions is illuminated by methods we propose, and develop recommendations for consistent, standard, and applicable evaluation metrics. We also recommend the use of precision-recall threshold curves and associated areas in lieu of receiver operating characteristic curves due to complications that arise from extreme imbalance in the link prediction classification problem.

Prediction of missing links is an important part of many applications, such as friends’ recommendations on social media, reduction of economic cost of protein functional modular mining, and implementation of accurate recommendations in the shopping platform. However, the existing algorithms for predicting missing links fall short in the accuracy and the efficiency. To ameliorate these, we propose a simplified quantum walk model whose Hilbert space dimension is only twice the number of nodes in a complex network. This property facilitates simultaneous consideration of the self-loop of each node and the common neighbour information between arbitrary pair of nodes. These effects decrease the negative effect generated by the interference effect in quantum walks while also recording the similarity between nodes and its neighbours. Consequently, the observed probability after the two-step walk is utilised to represent the score of each link as a missing link, by which extensive computations are omitted. Using the AUC index as a performance metric, the proposed model records the highest average accuracy in the prediction of missing links compared to 14 competing algorithms in nine real complex networks. Furthermore, experiments using the precision index show that our proposed model ranks in the first echelon in predicting missing links. These performances indicate the potential of our simplified quantum walk model for applications in network alignment and functional modular mining of protein–protein networks.

In this study, we propose two hybrid algorithms for link prediction problem in static networks that combine the benefits of both local and global scoring methods, with the objective of compensating the weaknesses of each approach using two strategies: sequential and integrated. In the sequential strategy global scoring methods are used in a pipeline mode after local ones if the full graph is explored and the desired number of edges is not met, in an attempt to complete the missing links in the network. The integrated one combines local and global scoring algorithms together in order to add a missing link to the network. Furthermore, we present four distinct approaches to explore the network’s nodes and edges. Experiments on real-world and synthetic networks revealed that our proposed hybrid algorithms can outperform some of the state-of-the-art link-prediction methods.

Social networking sites have gained much popularity in the recent years. With millions of people connected virtually generate loads of data to be analyzed to infer meaningful associations among links. Link prediction algorithm is one such problem, wherein existing nodes, links and their attributes are analyzed to predict the possibility of potential links, which are likely to happen over a period of time. In this survey, the local structure based link prediction algorithms existing in literature with their features and also the possibility of future research directions is reported and discussed. This survey serves as a starting point for beginners interested in understanding link prediction or similarity index algorithms in general and local structure based link prediction algorithms in particular.

In the dynamic and open peer-to-peer task collaboration scenarios, such as collaborative operations or post-earthquake coordinated rescue scenarios, the performance of personnel nodes or machine nodes will decrease with the consumption of energy, and the types of tasks that the nodes can perform change dynamically. Therefore, each node needs to dynamically maintain its immediate neighbors to guarantee the performance of task collaboration. In view of this, this paper pioneers the problem of directed link prediction for peer-to-peer dynamic task collaboration networks. First of all, the paper proposes two new link prediction metrics based on the link state change history, change time and multiple types of directed relationships between nodes. Secondly, based on the current feature vector and sequence feature vectors of related metrics between nodes, this paper reasonably designs the use mechanism of hybrid deep learning algorithms, and proposes a novel deep link prediction model. A large number of experiments have shown that the link prediction metrics we proposed are more suitable for the evolution of collaboration links under the dynamic peer-to-peer task collaboration environment, and the CFSF model achieves better prediction performance than other models.

Link prediction is a key problem in the field of undirected graph, and it can be used in a variety of contexts, including information retrieval and market analysis. By “undirected graphs”, we mean undirected complex networks in this study. The ability to predict new links in complex networks has a significant impact on society. Many complex systems can be modelled using networks. For example, links represent relationships (such as friendships, etc.) in social networks, whereas nodes represent users. Embedding methods, which produce the feature vector of each node in a graph and identify unknown links, are one of the newest approaches to link prediction. The Deep Walk algorithm is a common graph embedding approach that uses pure random walking to capture network structure. In this paper, we propose an efficient model for link prediction based on a hill climbing algorithm. It is used as a cost function. The lower the cost is, the higher the accuracy for link prediction between the source and destination node will be. Unlike other algorithms that predict links based on a single feature, it takes advantage of multiple features. The proposed method has been tested over nine publicly available datasets, and its performance has been evaluated by comparing it to other frequently used indexes. Our model outperforms all of these measures, as indicated by its higher prediction accuracy.

The organization of real networks usually embodies both regularities and irregularities, and, in principle, the former can be modeled. The extent to which the formation of a network can be explained coincides with our ability to predict missing links. To understand network organization, we should be able to estimate link predictability. We assume that the regularity of a network is reflected in the consistency of structural features before and after a random removal of a small set of links. Based on the perturbation of the adjacency matrix, we propose a universal structural consistency index that is free of prior knowledge of network organization. Extensive experiments on disparate real-world networks demonstrate that ( i ) structural consistency is a good estimation of link predictability and ( ii ) a derivative algorithm outperforms state-of-the-art link prediction methods in both accuracy and robustness. This analysis has further applications in evaluating link prediction algorithms and monitoring sudden changes in evolving network mechanisms. It will provide unique fundamental insights into the above-mentioned academic research fields, and will foster the development of advanced information filtering technologies of interest to information technology practitioners. Significance Quantifying a network's link predictability allows us to ( i ) evaluate predictive algorithms associated with the network, ( ii ) estimate the extent to which the organization of the network is explicable, and ( iii ) monitor sudden mechanistic changes during the network's evolution. The hypothesis of this paper is that a group of links is predictable if removing them has only a small effect on the network's structural features. We introduce a quantitative index for measuring link predictability and an algorithm that outperforms state-of-the-art link prediction methods in both accuracy and universality. This study provides fundamental insights into important scientific problems and will aid in the development of information filtering technologies.

Knowledge graphs (KGs) have been widely used in the field of artificial intelligence, such as in information retrieval, natural language processing, recommendation systems, etc. However, the open nature of KGs often implies that they are incomplete, having self-defects. This creates the need to build a more complete knowledge graph for enhancing the practical utilization of KGs. Link prediction is a fundamental task in knowledge graph completion that utilizes existing relations to infer new relations so as to build a more complete knowledge graph. Numerous methods have been proposed to perform the link-prediction task based on various representation techniques. Among them, KG-embedding models have significantly advanced the state of the art in the past few years. In this paper, we provide a comprehensive survey on KG-embedding models for link prediction in knowledge graphs. We first provide a theoretical analysis and comparison of existing methods proposed to date for generating KG embedding. Then, we investigate several representative models that are classified into five categories. Finally, we conducted experiments on two benchmark datasets to report comprehensive findings and provide some new insights into the strengths and weaknesses of existing models.

Knowledge graph will be usefull for the intelligent system. As the relationship prediction on the knowledge graph becomes accurate, construction of a knowledge graph and detection of erroneous information included in a knowledge graph can be performed more conveniently. The goal of our research is to predict a relation (predicate) of two given Knowledge Graph (KG) entities (subject and object). Link prediction between entities is important for developing large-scale ontologies and for KG completion. TransE and TransR have been proposed as the methods for such a prediction. However, TransE and TransR embed both entities and relations in the same (or different) semantic space(s). In this research we propose a simple architecture model with emphasis on relation prediction by using a Multi-Label Deep Neural Network (DNN), and developed KGML. KGML embeds entities only; given subject and object are embedded and concatenated to predict probability distribution of predicates. Since the output of KGML is the probability distribution in [0, 1], output can be classified as positive and negative by using the threshold of 0.5. Since the output of the existing method TransE is the score in [0, ∞ ), the threshold value must be calculated each time. Experimental results showed that predictions by KGML are more accurate than those by TransE and TransR. KGML is more accurate than DKRL which uses both KG triples and entity descriptions for learning. KGML is more accurate than PTransE in and its learning speed is faster than PTransE. The code of KGML is available at https://github.com/yo0826jp/KGML .

Alzheimer's disease is a primary age-related neurodegenerative disorder that can result in impaired cognitive and memory functions. Although connections between changes in brain networks of Alzheimer's disease patients have been established, the mechanisms that drive these alterations remain incompletely understood. This study, which was conducted in 2018 at Northeastern University in China, included data from 97 participants of the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset covering genetics, imaging, and clinical data. All participants were divided into two groups: normal control (n = 52; 20 males and 32 females; mean age 73.90 ± 4.72 years) and Alzheimer's disease (n = 45, 23 males and 22 females; mean age 74.85 ± 5.66). To uncover the wiring mechanisms that shaped changes in the topology of human brain networks of Alzheimer's disease patients, we proposed a local naïve Bayes brain network model based on graph theory. Our results showed that the proposed model provided an excellent fit to observe networks in all properties examined, including clustering coefficient, modularity, characteristic path length, network efficiency, betweenness, and degree distribution compared with empirical methods. This proposed model simulated the wiring changes in human brain networks between controls and Alzheimer's disease patients. Our results demonstrate its utility in understanding relationships between brain tissue structure and cognitive or behavioral functions. The ADNI was performed in accordance with the Good Clinical Practice guidelines, US 21CFR Part 50-Protection of Human Subjects, and Part 56-Institutional Review Boards (IRBs)/Research Good Clinical Practice guidelines Institutional Review Boards (IRBs)/Research Ethics Boards (REBs).