Multi-relational Graph Research Articles

An Algorithm for Predicting Vehicle Behavior in High-Speed Scenes Using Visual and Dynamic Graphical Neural Network Inference

Accidents caused by vehicles changing lanes occur frequently on highways. Moreover, frequent lane changes can severely impact traffic flow during peak commuting hours and on busy roads. A novel framework based on a multi-relational graph convolutional network (MR-GCN) is herein proposed to address these challenges. First, a dynamic multilevel relational graph was designed to describe interactions between vehicles and road objects at different spatio-temporal granularities, with real-time updates to edge weights to enhance understanding of complex traffic scenarios. Second, an improved spatio-temporal interaction graph generation method was introduced, focusing on spatio-temporal variations and capturing complex interaction patterns to enhance prediction accuracy and adaptability. Finally, by integrating a dynamic multi-relational graph convolutional network (DMR-GCN) with dynamic scene sensing and interaction learning mechanisms, the framework enables real-time updates of complex vehicle relationships, thereby improving behavior prediction’s accuracy and real-time performance. Experimental validation on multiple benchmark datasets, including KITTI, Apollo, and Indian, showed that our algorithmic framework achieves significant performance improvements in vehicle behavior prediction tasks, with Map, Recall, and F1 scores reaching 90%, 88%, and 89%, respectively, outperforming existing algorithms. Additionally, the model achieved a Map of 91%, a Recall of 89%, and an F1 score of 90% under congested road conditions in a self-collected high-speed traffic scenario dataset, further demonstrating its robustness and adaptability in high-speed traffic conditions. These results show that the proposed model is highly practical and stable in real-world applications such as traffic control systems and self-driving vehicles, providing strong support for efficient vehicle behavior prediction.

Multi-relational graph contrastive learning with learnable graph augmentation

Multi-relational graph learning aims to embed entities and relations in knowledge graphs into low-dimensional representations, which has been successfully applied to various multi-relationship prediction tasks, such as information retrieval, question answering, and etc. Recently, contrastive learning has shown remarkable performance in multi-relational graph learning by data augmentation mechanisms to deal with highly sparse data. In this paper, we present a Multi-Relational Graph Contrastive Learning architecture (MRGCL) for multi-relational graph learning. More specifically, our MRGCL first proposes a Multi-relational Graph Hierarchical Attention Networks (MGHAN) to identify the importance between entities, which can learn the importance at different levels between entities for extracting the local graph dependency. Then, two graph augmented views with adaptive topology are automatically learned by the variant MGHAN, which can automatically adapt for different multi-relational graph datasets from diverse domains. Moreover, a subgraph contrastive loss is designed, which generates positives per anchor by calculating strongly connected subgraph embeddings of the anchor as the supervised signals. Comprehensive experiments on multi-relational datasets from three application domains indicate the superiority of our MRGCL over various state-of-the-art methods. Our datasets and source code are published at https://github.com/Legendary-L/MRGCL.

Pretrainable geometric graph neural network for antibody affinity maturation

Increasing the binding affinity of an antibody to its target antigen is a crucial task in antibody therapeutics development. This paper presents a pretrainable geometric graph neural network, GearBind, and explores its potential in in silico affinity maturation. Leveraging multi-relational graph construction, multi-level geometric message passing and contrastive pretraining on mass-scale, unlabeled protein structural data, GearBind outperforms previous state-of-the-art approaches on SKEMPI and an independent test set. A powerful ensemble model based on GearBind is then derived and used to successfully enhance the binding of two antibodies with distinct formats and target antigens. ELISA EC50 values of the designed antibody mutants are decreased by up to 17 fold, and KD values by up to 6.1 fold. These promising results underscore the utility of geometric deep learning and effective pretraining in macromolecule interaction modeling tasks.

Multi-Relational Graph Representation Learning for Financial Statement Fraud Detection

Multi-Relational Graph Representation Learning for Financial Statement Fraud Detection

Unsupervised Social Bot Detection via Structural Information Theory

Research on social bot detection plays a crucial role in maintaining the order and reliability of information dissemination while increasing trust in social interactions. The current mainstream social bot detection models rely on black-box neural network technology, for example, Graph Neural Network, Transformer, and so on, which lacks interpretability. In this work, we present UnDBot, a novel unsupervised, interpretable, yet effective, and practical framework for detecting social bots. This framework is built upon structural information theory. We begin by designing three social relationship metrics that capture various aspects of social bot behaviors: posting type distribution , posting influence , and follow-to-follower ratio . Three new relationships are utilized to construct a new, unified, and weighted social multi-relational graph, aiming to model the relevance of social user behaviors and discover long-distance correlations between users. Second, we introduce a novel method for optimizing heterogeneous structural entropy. This method involves the personalized aggregation of edge information from the social multi-relational graph to generate a two-dimensional encoding tree. The heterogeneous structural entropy facilitates decoding of the substantial structure of the social bots network and enables hierarchical clustering of social bots. Third, a new community labeling method is presented to distinguish social bot communities by computing the user’s stationary distribution, measuring user contributions to network structure, and counting the intensity of user aggregation within the community. Compared with 10 representative social bot detection approaches, comprehensive experiments demonstrate the advantages of effectiveness and interpretability of UnDBot on 4 real social network datasets.

A joint entity Relation Extraction method for document level Traditional Chinese Medicine texts

Chinese medicine is a unique and complex medical system with complete and rich scientific theories. The textual data of Traditional Chinese Medicine (TCM) contains a large amount of relevant knowledge in the field of TCM, which can serve as guidance for accurate disease diagnosis as well as efficient disease prevention and treatment. Existing TCM texts are disorganized and lack a uniform standard. For this reason, this paper proposes a joint extraction framework by using graph convolutional networks to extract joint entity relations on document-level TCM texts to achieve TCM entity relation mining. More specifically, we first finetune the pre-trained language model by using the TCM domain knowledge to obtain the task-specific model. Taking the integrity of TCM into account, we extract the complete entities as well as the relations corresponding to diagnosis and treatment from the document-level medical cases by using multiple features such as word fusion coding, TCM lexicon information, and multi-relational graph convolutional networks. The experimental results show that the proposed method outperforms the state-of-the-art methods. It has an F1-score of 90.7% for Name Entity Recognization and 76.14% for Relation Extraction on the TCM dataset, which significantly improves the ability to extract entity relations from TCM texts. Code is available at https://github.com/xxxxwx/TCMERE.

MRME-Net: Towards multi-semantics learning and long-tail problem of efficient event detection from social messages

Discovering trending social events (e.g., major meetings, political scandals, natural disasters, etc.) from social messages is vital because it emphasizes important events and can help people comprehend the world. However, the heterogeneous semantics enrichment, severe long-tail problems, and sparse text contents of social messages pose great challenges to event detection, often leading to limited generalization ability and accuracy. In this paper, we propose a novel Multi-Relational Meta-Enhanced Network (MRME-Net) architecture to learn social events. First, we model social messages into a multi-relational message graph, incorporating abundant meta-semantics along with various meta-relations. Second, we present a multi-relational graph attention network based on Sophia by using a dual-step message aggregation mechanisms to capture the local features of neighboring messages and global semantics of mutiple relations and ultimately learn social message embeddings. We use Sophia optimizer to reduce the massive time and cost of training. Third, in order to address the long-tail problem, we introduce a locally-adapted meta-learning framework in social event detection for the first time and propose a novel META-TAILENH embedding enhancement strategy to refine tail node embeddings in multi-relational graph. Eventually, we conduct the detection of social events according to the hierarchical clustering algorithm. Extensive experiments have been carried out to evaluate MRME-Net on the MAVEN and Twitter dataset, revealing a notable improvement of 3 %–13 %, 4 %–20 % and 6 %–30 % increases on NMI, AMI and ARI in the social event detection task.

Relgraph: A Multi-Relational Graph Neural Network Framework for Knowledge Graph Reasoning Based on Relation Graph

Multi-relational graph neural networks (GNNs) have found widespread application in tasks involving enhancing knowledge representation and knowledge graph (KG) reasoning. However, existing multi-relational GNNs still face limitations in modeling the exchange of information between predicates. To address these challenges, we introduce Relgraph, a novel KG reasoning framework. This framework introduces relation graphs to explicitly model the interactions between different relations, enabling more comprehensive and accurate handling of representation learning and reasoning tasks on KGs. Furthermore, we design a machine learning algorithm based on the attention mechanism to simultaneously optimize the original graph and its corresponding relation graph. Benchmark and experimental results on large-scale KGs demonstrate that the Relgraph framework improves KG reasoning performance. The framework exhibits a certain degree of versatility and can be seamlessly integrated with various traditional translation models.

A novel interactive deep cascade spectral graph convolutional network with multi-relational graphs for disease prediction

Graph neural networks (GNNs) have recently grown in popularity for disease prediction. Existing GNN-based methods primarily build the graph topological structure around a single modality and combine it with other modalities to acquire feature representations of acquisitions. The complicated relationship in each modality, however, may not be well highlighted due to its specificity. Further, relatively shallow networks restrict adequate extraction of high-level features, affecting disease prediction performance. Accordingly, this paper develops a new interactive deep cascade spectral graph convolutional network with multi-relational graphs (IDCGN) for disease prediction tasks. Its crucial points lie in constructing multiple relational graphs and dual cascade spectral graph convolution branches with interaction (DCSGBI). Specifically, the former designs a pairwise imaging-based edge generator and a pairwise non-imaging-based edge generator from different modalities by devising two learnable networks, which adaptively capture graph structures and provide various views of the same acquisition to aid in disease diagnosis. Again, DCSGBI is established to enrich high-level semantic information and low-level details of disease data. It devises a cascade spectral graph convolution operator for each branch and incorporates the interaction strategy between different branches into the network, successfully forming a deep model and capturing complementary information from diverse branches. In this manner, more favorable and sufficient features are learned for a reliable diagnosis. Experiments on several disease datasets reveal that IDCGN exceeds state-of-the-art models and achieves promising results.

A Multi-View Temporal Knowledge Graph Reasoning Framework with Interpretable Logic Rules and Feature Fusion

A temporal knowledge graph represents temporal information between entities in a multi-relational graph. Its reasoning aims to infer and predict potential links among entities. Predicting time-aware entities is a challenging task due to significant differences in entity appearances over time, such as different timestamps and frequencies. Current embedding-based similarity-matching methods have been introduced for predicting temporal facts. However, they lack deterministic logical explainability and cannot model the dynamic evolution of entities over time. To address these challenges, we propose a novel framework for temporal knowledge graph reasoning based on multi-view feature fusion (MVFF). First, MVFF extracts logical rules and uses the Gumbel-Softmax trick to sample high-quality rules. Second, it integrates logical rules, temporal quadruples, and factual triples to capture semantic features, temporal information, and structural information to solve link prediction tasks. Through experiments on four benchmark datasets, we show that MVFF outperforms state-of-the-art methods, providing not only better performance but also interpretable results.

Semantic-Enhanced Knowledge Graph Completion

Knowledge graphs (KGs) serve as structured representations of knowledge, comprising entities and relations. KGs are inherently incomplete, sparse, and have a strong need for completion. Although many knowledge graph embedding models have been designed for knowledge graph completion, they predominantly focus on capturing observable correlations between entities. Due to the sparsity of KGs, potential semantic correlations are challenging to capture. To tackle this problem, we propose a model entitled semantic-enhanced knowledge graph completion (SE-KGC). SE-KGC effectively addresses the issue by incorporating predefined semantic patterns, enabling the capture of semantic correlations between entities and enhancing features for representation learning. To implement this approach, we employ a multi-relational graph convolution network encoder, which effectively encodes the KG. Subsequently, we utilize a scoring decoder to evaluate triplets. Experimental results demonstrate that our SE-KGC model outperforms other state-of-the-art methods in link-prediction tasks across three datasets. Specifically, compared to the baselines, SE-KGC achieved improvements of 11.7%, 1.05%, and 2.30% in terms of MRR on these three datasets. Furthermore, we present a comprehensive analysis of the contributions of different semantic patterns, and find that entities with higher connectivity play a pivotal role in effectively capturing and characterizing semantic information.

A Multi-Relational Graph Encoder Network for Fine-Grained Prediction of MiRNA-Disease Associations.

MicroRNAs (miRNAs) are critical in diagnosing and treating various diseases. Automatically demystifying the interdependent relationships between miRNAs and diseases has recently made remarkable progress, but their fine-grained interactive relationships still need to be explored. We propose a multi-relational graph encoder network for fine-grained prediction of miRNA-disease associations (MRFGMDA), which uses practical and current datasets to construct a multi-relational graph encoder network to predict disease-related miRNAs and their specific relationship types (upregulation, downregulation, or dysregulation). We evaluated MRFGMDA and found that it accurately predicted miRNA-disease associations, which could have far-reaching implications for clinical medical analysis, early diagnosis, prevention, and treatment. Case analyses, Kaplan-Meier survival analysis, expression difference analysis, and immune infiltration analysis further demonstrated the effectiveness and feasibility of MRFGMDA in uncovering potential disease-related miRNAs. Overall, our work represents a significant step toward improving the prediction of miRNA-disease associations using a fine-grained approach could lead to more accurate diagnosis and treatment of diseases.

Semantic similarity-based program retrieval: a multi-relational graph perspective

Semantic similarity-based program retrieval: a multi-relational graph perspective

Dynamic multi-fusion spatio-temporal graph neural network for multivariate time series forecasting

Multivariate time series data with multiple points is a kind of spatio-temporal data, and in recent years, spatio-temporal graph neural networks (STGNNs) have become one of the most effective methods for spatio-temporal data prediction. By leveraging graph neural networks and sequence models, STGNNs simultaneously capture the hidden temporal and spatial patterns in spatio-temporal data. However, there exist two key limitations: (1) Most existing STGNNs whether based on static graphs or dynamic graphs, fail to introduce time periodicity into graph structure learning and ignore the importance of multi-relational graph structure learning. (2) Most multivariate time series prediction models with multiple points ignore the relation between multiple attributes. To this end, we propose a novel framework called the Dynamic Multi-fusion Spatio-temporal Graph Neural Network (DMF-STNet), where multi-fusion embodies two meanings: spatio-temporal fusion and multi-attribute fusion, as well as multi-graph fusion and multi-layer fusion. The dynamic periodic graph is proposed to mine time periodicity that is hidden in graph structures, and we further offer multi-relational graph structure learning methods to capture static and dynamic relations. Moreover, we introduce a dual-stage feature aggregation method to aggregate hidden features from both primary and auxiliary attributes. Extensive experiments on three real-world datasets demonstrate the efficacy of our proposed DMF-STNet, and the visualization study proves the interpretability of learned weights.

Prediction of Covid-19 Multiparametric Biomarkers and Drug Target of Patients for Risk Stratification Using Machine Learning Approach

In the situation of Coronavirus disease 2019 (COVID-19), forecasting disease progression and identifying therapeutic drug targets is critical, especially given the nonattendance of a viable approach for treating severe cases. The preparation cohort revealed promising biomarkers, which were then precisely measured and employed to assess prediction accuracy across validation cohorts. This approach holds significant potential in enhancing understanding of severe COVID-19 and aiding the development of effective treatments. However, ultrasound-guided MRI (US-MRI) is an emerging modality that can noninvasively acquire multi-parametric information on COVID-19 and function without the need for contrast agents. This shows that neural network analysis of US-MRI transports exclusive prognosis data and this significantly improved prognosis performance. Consequently, the research proposed a deep neural network model of an Ensemble Multi-Relational Graph Neural Network (EMR-GNN) to determine the optimal model for predicting vascular biomarkers (CRP, IL-6, ferritin). In the nonappearance of a tailored treatment for this emerging virus, scientists are actively investigating various strategies to curb its replication. This work focuses on identifying potential drug targets, drawing from proteins abundant in lung material and those targeted by FDA-approved drugs as catalogued in HPA. This effort reflects a broader initiative within the methodical unrestricted to develop effective means of limiting virus replication. Accordingly, recognized five lung-improved proteins, comprising MRC1, SG3A1, CCL18, histone H4, and CLEC3B, were annotated as “drug targets”. For this, the researcher proposes a Heterogeneous Graph Structural Attention Neural Network (HGS-ANN) model to learn topological information of composite molecules and a Dilated Causal CNN-LSTM model with U-Net layers for modelling spatial-sequential information in Simplified Molecular-Input Line-Entry System (SMILES) sequences of drug data. The COVID-19 datasets are downloaded from the GEO database. These data are evaluated using Matlab software. The proposed work evaluated that the AUC of the work is 0.995, however, the AUC is measured based on sex, age, and chronic diseases. This model has a 0.933 accuracy in the subgroup of slices thicker than 1mm. However, the AUC curve and the classification outcome of the proposed method are compared with the existing rad model, deeper, and KNN models. In comparison to existing methods, the proposed model demonstrates superior performance. This research not only identifies potential therapeutic targets nonetheless also serves to uncover biomarkers crucial for comprehending the pathogenesis of undecorated COVID-19.

Predicting miRNA-Disease Associations From miRNA-Gene-Disease Heterogeneous Network With Multi-Relational Graph Convolutional Network Model.

MiRNAs are reported to be linked to the pathogenesis of human complex diseases. Disease-related miRNAs may serve as novel bio-marks and drug targets. This work focuses on designing a multi-relational Graph Convolutional Network model to predict miRNA-disease associations (HGCNMDA) from a Heterogeneous network. HGCNMDA introduces a gene layer to construct a miRNA-gene-disease heterogeneous network. We refine the features of nodes into initial and inductive features so that the direct and indirect associations between diseases and miRNA can be considered simultaneously. Then HGCNMDA learns feature embeddings for miRNAs and disease through a multi-relational graph convolutional network model that can assign appropriate weights to different types of edges in the heterogeneous network. Finally, the miRNA-disease associations were decoded by the inner product between miRNA and disease feature embeddings. We apply our model to predict human miRNA-disease associations. The HGCNMDA is superior to the other state-of-the-art models in identifying missing miRNA-disease associations and also performs well on recommending related miRNAs/diseases to new diseases/ miRNAs. The codes are available at https://github.com/weiba/HGCNMDA.

Learning Region Similarities via Graph-Based Deep Metric Learning

Region similarity learning plays an essential role in applications such as business site selection, region recommendation, and urban planning. Earlier studies mainly represent regions as bags of points of interest (POIs) for region similarity comparisons, which cannot fully exploit the spatial features of the regions. Recently, researchers propose to use deep neural networks to exploit spatial features such as POI geo-coordinates and categories, which have produced more accurate and robust region similarity learning results. However, many useful features such as the height and size of a POI, and the distance and relative importance between the POIs, are still overlooked in these methods. To take advantage of such features, we propose to represent regions as graphs, where nodes are POIs with rich features such as height, size, and hexagonal coordinates, while edges are the relationships between POIs formulated by their road network distances. To capture POIs' importance, we weigh them by their height and size. Since there is limited availability of ground-truth region similarity data, we propose a contrastive learning-based multi-relational graph neural network (C-MPGCN) for region similarity learning based on the graph representations. To generate data for model training, we propose a soft graph edit distance (SGED) based algorithm to generate triples of similar and dissimilar graphs of a given graph (representing a given region) based on the POI weights. Experimental results show that C-MPGCN outperforms the state-of-the-art methods for region similarity learning consistently with an improvement of at least 8.6% and 9.4% in terms of MRR and HR@1, respectively.

Multi-task learning for predicting synergistic drug combinations based on auto-encoding multi-relational graphs

Combinatorial drug therapy is a promising approach for treating complex diseases by combining drugs with synergistic effects. However, predicting effective drug combinations is challenging due to the complexity of biological systems and the limited understanding of pathophysiological mechanisms and drug targets. In this paper, we proposed a computational framework called VGAETF (Variational Graph Autoencoder Tensor Decomposition), which leveraged multi-relational graph to model complex relationships between entities in biological systems and predicted disease-related synergistic drug combinations in an end-to-end manner. In the computational experiments, VGAETF achieved high performances (AUROC [the area under receiver operating characteristic]= 0.9767, AUPR [the area under precision-recall]= 0.9660), outperforming other compared methods. Moreover, case studies further demonstrated the effectiveness of VGAETF in identifying potential disease-related synergistic drug combinations.

Graph transformer-based self-adaptive malicious relation filtering for fraudulent comments detection in social network

In recent years, Graph Neural Networks (GNNs) have proven to be effective in detecting fraud within social networks by gathering information from neighboring nodes to predict fraudulent actions. However, the continuous evolution and camouflaging tactics of fraudsters, such as establishing malicious connections with legitimate users and mimicking their behaviors, can often elude GNN-based detection methods. To tackle this issue, we propose a multi-order moments graph transformer, named MMGT, to effectively learn node representations through an attention mechanism that captures information of different orders of moments. Building upon this foundation, we further introduce a self-adaptive malicious relation filtering model for fraud detection, denoted as SFGT. Initially, we form a multi-relational graph that encapsulates complex relations within a given social network and derive node representations by accumulating neighbor node and edge data based on an enhanced graph transformer. Subsequently, a threshold-based malicious relation filter mechanism is proposed to eliminate malicious links by assessing the distance between nodes. Furthermore, an adaptive threshold learning policy is developed to bolster the model’s performance and its ability to generalize. Finally, extensive experiments are carried out on two public datasets, Amazon and YelpChi, which underscores the effectiveness of our proposed model. The experimental results indicate that our model achieves state-of-the-art performance.

A Set of Control Points Conditioned Pedestrian Trajectory Prediction

Predicting the trajectories of pedestrians in crowded conditions is an important task for applications like autonomous navigation systems. Previous studies have tackled this problem using two strategies. They (1) infer all future steps recursively, or (2) predict the potential destinations of pedestrians at once and interpolate the intermediate steps to arrive there. However, these strategies often suffer from the accumulated errors of the recursive inference, or restrictive assumptions about social relations in the intermediate path. In this paper, we present a graph convolutional network-based trajectory prediction. Firstly, we propose a control point prediction that divides the future path into three sections and infers the intermediate destinations of pedestrians to reduce the accumulated error. To do this, we construct multi-relational weighted graphs to account for their physical and complex social relations. We then introduce a trajectory refinement step based on a spatio-temporal and multi-relational graph. By considering the social interactions between neighbors, better prediction results are achievable. In experiments, the proposed network achieves state-of-the-art performance on various real-world trajectory prediction benchmarks.