Most existing knowledge graph relationship prediction methods are unable to capture the complex information of multi-relational knowledge graphs,thus overlooking key details contained in different entity pairs and mak...Most existing knowledge graph relationship prediction methods are unable to capture the complex information of multi-relational knowledge graphs,thus overlooking key details contained in different entity pairs and making it difficult to aggregate more complex relational features.Moreover,the insufficient capture of multi-hop relational information limits the processing capability of the global structure of the graph and reduces the accuracy of the knowledge graph completion task.This paper uses graph neural networks to construct new message functions for different relations,which can be defined as the rotation from the source entity to the target entity in the complex vector space for each relation,thereby improving the relation perception.To further enrich the relational diversity of different entities,we capture themulti-hop structural information in complex graph structure relations by incorporating two-hop relations for each entity and adding auxiliary edges to various relation combinations in the knowledge graph,thereby aggregating more complex relations and improving the reasoning ability of complex relational information.To verify the effectiveness of the proposed method,we conducted experiments on the WN18RR and FB15k-237 standard datasets.The results show that the method proposed in this study outperforms most existing methods.展开更多
Temporal knowledge graph completion(TKGC),which merges temporal information into traditional static knowledge graph completion(SKGC),has garnered increasing attention recently.Among numerous emerging approaches,transl...Temporal knowledge graph completion(TKGC),which merges temporal information into traditional static knowledge graph completion(SKGC),has garnered increasing attention recently.Among numerous emerging approaches,translation-based embedding models constitute a prominent approach in TKGC research.However,existing translation-based methods typically incorporate timestamps into entities or relations,rather than utilizing them independently.This practice fails to fully exploit the rich semantics inherent in temporal information,thereby weakening the expressive capability of models.To address this limitation,we propose embedding timestamps,like entities and relations,in one or more dedicated semantic spaces.After projecting all embeddings into a shared space,we use the relation-timestamp pair instead of the conventional relation embedding as the translation vector between head and tail entities.Our method elevates timestamps to the same representational significance as entities and relations.Based on this strategy,we introduce two novel translation-based embedding models:TE-TransR and TE-TransT.With the independent representation of timestamps,our method not only enhances capabilities in link prediction but also facilitates a relatively underexplored task,namely time prediction.To further bolster the precision and reliability of time prediction,we introduce a granular,time unit-based timestamp setting and a relation-specific evaluation protocol.Extensive experiments demonstrate that our models achieve strong performance on link prediction benchmarks,with TE-TransR outperforming existing baselines in the time prediction task.展开更多
Missing link prediction provides significant instruction for both analysis of network structure and mining of unknown links in incomplete networks. Recently, many algorithms have been proposed based on various node-si...Missing link prediction provides significant instruction for both analysis of network structure and mining of unknown links in incomplete networks. Recently, many algorithms have been proposed based on various node-similarity measures. Among these measures, the common neighbour index, the resource allocation index, and the local path index, stemming from different source, have been proved to have relatively high accuracy and low computational effort. In this paper, we propose a similarity index by combining the resource allocation index and the local path index. Simulation results on six unweighted networks show that the accuracy of the proposed index is higher than that of the local path one. Based on the same idea of the present index, we develop its corresponding weighted version and test it on several weighted networks. It is found that, except for the USAir network, the weighted variant also performs better than both the weighted resource allocation index and the weighted local path index. Due to the improved accuracy and the still low computational complexity, the indices may be useful for link prediction.展开更多
Information entropy has been proved to be an effective tool to quantify the structural importance of complex networks.In a previous work [Xu et al. Physica A, 456 294（2016）], we measure the contribution of a path in...Information entropy has been proved to be an effective tool to quantify the structural importance of complex networks.In a previous work [Xu et al. Physica A, 456 294（2016）], we measure the contribution of a path in link prediction with information entropy. In this paper, we further quantify the contribution of a path with both path entropy and path weight,and propose a weighted prediction index based on the contributions of paths, namely weighted path entropy（WPE）, to improve the prediction accuracy in weighted networks. Empirical experiments on six weighted real-world networks show that WPE achieves higher prediction accuracy than three other typical weighted indices.展开更多
Link prediction aims at detecting missing, spurious or evolving links in a network, based on the topological information and/or nodes＇ attributes of the network. Under the assumption that the likelihood of the existe...Link prediction aims at detecting missing, spurious or evolving links in a network, based on the topological information and/or nodes＇ attributes of the network. Under the assumption that the likelihood of the existence of a link between two nodes can be captured by nodes＇ similarity, several methods have been proposed to compute similarity directly or indirectly, with information on node degree. However, correctly predicting links is also crucial in revealing the link formation mechanisms and thus in providing more accurate modeling for networks. We here propose a novel method to predict links by incorporating stochastic-block-model link generating mechanisms with node degree. The proposed method first recov- ers the underlying block structure of a network by modularity-based belief propagation, and based on the recovered block structural information it models the link likelihood between two nodes to match the degree sequence of the network. Experiments on a set of real-world networks and synthetic networks generated by stochastic block model show that our proposed method is effective in detecting missing, spurious or evolving links of networks that can be well modeled by a stochastic block model. This approach efficiently complements the toolbox for complex network analysis, offering a novel tool to model links in stochastic block model networks that are fundamental in the modeling of real world complex networks.展开更多
Knowledge graph(KG) link prediction aims to address the problem of missing multiple valid triples in KGs. Existing approaches either struggle to efficiently model the message passing process of multi-hop paths or lack...Knowledge graph(KG) link prediction aims to address the problem of missing multiple valid triples in KGs. Existing approaches either struggle to efficiently model the message passing process of multi-hop paths or lack transparency of model prediction principles. In this paper,a new graph convolutional network path semantic-aware graph convolution network(PSGCN) is proposed to achieve modeling the semantic information of multi-hop paths. PSGCN first uses a random walk strategy to obtain all-hop paths in KGs,then captures the semantics of the paths by Word2Sec and long shortterm memory(LSTM) models,and finally converts them into a potential representation for the graph convolution network(GCN) messaging process. PSGCN combines path-based inference methods and graph neural networks to achieve better interpretability and scalability. In addition,to ensure the robustness of the model,the value of the path thresholdKis experimented on the FB15K-237 and WN18RR datasets,and the final results prove the effectiveness of the model.展开更多
Link prediction of combat networks is of significant military value for precisely identifying the vital infrastructure of the enemy target and optimizing the operational plan of our side.Due to the profound uncertaint...Link prediction of combat networks is of significant military value for precisely identifying the vital infrastructure of the enemy target and optimizing the operational plan of our side.Due to the profound uncertainty in the battleground circumstances, the acquired topological information of the opponent combat network always presents sparse characteristics. To solve this problem, a novel approach named network embedding based combat network link prediction(NECLP) is put forward to predict missing links of sparse combat networks. First,node embedding techniques are presented to preserve as much information of the combat network as possible using a low-dimensional space. Then, we put forward a solution algorithm to predict links between combat networks based on node embedding similarity. Last, massive experiments are carried out on a real-world combat network case to verify the validity and practicality of the proposed NECLP. This paper compares six baseline methods, and experimental results show that the NECLP has outstanding performance and substantially outperforms the baseline methods.展开更多
Link prediction,also known as Knowledge Graph Completion(KGC),is the common task in Knowledge Graphs(KGs)to predict missing connections between entities.Most existing methods focus on designing shallow,scalable models...Link prediction,also known as Knowledge Graph Completion(KGC),is the common task in Knowledge Graphs(KGs)to predict missing connections between entities.Most existing methods focus on designing shallow,scalable models,which have less expressive than deep,multi-layer models.Furthermore,most operations like addition,matrix multiplications or factorization are handcrafted based on a few known relation patterns in several wellknown datasets,such as FB15k,WN18,etc.However,due to the diversity and complex nature of real-world data distribution,it is inherently difficult to preset all latent patterns.To address this issue,we proposeKGE-ANS,a novel knowledge graph embedding framework for general link prediction tasks using automatic network search.KGEANS can learn a deep,multi-layer effective architecture to adapt to different datasets through neural architecture search.In addition,the general search spacewe designed is tailored forKGtasks.We performextensive experiments on benchmark datasets and the dataset constructed in this paper.The results show that our KGE-ANS outperforms several state-of-the-art methods,especially on these datasets with complex relation patterns.展开更多
Link prediction has attracted wide attention among interdisciplinaryresearchers as an important issue in complex network. It aims to predict the missing links in current networks and new links that will appear in futu...Link prediction has attracted wide attention among interdisciplinaryresearchers as an important issue in complex network. It aims to predict the missing links in current networks and new links that will appear in future networks.Despite the presence of missing links in the target network of link prediction studies, the network it processes remains macroscopically as a large connectedgraph. However, the complexity of the real world makes the complex networksabstracted from real systems often contain many isolated nodes. This phenomenon leads to existing link prediction methods not to efficiently implement the prediction of missing edges on isolated nodes. Therefore, the cold-start linkprediction is favored as one of the most valuable subproblems of traditional linkprediction. However, due to the loss of many links in the observation network, thetopological information available for completing the link prediction task is extremely scarce. This presents a severe challenge for the study of cold-start link prediction. Therefore, how to mine and fuse more available non-topologicalinformation from observed network becomes the key point to solve the problemof cold-start link prediction. In this paper, we propose a framework for solving thecold-start link prediction problem, a joint-weighted symmetric nonnegative matrixfactorization model fusing graph regularization information, based on low-rankapproximation algorithms in the field of machine learning. First, the nonlinear features in high-dimensional space of node attributes are captured by the designedgraph regularization term. Second, using a weighted matrix, we associate the attribute similarity and first order structure information of nodes and constrain eachother. Finally, a unified framework for implementing cold-start link prediction isconstructed by using a symmetric nonnegative matrix factorization model to integrate the multiple information extracted together. Extensive experimental validationon five real networks with attributes shows that the proposed model has very goodpredictive performance when predicting missing edges of isolated nodes.展开更多
A heterogeneous information network,which is composed of various types of nodes and edges,has a complex structure and rich information content,and is widely used in social networks,academic networks,e-commerce,and oth...A heterogeneous information network,which is composed of various types of nodes and edges,has a complex structure and rich information content,and is widely used in social networks,academic networks,e-commerce,and other fields.Link prediction,as a key task to reveal the unobserved relationships in the network,is of great significance in heterogeneous information networks.This paper reviews the application of presentation-based learning methods in link prediction of heterogeneous information networks.This paper introduces the basic concepts of heterogeneous information networks,and the theoretical basis of representation learning,and discusses the specific application of the deep learning model in node embedding learning and link prediction in detail.The effectiveness and superiority of these methods on multiple real data sets are demonstrated by experimental verification.展开更多
Currently,the link prediction algorithms primarily focus on studying the interaction between nodes based on chain structure and star structure,which predominantly rely on low-order structural information and do not ex...Currently,the link prediction algorithms primarily focus on studying the interaction between nodes based on chain structure and star structure,which predominantly rely on low-order structural information and do not explore the multivariate interactions between nodes from the perspective of higher-order structural information present in the network.The cycle structure is a higher-order structure that lies between the star and clique structures,where all nodes within the same cycle can interact with each other,even in the absence of direct edges.If a node is encompassed by multiple cycles,it indicates that the node interacts and associates with a greater number of nodes in the network,and it means the node is more important in the network to some extent.Furthermore,if two nodes are included in multiple cycles,it signifies the two nodes are more likely to be connected.Therefore,firstly,a multi-information fusion node importance algorithm based on the cycle structure information is proposed,which integrates both high-order and low-order structural information.Secondly,the obtained integrated structure information and node feature information is regarded as the input features,a two-channel graph neural network model is designed to learn the cycle structure information.Then,the cycle structure information is utilised for the task of link prediction,and a graph neural link predictor with multi-information interactions based on the cycle structure is developed.Finally,extensive experimental validation and analysis show that the node ranking result of the proposed node importance index is more consistent with the actual situation,the proposed graph neural network model can effectively learn the cycle structure information,and using higher-order structural information—cycle information proves to significantly enhance the overall link prediction performance.展开更多
Temporal link prediction has attracted increasingattention in various fields of complex networkanalysis, which has important value in the theory andapplication. However, many existing similarity-basedtemporal link pre...Temporal link prediction has attracted increasingattention in various fields of complex networkanalysis, which has important value in the theory andapplication. However, many existing similarity-basedtemporal link prediction methods, only analyze the influenceof the edge or the point, ignoring the influenceof the structures in the network. In this paper, boththe spatial-domain model and the time-domain modelare taken into consideration, and a novel temporal linkprediction method based on the evolution of motif features(TLP-EMF) is proposed. Firstly, a new generalizedsemi-triangle motif is proposed. And the multilevelcontribution of motif point (MP) and motif edge(ME) are described, which is based on the relationshipbetween the full-triangle and the semi-triangle. Secondly,the motif point density (MPD) index and themotif edge density (MED) index are also proposed ina similar way. Thirdly, a novel motif character fusionindex (MCF) and a novel motif character density index(MCD) are proposed for the spatial-informationprocessing. Furthermore, a novel forecasting model ofthe adaptive exponential weighted moving (AEWM)method is proposed for the time-domain evolution. Ituses the one-order exponential function to fit the effectof time evolution and uses the global attenuationparameter to adaptively quantify the changes in exponentialparameters. Experiments on three real social network data sets show that the proposed method caneffectively improve the accuracy of temporal link prediction.展开更多
Extrapolation on Temporal Knowledge Graphs(TKGs)aims to predict future knowledge from a set of historical Knowledge Graphs in chronological order.The temporally adjacent facts in TKGs naturally form event sequences,ca...Extrapolation on Temporal Knowledge Graphs(TKGs)aims to predict future knowledge from a set of historical Knowledge Graphs in chronological order.The temporally adjacent facts in TKGs naturally form event sequences,called event evolution patterns,implying informative temporal dependencies between events.Recently,many extrapolation works on TKGs have been devoted to modelling these evolutional patterns,but the task is still far from resolved because most existing works simply rely on encoding these patterns into entity representations while overlooking the significant information implied by relations of evolutional patterns.However,the authors realise that the temporal dependencies inherent in the relations of these event evolution patterns may guide the follow-up event prediction to some extent.To this end,a Temporal Relational Context-based Temporal Dependencies Learning Network(TRenD)is proposed to explore the temporal context of relations for more comprehensive learning of event evolution patterns,especially those temporal dependencies caused by interactive patterns of relations.Trend incorporates a semantic context unit to capture semantic correlations between relations,and a structural context unit to learn the interaction pattern of relations.By learning the temporal contexts of relations semantically and structurally,the authors gain insights into the underlying event evolution patterns,enabling to extract comprehensive historical information for future prediction better.Experimental results on benchmark datasets demonstrate the superiority of the model.展开更多
Knowledge graphs(KGs)often suffer from incompleteness,which limits their performance in practice where a vast amount of entities may coexist.To aid,knowledge graph completion(KGC)has been proposed to infer the missing...Knowledge graphs(KGs)often suffer from incompleteness,which limits their performance in practice where a vast amount of entities may coexist.To aid,knowledge graph completion(KGC)has been proposed to infer the missing links between entities.Among them,reasoning over relation paths in incomplete KG is a popular research topic.However,there are still some issues remained to be solved,such as path noise,path sparsity of KG,the ambiguity of inferred relation and lack of explanability in path representation.To simultaneously address the aforementioned challenges,we propose a novel rule guided link prediction model with path noise avoidance and disambiguation of inferred relation,termed as RPND.Specifically,we utilize path selection strategy to filter noisy path and reduce the interference of path noise.To alleviate the path sparsity of KG,we leverage path overlapping feature of similar relations and combine them based on the semantic similarity.For the ambiguity of inferred relation,we draw the insight from language model like transformer by introducing position embedding to reflect the order of relation along the path when learning its representation.Meanwhile,we employ logic rules to compose paths in semantic level to enhance the explanability of path representation.Extensive experiments conducted on benchmark datasets demonstrate the superiority of our proposed RPND model compared to its SOTAs.展开更多
Complex systems widely exist in nature and human society.There are complex interactions between system elements in a complex system,and systems show complex features at the macro level,such as emergence,self-organizat...Complex systems widely exist in nature and human society.There are complex interactions between system elements in a complex system,and systems show complex features at the macro level,such as emergence,self-organization,uncertainty,and dynamics.These complex features make it difficult to understand the internal operation mechanism of complex systems.Networked modeling of complex systems is a favorable means of understanding complex systems.It not only represents complex interactions but also reflects essential attributes of complex systems.This paper summarizes the research progress of complex systems modeling and analysis from the perspective of network science,including networked modeling,vital node analysis,network invulnerability analysis,network disintegration analysis,resilience analysis,complex network link prediction,and the attacker-defender game in complex networks.In addition,this paper presents some points of view on the trend and focus of future research on network analysis of complex systems.展开更多
Purpose:Due to the incompleteness nature of knowledge graphs(KGs),the task of predicting missing links between entities becomes important.Many previous approaches are static,this posed a notable problem that all meani...Purpose:Due to the incompleteness nature of knowledge graphs(KGs),the task of predicting missing links between entities becomes important.Many previous approaches are static,this posed a notable problem that all meanings of a polysemous entity share one embedding vector.This study aims to propose a polysemous embedding approach,named KG embedding under relational contexts(ContE for short),for missing link prediction.Design/methodology/approach:ContE models and infers different relationship patterns by considering the context of the relationship,which is implicit in the local neighborhood of the relationship.The forward and backward impacts of the relationship in ContE are mapped to two different embedding vectors,which represent the contextual information of the relationship.Then,according to the position of the entity,the entity’s polysemous representation is obtained by adding its static embedding vector to the corresponding context vector of the relationship.Findings:ContE is a fully expressive,that is,given any ground truth over the triples,there are embedding assignments to entities and relations that can precisely separate the true triples from false ones.ContE is capable of modeling four connectivity patterns such as symmetry,antisymmetry,inversion and composition.Research limitations:ContE needs to do a grid search to find best parameters to get best performance in practice,which is a time-consuming task.Sometimes,it requires longer entity vectors to get better performance than some other models.Practical implications:ContE is a bilinear model,which is a quite simple model that could be applied to large-scale KGs.By considering contexts of relations,ContE can distinguish the exact meaning of an entity in different triples so that when performing compositional reasoning,it is capable to infer the connectivity patterns of relations and achieves good performance on link prediction tasks.Originality/value:ContE considers the contexts of entities in terms of their positions in triples and the relationships they link to.It decomposes a relation vector into two vectors,namely,forward impact vector and backward impact vector in order to capture the relational contexts.ContE has the same low computational complexity as TransE.Therefore,it provides a new approach for contextualized knowledge graph embedding.展开更多
Based on the knot theory and researching of network structures of glucomannan molecules, the polysaccharides were analyzed. The link prediction analysis is to further reveal the interactions between polysaccharides, t...Based on the knot theory and researching of network structures of glucomannan molecules, the polysaccharides were analyzed. The link prediction analysis is to further reveal the interactions between polysaccharides, to elaborate QSAR of polysaccharides, and to analyze the network conformation relationships among polysaccharides. We made a classification for glucomannan molecules based on the related domestic and international theories, and investigated their network structures and application prospects. The knot theory and the link predictions not only simplify the glucomannan microscopic descriptions but also play a guiding role in predicting and regulating the structures.展开更多
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 patien...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 naive 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 21 CFR 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).展开更多
Air route network is the carrier of air traffic flow,and traffic assignment is a method to verify the rationality of air route network structure.Therefore,air route network generation based on traffic assignment has b...Air route network is the carrier of air traffic flow,and traffic assignment is a method to verify the rationality of air route network structure.Therefore,air route network generation based on traffic assignment has been becoming the research focus of airspace programming technology.Based on link prediction technology and optimization theory,a bi-level programming model is established in the paper.The model includes an upper level of air route network generation model and a lower level of traffic assignment model.The air route network structure generation incorporates network topology generation algorithm based on link prediction technology and optimal path search algorithm based on preference,and the traffic assignment adopts NSGA-Ⅲalgorithm.Based on the Python platform NetworkX complex network analysis library,a network of 57 airports,383 nodes,and 635 segments within China Airspace Beijing and Shanghai Flight Information Regions and 187975 sorties of traffic are used to simulate the bilevel model.Compared with the existing air route network,the proposed air route network can decrease the cost by 50.624%,lower the flight conflict coefficient by 33.564%,and reduce dynamic non-linear coefficient by 7.830%.展开更多
Online traffic simulation that feeds from online information to simulate vehicle movement in real-time has recently seen substantial advancement in the development of intelligent transportation systems and urban traff...Online traffic simulation that feeds from online information to simulate vehicle movement in real-time has recently seen substantial advancement in the development of intelligent transportation systems and urban traffic management.It has been a challenging problem due to three aspects:1)The diversity of traffic patterns due to heterogeneous layouts of urban intersections;2)The nature of complex spatiotemporal correlations;3)The requirement of dynamically adjusting the parameters of traffic models in a real-time system.To cater to these challenges,this paper proposes an online traffic simulation framework called automated urban traffic operation simulation via meta-learning(AUTOSIM).In particular,simulation models with various intersection layouts are automatically generated using an open-source simulation tool based on static traffic geometry attributes.Through a meta-learning technique,AUTOSIM enables an automated learning process for dynamic model settings of traffic scenarios featured with different spatiotemporal correlations.Besides,AUTOSIM is capable of adapting traffic model parameters according to dynamic traffic information in real-time by using a meta-learner.Through computational experiments,we demonstrate the effectiveness of the meta-learningbased framework that is capable of providing reliable supports to real-time traffic simulation and dynamic traffic operations.展开更多
文摘Most existing knowledge graph relationship prediction methods are unable to capture the complex information of multi-relational knowledge graphs,thus overlooking key details contained in different entity pairs and making it difficult to aggregate more complex relational features.Moreover,the insufficient capture of multi-hop relational information limits the processing capability of the global structure of the graph and reduces the accuracy of the knowledge graph completion task.This paper uses graph neural networks to construct new message functions for different relations,which can be defined as the rotation from the source entity to the target entity in the complex vector space for each relation,thereby improving the relation perception.To further enrich the relational diversity of different entities,we capture themulti-hop structural information in complex graph structure relations by incorporating two-hop relations for each entity and adding auxiliary edges to various relation combinations in the knowledge graph,thereby aggregating more complex relations and improving the reasoning ability of complex relational information.To verify the effectiveness of the proposed method,we conducted experiments on the WN18RR and FB15k-237 standard datasets.The results show that the method proposed in this study outperforms most existing methods.
基金supported by the National Natural Science Foundation of China under Grant No.72293575.
文摘Temporal knowledge graph completion(TKGC),which merges temporal information into traditional static knowledge graph completion(SKGC),has garnered increasing attention recently.Among numerous emerging approaches,translation-based embedding models constitute a prominent approach in TKGC research.However,existing translation-based methods typically incorporate timestamps into entities or relations,rather than utilizing them independently.This practice fails to fully exploit the rich semantics inherent in temporal information,thereby weakening the expressive capability of models.To address this limitation,we propose embedding timestamps,like entities and relations,in one or more dedicated semantic spaces.After projecting all embeddings into a shared space,we use the relation-timestamp pair instead of the conventional relation embedding as the translation vector between head and tail entities.Our method elevates timestamps to the same representational significance as entities and relations.Based on this strategy,we introduce two novel translation-based embedding models:TE-TransR and TE-TransT.With the independent representation of timestamps,our method not only enhances capabilities in link prediction but also facilitates a relatively underexplored task,namely time prediction.To further bolster the precision and reliability of time prediction,we introduce a granular,time unit-based timestamp setting and a relation-specific evaluation protocol.Extensive experiments demonstrate that our models achieve strong performance on link prediction benchmarks,with TE-TransR outperforming existing baselines in the time prediction task.
基金Project supported by the National Natural Science Foundation of China (Grant No. 30570432)the Young Research Foundation of Education Department of Hunan Province of China (Grant No. 11B128)partly by the Doctor Startup Project of Xiangtan University (Grant No. 10QDZ20)
文摘Missing link prediction provides significant instruction for both analysis of network structure and mining of unknown links in incomplete networks. Recently, many algorithms have been proposed based on various node-similarity measures. Among these measures, the common neighbour index, the resource allocation index, and the local path index, stemming from different source, have been proved to have relatively high accuracy and low computational effort. In this paper, we propose a similarity index by combining the resource allocation index and the local path index. Simulation results on six unweighted networks show that the accuracy of the proposed index is higher than that of the local path one. Based on the same idea of the present index, we develop its corresponding weighted version and test it on several weighted networks. It is found that, except for the USAir network, the weighted variant also performs better than both the weighted resource allocation index and the weighted local path index. Due to the improved accuracy and the still low computational complexity, the indices may be useful for link prediction.
基金supported by the National Natural Science Foundation of China(Grant Nos.61201173 and 61304154)the Specialized Research Fund for the Doctoral Program of Higher Education of China(Grant No.20133219120032)+1 种基金the Postdoctoral Science Foundation of China(Grant No.2013M541673)China Postdoctoral Science Special Foundation(Grant No.2015T80556)
文摘Information entropy has been proved to be an effective tool to quantify the structural importance of complex networks.In a previous work [Xu et al. Physica A, 456 294（2016）], we measure the contribution of a path in link prediction with information entropy. In this paper, we further quantify the contribution of a path with both path entropy and path weight,and propose a weighted prediction index based on the contributions of paths, namely weighted path entropy（WPE）, to improve the prediction accuracy in weighted networks. Empirical experiments on six weighted real-world networks show that WPE achieves higher prediction accuracy than three other typical weighted indices.
基金Project supported by the National Natural Science Foundation of China(Grants No.61202262)the Natural Science Foundation of Jiangsu Province,China(Grants No.BK2012328)the Specialized Research Fund for the Doctoral Program of Higher Education of China(Grants No.20120092120034)
文摘Link prediction aims at detecting missing, spurious or evolving links in a network, based on the topological information and/or nodes＇ attributes of the network. Under the assumption that the likelihood of the existence of a link between two nodes can be captured by nodes＇ similarity, several methods have been proposed to compute similarity directly or indirectly, with information on node degree. However, correctly predicting links is also crucial in revealing the link formation mechanisms and thus in providing more accurate modeling for networks. We here propose a novel method to predict links by incorporating stochastic-block-model link generating mechanisms with node degree. The proposed method first recov- ers the underlying block structure of a network by modularity-based belief propagation, and based on the recovered block structural information it models the link likelihood between two nodes to match the degree sequence of the network. Experiments on a set of real-world networks and synthetic networks generated by stochastic block model show that our proposed method is effective in detecting missing, spurious or evolving links of networks that can be well modeled by a stochastic block model. This approach efficiently complements the toolbox for complex network analysis, offering a novel tool to model links in stochastic block model networks that are fundamental in the modeling of real world complex networks.
基金Supported by the National Natural Science Foundation of China(No.61876144).
文摘Knowledge graph(KG) link prediction aims to address the problem of missing multiple valid triples in KGs. Existing approaches either struggle to efficiently model the message passing process of multi-hop paths or lack transparency of model prediction principles. In this paper,a new graph convolutional network path semantic-aware graph convolution network(PSGCN) is proposed to achieve modeling the semantic information of multi-hop paths. PSGCN first uses a random walk strategy to obtain all-hop paths in KGs,then captures the semantics of the paths by Word2Sec and long shortterm memory(LSTM) models,and finally converts them into a potential representation for the graph convolution network(GCN) messaging process. PSGCN combines path-based inference methods and graph neural networks to achieve better interpretability and scalability. In addition,to ensure the robustness of the model,the value of the path thresholdKis experimented on the FB15K-237 and WN18RR datasets,and the final results prove the effectiveness of the model.
基金supported by the National Natural Science Foundation of China (7190121271971213)。
文摘Link prediction of combat networks is of significant military value for precisely identifying the vital infrastructure of the enemy target and optimizing the operational plan of our side.Due to the profound uncertainty in the battleground circumstances, the acquired topological information of the opponent combat network always presents sparse characteristics. To solve this problem, a novel approach named network embedding based combat network link prediction(NECLP) is put forward to predict missing links of sparse combat networks. First,node embedding techniques are presented to preserve as much information of the combat network as possible using a low-dimensional space. Then, we put forward a solution algorithm to predict links between combat networks based on node embedding similarity. Last, massive experiments are carried out on a real-world combat network case to verify the validity and practicality of the proposed NECLP. This paper compares six baseline methods, and experimental results show that the NECLP has outstanding performance and substantially outperforms the baseline methods.
基金supported in part by the Major Scientific and Technological Projects of CNPC under Grant ZD2019-183-006.
文摘Link prediction,also known as Knowledge Graph Completion(KGC),is the common task in Knowledge Graphs(KGs)to predict missing connections between entities.Most existing methods focus on designing shallow,scalable models,which have less expressive than deep,multi-layer models.Furthermore,most operations like addition,matrix multiplications or factorization are handcrafted based on a few known relation patterns in several wellknown datasets,such as FB15k,WN18,etc.However,due to the diversity and complex nature of real-world data distribution,it is inherently difficult to preset all latent patterns.To address this issue,we proposeKGE-ANS,a novel knowledge graph embedding framework for general link prediction tasks using automatic network search.KGEANS can learn a deep,multi-layer effective architecture to adapt to different datasets through neural architecture search.In addition,the general search spacewe designed is tailored forKGtasks.We performextensive experiments on benchmark datasets and the dataset constructed in this paper.The results show that our KGE-ANS outperforms several state-of-the-art methods,especially on these datasets with complex relation patterns.
基金supported by the Teaching Reform Research Project of Qinghai Minzu University,China(2021-JYYB-009)the“Chunhui Plan”Cooperative Scientific Research Project of the Ministry of Education of China(2018).
文摘Link prediction has attracted wide attention among interdisciplinaryresearchers as an important issue in complex network. It aims to predict the missing links in current networks and new links that will appear in future networks.Despite the presence of missing links in the target network of link prediction studies, the network it processes remains macroscopically as a large connectedgraph. However, the complexity of the real world makes the complex networksabstracted from real systems often contain many isolated nodes. This phenomenon leads to existing link prediction methods not to efficiently implement the prediction of missing edges on isolated nodes. Therefore, the cold-start linkprediction is favored as one of the most valuable subproblems of traditional linkprediction. However, due to the loss of many links in the observation network, thetopological information available for completing the link prediction task is extremely scarce. This presents a severe challenge for the study of cold-start link prediction. Therefore, how to mine and fuse more available non-topologicalinformation from observed network becomes the key point to solve the problemof cold-start link prediction. In this paper, we propose a framework for solving thecold-start link prediction problem, a joint-weighted symmetric nonnegative matrixfactorization model fusing graph regularization information, based on low-rankapproximation algorithms in the field of machine learning. First, the nonlinear features in high-dimensional space of node attributes are captured by the designedgraph regularization term. Second, using a weighted matrix, we associate the attribute similarity and first order structure information of nodes and constrain eachother. Finally, a unified framework for implementing cold-start link prediction isconstructed by using a symmetric nonnegative matrix factorization model to integrate the multiple information extracted together. Extensive experimental validationon five real networks with attributes shows that the proposed model has very goodpredictive performance when predicting missing edges of isolated nodes.
基金Science and Technology Research Project of Jiangxi Provincial Department of Education(Project No.GJJ211348,GJJ211347 and GJJ2201056)。
文摘A heterogeneous information network,which is composed of various types of nodes and edges,has a complex structure and rich information content,and is widely used in social networks,academic networks,e-commerce,and other fields.Link prediction,as a key task to reveal the unobserved relationships in the network,is of great significance in heterogeneous information networks.This paper reviews the application of presentation-based learning methods in link prediction of heterogeneous information networks.This paper introduces the basic concepts of heterogeneous information networks,and the theoretical basis of representation learning,and discusses the specific application of the deep learning model in node embedding learning and link prediction in detail.The effectiveness and superiority of these methods on multiple real data sets are demonstrated by experimental verification.
基金National Key Research and Development Program of China,Grant/Award Number:2020YFC1523300Construction of Innovation Platform Program of Qinghai Province of China,Grant/Award Number:2022-ZJ-T02。
文摘Currently,the link prediction algorithms primarily focus on studying the interaction between nodes based on chain structure and star structure,which predominantly rely on low-order structural information and do not explore the multivariate interactions between nodes from the perspective of higher-order structural information present in the network.The cycle structure is a higher-order structure that lies between the star and clique structures,where all nodes within the same cycle can interact with each other,even in the absence of direct edges.If a node is encompassed by multiple cycles,it indicates that the node interacts and associates with a greater number of nodes in the network,and it means the node is more important in the network to some extent.Furthermore,if two nodes are included in multiple cycles,it signifies the two nodes are more likely to be connected.Therefore,firstly,a multi-information fusion node importance algorithm based on the cycle structure information is proposed,which integrates both high-order and low-order structural information.Secondly,the obtained integrated structure information and node feature information is regarded as the input features,a two-channel graph neural network model is designed to learn the cycle structure information.Then,the cycle structure information is utilised for the task of link prediction,and a graph neural link predictor with multi-information interactions based on the cycle structure is developed.Finally,extensive experimental validation and analysis show that the node ranking result of the proposed node importance index is more consistent with the actual situation,the proposed graph neural network model can effectively learn the cycle structure information,and using higher-order structural information—cycle information proves to significantly enhance the overall link prediction performance.
文摘Temporal link prediction has attracted increasingattention in various fields of complex networkanalysis, which has important value in the theory andapplication. However, many existing similarity-basedtemporal link prediction methods, only analyze the influenceof the edge or the point, ignoring the influenceof the structures in the network. In this paper, boththe spatial-domain model and the time-domain modelare taken into consideration, and a novel temporal linkprediction method based on the evolution of motif features(TLP-EMF) is proposed. Firstly, a new generalizedsemi-triangle motif is proposed. And the multilevelcontribution of motif point (MP) and motif edge(ME) are described, which is based on the relationshipbetween the full-triangle and the semi-triangle. Secondly,the motif point density (MPD) index and themotif edge density (MED) index are also proposed ina similar way. Thirdly, a novel motif character fusionindex (MCF) and a novel motif character density index(MCD) are proposed for the spatial-informationprocessing. Furthermore, a novel forecasting model ofthe adaptive exponential weighted moving (AEWM)method is proposed for the time-domain evolution. Ituses the one-order exponential function to fit the effectof time evolution and uses the global attenuationparameter to adaptively quantify the changes in exponentialparameters. Experiments on three real social network data sets show that the proposed method caneffectively improve the accuracy of temporal link prediction.
基金supported in part by the National Natural Science Foundation of China(No.62302507)and the funding of Harbin Institute of Technology(Shenzhen)(No.20210035).
文摘Extrapolation on Temporal Knowledge Graphs(TKGs)aims to predict future knowledge from a set of historical Knowledge Graphs in chronological order.The temporally adjacent facts in TKGs naturally form event sequences,called event evolution patterns,implying informative temporal dependencies between events.Recently,many extrapolation works on TKGs have been devoted to modelling these evolutional patterns,but the task is still far from resolved because most existing works simply rely on encoding these patterns into entity representations while overlooking the significant information implied by relations of evolutional patterns.However,the authors realise that the temporal dependencies inherent in the relations of these event evolution patterns may guide the follow-up event prediction to some extent.To this end,a Temporal Relational Context-based Temporal Dependencies Learning Network(TRenD)is proposed to explore the temporal context of relations for more comprehensive learning of event evolution patterns,especially those temporal dependencies caused by interactive patterns of relations.Trend incorporates a semantic context unit to capture semantic correlations between relations,and a structural context unit to learn the interaction pattern of relations.By learning the temporal contexts of relations semantically and structurally,the authors gain insights into the underlying event evolution patterns,enabling to extract comprehensive historical information for future prediction better.Experimental results on benchmark datasets demonstrate the superiority of the model.
基金supported in part by the National Natural Science Foundation of China(Grant Nos.62120106008,62376085).
文摘Knowledge graphs(KGs)often suffer from incompleteness,which limits their performance in practice where a vast amount of entities may coexist.To aid,knowledge graph completion(KGC)has been proposed to infer the missing links between entities.Among them,reasoning over relation paths in incomplete KG is a popular research topic.However,there are still some issues remained to be solved,such as path noise,path sparsity of KG,the ambiguity of inferred relation and lack of explanability in path representation.To simultaneously address the aforementioned challenges,we propose a novel rule guided link prediction model with path noise avoidance and disambiguation of inferred relation,termed as RPND.Specifically,we utilize path selection strategy to filter noisy path and reduce the interference of path noise.To alleviate the path sparsity of KG,we leverage path overlapping feature of similar relations and combine them based on the semantic similarity.For the ambiguity of inferred relation,we draw the insight from language model like transformer by introducing position embedding to reflect the order of relation along the path when learning its representation.Meanwhile,we employ logic rules to compose paths in semantic level to enhance the explanability of path representation.Extensive experiments conducted on benchmark datasets demonstrate the superiority of our proposed RPND model compared to its SOTAs.
基金supported by the State Key Program of National Natural Science Foundation of China(72231011)the National Natural Science Foundation of China(72071206,72001209,71971213)the Science Foundation for Outstanding Youth Scholars of Hunan Province(2022JJ20047).
文摘Complex systems widely exist in nature and human society.There are complex interactions between system elements in a complex system,and systems show complex features at the macro level,such as emergence,self-organization,uncertainty,and dynamics.These complex features make it difficult to understand the internal operation mechanism of complex systems.Networked modeling of complex systems is a favorable means of understanding complex systems.It not only represents complex interactions but also reflects essential attributes of complex systems.This paper summarizes the research progress of complex systems modeling and analysis from the perspective of network science,including networked modeling,vital node analysis,network invulnerability analysis,network disintegration analysis,resilience analysis,complex network link prediction,and the attacker-defender game in complex networks.In addition,this paper presents some points of view on the trend and focus of future research on network analysis of complex systems.
基金supported by the Key R&D Program Project of Zhejiang Province under Grant no.2019 C01004 and 2021C02004.
文摘Purpose:Due to the incompleteness nature of knowledge graphs(KGs),the task of predicting missing links between entities becomes important.Many previous approaches are static,this posed a notable problem that all meanings of a polysemous entity share one embedding vector.This study aims to propose a polysemous embedding approach,named KG embedding under relational contexts(ContE for short),for missing link prediction.Design/methodology/approach:ContE models and infers different relationship patterns by considering the context of the relationship,which is implicit in the local neighborhood of the relationship.The forward and backward impacts of the relationship in ContE are mapped to two different embedding vectors,which represent the contextual information of the relationship.Then,according to the position of the entity,the entity’s polysemous representation is obtained by adding its static embedding vector to the corresponding context vector of the relationship.Findings:ContE is a fully expressive,that is,given any ground truth over the triples,there are embedding assignments to entities and relations that can precisely separate the true triples from false ones.ContE is capable of modeling four connectivity patterns such as symmetry,antisymmetry,inversion and composition.Research limitations:ContE needs to do a grid search to find best parameters to get best performance in practice,which is a time-consuming task.Sometimes,it requires longer entity vectors to get better performance than some other models.Practical implications:ContE is a bilinear model,which is a quite simple model that could be applied to large-scale KGs.By considering contexts of relations,ContE can distinguish the exact meaning of an entity in different triples so that when performing compositional reasoning,it is capable to infer the connectivity patterns of relations and achieves good performance on link prediction tasks.Originality/value:ContE considers the contexts of entities in terms of their positions in triples and the relationships they link to.It decomposes a relation vector into two vectors,namely,forward impact vector and backward impact vector in order to capture the relational contexts.ContE has the same low computational complexity as TransE.Therefore,it provides a new approach for contextualized knowledge graph embedding.
基金Supported by the National Natural Science Foundation of China(31271837 and 31071518)Specialized Research Fund for the Doctoral Program of Higher Education jointly funded by Ministry of Education(20113515110010)+2 种基金Special Research Funds from Ministry of Science and Technology(2012GA7200022)Major projects of industries,universities and research in Fujian Province(2013N5003)Natural Science Foundation of Fujian Province(2011J0101)
文摘Based on the knot theory and researching of network structures of glucomannan molecules, the polysaccharides were analyzed. The link prediction analysis is to further reveal the interactions between polysaccharides, to elaborate QSAR of polysaccharides, and to analyze the network conformation relationships among polysaccharides. We made a classification for glucomannan molecules based on the related domestic and international theories, and investigated their network structures and application prospects. The knot theory and the link predictions not only simplify the glucomannan microscopic descriptions but also play a guiding role in predicting and regulating the structures.
基金Fundamental Research Funds for the Central Universities in China,No.N161608001 and No.N171903002
文摘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 naive 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 21 CFR 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).
文摘Air route network is the carrier of air traffic flow,and traffic assignment is a method to verify the rationality of air route network structure.Therefore,air route network generation based on traffic assignment has been becoming the research focus of airspace programming technology.Based on link prediction technology and optimization theory,a bi-level programming model is established in the paper.The model includes an upper level of air route network generation model and a lower level of traffic assignment model.The air route network structure generation incorporates network topology generation algorithm based on link prediction technology and optimal path search algorithm based on preference,and the traffic assignment adopts NSGA-Ⅲalgorithm.Based on the Python platform NetworkX complex network analysis library,a network of 57 airports,383 nodes,and 635 segments within China Airspace Beijing and Shanghai Flight Information Regions and 187975 sorties of traffic are used to simulate the bilevel model.Compared with the existing air route network,the proposed air route network can decrease the cost by 50.624%,lower the flight conflict coefficient by 33.564%,and reduce dynamic non-linear coefficient by 7.830%.
基金supported by the National Natural Science Foundation of China(62173329)。
文摘Online traffic simulation that feeds from online information to simulate vehicle movement in real-time has recently seen substantial advancement in the development of intelligent transportation systems and urban traffic management.It has been a challenging problem due to three aspects:1)The diversity of traffic patterns due to heterogeneous layouts of urban intersections;2)The nature of complex spatiotemporal correlations;3)The requirement of dynamically adjusting the parameters of traffic models in a real-time system.To cater to these challenges,this paper proposes an online traffic simulation framework called automated urban traffic operation simulation via meta-learning(AUTOSIM).In particular,simulation models with various intersection layouts are automatically generated using an open-source simulation tool based on static traffic geometry attributes.Through a meta-learning technique,AUTOSIM enables an automated learning process for dynamic model settings of traffic scenarios featured with different spatiotemporal correlations.Besides,AUTOSIM is capable of adapting traffic model parameters according to dynamic traffic information in real-time by using a meta-learner.Through computational experiments,we demonstrate the effectiveness of the meta-learningbased framework that is capable of providing reliable supports to real-time traffic simulation and dynamic traffic operations.
