Relational Graph Research Articles

Dependency-position relation graph convolutional network with hierarchical attention mechanism for relation extraction

Dependency-position relation graph convolutional network with hierarchical attention mechanism for relation extraction

PRGNN: Modeling high-order proximity with relational graph neural network for knowledge graph completion

Relational Graph Neural Networks (RGNNs) are designed to extract structural information from relational graphs and have garnered attention in the domain of Knowledge Graph Completion (KGC). However, recent empirical investigations have indicated that some prominent RGNN-based methodologies have not significantly enhanced precision, prompting questions regarding the efficacy of RGNNs in KGC applications.In this paper, we introduce a novel RGNN-based KGC approach, the Proximity Relational Graph Neural Network (PRGNN), which excels at modeling high-order proximities among entities. PRGNN is founded on a notably straightforward yet effective RGNN framework that discards unnecessary components commonly incorporated in previous approaches, such as attention layers, and linear and non-linear mappings. We demonstrate that PRGNN empowers traditional KGC techniques to apprehend high-order proximities among entities more effectively. Through extensive experimentation on benchmark datasets, we establish that PRGNN consistently outperforms conventional KGC methods and achieves state-of-the-art results. Furthermore, we show that PRGNN necessitates considerably less training time (ranging from one-third to one-fifth) and fewer parameters (ranging from half to two-thirds), rendering it an exceptionally efficient approach. All data and code have been made available at 11https://github.com/zhudanhao/PRGNN..

Building Category Graphs Representation with Spatial and Temporal Attention for Visual Navigation

Given an object of interest, visual navigation aims to reach the object’s location based on a sequence of partial observations. To this end, an agent needs to (1) acquire specific knowledge about the relations of object categories in the world during training and (2) locate the target object based on the pre-learned object category relations and its trajectory in the current unseen environment. In this article, we propose a Category Relation Graph (CRG) to learn the knowledge of object category layout relations and a Temporal-Spatial-Region attention (TSR) architecture to perceive the long-term spatial-temporal dependencies of objects, aiding navigation. We establish CRG to learn prior knowledge of object layout and deduce the positions of specific objects. Subsequently, we propose the TSR architecture to capture relationships among objects in temporal, spatial, and regions within observation trajectories. Specifically, we implement a Temporal attention module (T) to model the temporal structure of the observation sequence, implicitly encoding historical moving or trajectory information. Then, a Spatial attention module (S) uncovers the spatial context of the current observation objects based on CRG and past observations. Last, a Region attention module (R) shifts the attention to the target-relevant region. Leveraging the visual representation extracted by our method, the agent accurately perceives the environment and easily learns a superior navigation policy. Experiments on AI2-THOR demonstrate that our CRG-TSR method significantly outperforms existing methods in both effectiveness and efficiency. The supplementary material includes the code and will be publicly available.

Onboard cooperative relative positioning system for Micro-UAV swarm based on UWB/Vision/INS fusion through distributed graph optimization

In recent years, the swarm of micro Unmanned Aerial Vehicles (micro-UAVs) is becoming a research hotspot. As the basis of swarm autonomous flight, traditional relative positioning methods typically rely on external base stations or onboard sensors of high power consumption, the vast majority of which are not feasible on resource-constrained micro-UAVs flying in a complex environment. This article proposes a lightweight relative positioning system implemented on a micro-UAV platform weighing 150 g. We have developed a distributed graph optimization (DGO) scheme fusing the results of the onboard Ultra-Wideband (UWB) module, camera, and inertial sensors. A Delay Extended Kalman Filter (DEKF) is utilized to mitigate communication delays and enhance accuracy. This scheme enables micro-UAVs to collaboratively compute the relative position graph in real-time. Through real-world experiments, our system has achieved a relative positioning accuracy of 0.167 m, exhibiting significant potential for future swarm applications.

Extremal values of degree-based entropies of bipartite graphs

We characterize the bipartite graphs that minimize the (first degree-based) entropy among all bipartite graphs of given size. For bipartite graphs given size and (upper bound on the) order, we give a lower bound for this entropy. The extremal graphs turn out to be complete bipartite graphs, or nearly complete bipartite. Here we make use of an equivalent representation of bipartite graphs by means of Young diagrams, which make it easier to compare the entropy of related graphs. We conclude that the general characterization of the extremal graphs is a difficult problem, due to its connections with number theory. However, it is easier to identify them for particular values of the order n and size m because we have narrowed down the possible extremal graphs. We indicate that some of our ideas extend to other degree-based topological indices as well.

More Than Syntaxes: Investigating Semantics to Zero-shot Cross-lingual Relation Extraction and Event Argument Role Labelling

Syntactic dependency structures are commonly utilized as language-agnostic features to solve the word order difference issues in zero-shot cross-lingual relation and event extraction tasks. However, while sentences in multiple forms can be employed to express the same meaning, the syntactic structure may vary considerably in specific scenarios. To fix this problem, we find semantics are rarely considered, which could provide a more consistent semantic analysis of sentences and be served as another bridge between different languages. Therefore, in this article, we introduce Syntax and Semantic Driven Network (SSDN) to equip syntax and semantic knowledge across languages simultaneously. Specifically, predicate–argument structures from semantic role labelling are explicitly incorporated into word representations. Then, a semantic-aware relational graph convolutional network and a transformer-based encoder are utilized to model both semantic dependency and syntactic dependency structures, respectively. Finally, a fusion module is introduced to integrate output representations adaptively. We conduct experiments on the widely used Automatic Content Extraction 2005 English, Chinese, and Arabic datasets. The evaluation results demonstrate that the proposed method achieves the state-of-the-art performance. Further study also indicates SSDN could produce robust representations that facilitate the transfer operations across languages.

DRGATAN: Directed relation graph attention aware network for asymmetric drug-drug interaction prediction

In scenarios involving the treatment of complex or coexisting diseases with multiple drugs, the potential for severe adverse drug reactions in patients necessitates the identification of potential drug-drug interactions (DDIs). Most existing computational methods have not taken into account the asymmetry and relation types of drug interactions caused by the relation information between drugs, which may lead to missing information in embedded learning. Therefore, this paper proposes a directed relation graph attention aware network (DRGATAN) to predict asymmetric drug interactions. DRGATAN leverages an encoder to learn multi-relational role embeddings of drugs across different types of relations. The experimental results show that DRGATAN's performance is superior to recognized advanced methods. The visualization demonstrates the effect of utilizing asymmetric information, and the case analysis validates the reliability of the proposed method. This study provides guidance for predicting asymmetric drug interactions.

Multi-scale relational graph convolutional network for multiple instance learning in histopathology images

Graph convolutional neural networks have shown significant potential in natural and histopathology images. However, their use has only been studied in a single magnification or multi-magnification with either homogeneous graphs or only different node types. In order to leverage the multi-magnification information and improve message passing with graph convolutional networks, we handle different embedding spaces at each magnification by introducing the Multi-Scale Relational Graph Convolutional Network (MS-RGCN) as a multiple instance learning method. We model histopathology image patches and their relation with neighboring patches and patches at other scales (i.e., magnifications) as a graph. We define separate message-passing neural networks based on node and edge types to pass the information between different magnification embedding spaces. We experiment on prostate cancer histopathology images to predict the grade groups based on the extracted features from patches. We also compare our MS-RGCN with multiple state-of-the-art methods with evaluations on several source and held-out datasets. Our method outperforms the state-of-the-art on all of the datasets and image types consisting of tissue microarrays, whole-mount slide regions, and whole-slide images. Through an ablation study, we test and show the value of the pertinent design features of the MS-RGCN.

Graph relationship-driven label coded mapping and compensation for multi-label textile fiber recognition

Recently, neural network-based methods for multi-label textile fiber recognition have achieved considerable success. However, a significant limitation of most current approaches is their disregard for the valuable dependencies that exist among different fiber categories. The universal multi-label image recognition methods that consider label relationships often fall short when applied to the challenge posed by the mixture of fibers in textile images. And these relationship modeling manners have not yet been used in the field of multi-label textile fiber recognition. In this work, a graph relationship-driven method is proposed for the recognition of multi-label textile fibers. Based on the graph attention network, the proposed method introduces global relation graph, label coded mapping, and label compensation to equip the feature learning backbone with the relationship modeling ability. First, feature learning backbone extracts the semantic features from images, and global relation graph mines shallow representations of global label relationships from label embeddings. Then, label coded mapping combines these semantic features and global features to model joint relationships. The obtained joint representations constitute the label code, which is used to map the fiber class indices. Finally, label compensation further extracts the deep representations of global label relationships and utilizes them to compensate the fiber class indices to obtain final prediction scores. By employing experiments on a textile fiber dataset and a rearranged dataset, the effectiveness and superiority of the proposed method are validated. Further experiments on PASCAL VOC 2007 showcase the potential applications of the proposed method beyond textile fiber recognition.

Power load forecasting based on spatial–temporal fusion graph convolution network

The cyclical behavior of electricity users facilitates the prediction of future electricity loads through the analysis of historical data, in addition to considering the spatial correlation among various electricity units. Building on these observations, this study transforms the power loads generated by regional-level user units into graph signals for a more effective visualization of spatial–temporal electricity consumption patterns. Specifically, the graph-based model harnesses its unique spatial–temporal dependencies to deduce the dynamics of electricity consumption patterns and enhance the precision of electricity generation predictions. Introducing a novel deep learning model, the Spatial-Temporal Fusion Graph Convolutional Network (FSTGRNN), which integrates temporal and spatial correlations for the prediction of electricity load values at future time steps. FSTGRNN is an end-to-end model that, firstly, delineates the spatial and temporal patterns of electric loads by constructing spatial relationship graphs using the FC-LSTM and GC-GRU models designed within the spatial–temporal block (ST-Block). Secondly, the spatial–temporal fusion block (STF-Block) in FSTGRNN, equipped with a gating mechanism, encodes the graph signals to capture both long-term dependencies and short-term correlations. The resulting integrated representation is utilized for the forecasting process. Experimental validation is conducted on two electricity load datasets, and the forecasting results clearly demonstrate the superiority and efficiency of the proposed deep learning system.

Modification and completion of geological structure knowledge graph based on pattern matching

As a knowledge representation method, knowledge graph is widely used in intelligent question answering systems and recommendation systems. At present, the research on knowledge graph mainly focuses on information query and retrieval based on knowledge graph. In some domain knowledge graphs, specific subgraph structures (patterns) have specific physical meanings. Aiming at this problem, this paper proposes a method and framework of knowledge graph pattern mining based on gat. Firstly, the patterns with specific physical meaning were transformed into subgraph structures containing topological structures and entity attributes. Secondly, the subgraph structure of the pattern is regarded as the query graph, and the knowledge graph is regarded as the data graph, so that the problem is transformed into an approximate subgraph matching problem. Then, the improved relational graph attention network is used to fuse the adaptive edge deletion mechanism to realize the approximate subgraph matching of subgraph structure and attribute, so as to obtain the best matching subgraph. The proposed method is trained in an end-to-end manner. The approximate subgraph matching is realized on the existing data set, and the research work of key pattern mining of complex geological structure knowledge graph is carried out.

A Survey of Multiple Kernel Graph Clustering Algorithms

In recent years, algorithms based on multi-kernel learning and graph clustering have garnered significant attention in the field of data mining. This article reviews four advanced multi-kernel graph clustering algorithms: nearest neighbor linear kernel weighted multi-kernel graph clustering, multi-kernel graph clustering based on simultaneous global and local structure preservation, multi-kernel graph clustering based on direct consensus relationship graph learning, and custom non-negative matrix factorization multi-kernel graph tensor clustering. These algorithms have their own characteristics and, by combining multi-kernel learning, graph clustering, and other advanced technologies, they improve the accuracy and efficiency of clustering. However, they also face challenges such as high computational complexity and parameter settings, necessitating further research and optimization. These algorithms have wide application prospects in fields such as image recognition, text classification, and bioinformatics, providing new solutions for handling complex data structures.

Disentangled Relational Graph Neural Network with Contrastive Learning for knowledge graph completion

Learning disentangled entity representations has garnered significant attention in the field of knowledge graph completion (KGC). However, the existing methods inherently overlook the indicative role of relations and the correlation between latent factors and relations, leading to suboptimal entity representations for KGC tasks. In the current study, we introduce the Disentangled Relational Graph Neural Network with Contrastive Learning (DRGCL) method, designed to acquire disentangled entity representations guided by relations. In particular, we first devise the factor-aware relational message aggregation approach to learn entity representations under each semantic subspace and obtain latent factor representations by attention mechanisms. Subsequently, we propose a discrimination objective for factor-subspace pairs using a contrastive learning approach, which compels the factor representations to distinctly capture the information associated with different latent factors and promote the consistency between factor representations and semantic subspaces. Through disentanglement, our model can generate relation-aware scores tailored to the provided scenario. Extensive experiments have been conducted on three benchmark datasets and the results demonstrate the superiority of our method compared with strong baseline models.

Hyperbolic multichannel graph convolutional network for social recommendation

Social recommendations enhance the quality of recommendations by integrating social network information. Existing methods predominantly rely on pairwise relationships to uncover potential user preferences. However, they usually overlook the exploration of higher-order user relations. Moreover, because social relation graphs often exhibit scale-free graph structures, directly embedding them in Euclidean space will lead to significant distortion. To this end, we propose a novel graph neural network framework with hypergraph and hyperbolic embedding learning, namely HMGCN. Specifically, we first construct hypergraphs over user-item interactions and social networks, and then perform graph convolution on the hypergraphs. At the same time, a multi-channel setting is employed in the convolutional network, with each channel encoding its corresponding hypergraph to capture different high-order user relation patterns. In addition, we feed the item embeddings and the obtained high-order user embeddings into a hyperbolic graph convolutional network to extract user and item representations, enabling the model to better capture the hierarchical structure of their complex relationships. Experimental results on three public datasets, namely FilmTrust, LastFM, and Yelp, demonstrate that the model achieves more comprehensive user and item representations, more accurate fitting and processing of graph data, and effectively addresses the issues of insufficient user relationship extraction and data embedding distortion in social recommendation models.

Investigating the effect of industry-specific economic distance on the prediction of intercity population movement

Intercity population movement has been extensively studied since it is closely related to human society. Currently, city industry structures play dominant roles in the direction of population movement. Yet, the extent to which different kinds of industry proximity influence human mobility remains unclear. In this study, we introduce the concept of intercity industry proximity, regarded as economic distances, to forecast intercity population movement using a relational graph convolutional network. Our findings demonstrate the effectiveness of this framework in learning information from 18 industry proximity networks. Using this framework, we investigate the impact of distinct industries on population movement by traversing each industry as input separately. Results show that while all industries exhibit favorable predictive performance, slight differences exist. Specifically, the primary industry emerges as the most influential predictor of population movement, followed by secondary industries, whereas certain tertiary industries exert comparatively minimal effects. We also examine the influence of proximity thresholds for graph-generating on model performance. Theoretical explanations concerning face-to-face interactions for the diffusion of tacit knowledge are discussed, and policy implications are provided to enrich the current understanding of population movement.

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.

Heterogeneous Adaptive Preference Learning for Recommendation

Graph-based collaborative filtering techniques have emerged as a promising recommendation approach by modeling user-item interaction as graphs. Recently, contrastive learning has been employed in graph collaborative through data augmentation, which can effectively offer data efficiency and reduce labeling costs. Nonetheless, most existing contrastive learning approaches overlook the heterogeneous auxiliary information pertaining to users and items, such as user social relationships and item categories, which are crucial to alleviate the data sparsity issue. In this paper, we propose a novel contrastive learning method, referred to as Heterogeneous Adaptive Preference Learning for Recommendation (HAPLRec), which explicitly incorporates fine-grained preference information from both users and items. Specifically, we construct user relationship graphs and item relationship graphs based on specific meta-paths in a heterogeneous graph. Subsequently, we conduct data augmentation on these graphs individually to obtain auxiliary contrastive tasks. Moreover, we introduce an optimization algorithm that leverages the gradient similarity between the main task and the auxiliary tasks, dynamically adjusting the weight assigned to each task to expedite achieving superior performance within a shorter time frame. The effectiveness of the proposed model is demonstrated through extensive experiments conducted on three publicly available datasets.

Development of a reduced mechanism for methane combustion in OpenFOAM: A computational approach for efficient and accurate simulations

The primary aim of this study is to develop a more efficient reaction mechanism for accurately simulating methane combustion, with a specific focus on ignition delay, laminar flame speed, and 2-D simulated flames, while also reducing computational time. Ten reduced reaction mechanisms for methane combustion were evaluated, with only one, "SK30," meeting the required accuracy standards. However, SK30 proved to be computationally intensive when simulating a 2-D premixed flame at a microscale. To address this challenge, a two-step reduction process was implemented. Firstly, an automated algorithm utilized direct relation graphs and sensitivity analysis with ignition delays as a reference to streamline the mechanism while maintaining accuracy. Subsequently, the second step involved identifying key reactions that had a more significant impact on flame speed than ignition delay through sensitivity analysis. Any missing reactions were then added judiciously, prioritizing the retrieval of the missing but important reactions to overall accuracy while minimizing computational cost. This process resulted in a novel mechanism comprising 25 species and 132 reactions for methane-air combustion. The validity of this mechanism was confirmed through comparison with a benchmark model, demonstrating satisfactory agreement in 1-D flame speed and 2-D premixed flame modeling. Most notably, the new mechanism substantially reduced processing time, achieving a 50 % speedup compared to SK30.

English Teaching Quality Evaluation Model for Higher Education Based on Educational Data Mining Technology

Constructing teaching quality evaluation systems for higher vocational education is beneficial for schools, serving as the cornerstone for developing abilities and enabling precise education management. In this publication, a Dual Relational Graph Attention Network (ETQE-DRGAN)-Based Educational Data Mining Technology English Teaching Quality Evaluation Model for Higher Education is proposed. In three ways, this study assesses and defends the system. An overview of the system's primary components, such as the user and data administration modules, data mining, online assessment, and inquiry modules, is given in the first section. Frequent item sets are divided into two stages and the development of invalid candidate sets is limited to avoid the formation of negative association rules. The Tid-list Vertical Partitioning Query-Apriori Algorithm (TPQ-Apriori algorithm) is improved by these two approaches. The system analysis is covered in section three. In order to assess the success of instruction, this work incorporates a Dual Relational Graph Attention Networks method that takes into account several factors such as age, gender, education, teaching attitude, teaching topic, teaching technique, and teaching effectiveness. The proposed ETQE-DRGAN is implemented in MATLAB, using the School Database for calculation. Numerous performance metrics like response time, precision, accuracy, sensitivity, and F1-score are utilized to calculate the effectiveness of ETQE-DRGAN technique. The obtained outcomes indicate that the ETQE-DRGAN approach achieves the highest precision of 98.5%, Accuracy of 98% and fastest response time of 6.95swhen compared to existing methods like ETQE-AA, ETQE-DTA and ETQE-ML.

Enhancing fraud detection in banking by integration of graph databases with machine learning

The banking sector's shift from traditional physical locations to digital channels has offered customers unprecedented convenience and increased the risk of fraud for customers and institutions alike. In this study, we discuss the pressing need for robust fraud detection & prevention systems in the context of evolving technological environments. We introduce a graph-based machine learning model that is specifically designed to detect fraudulent activity in various types of banking operations, such as credit card transactions, debit card transactions, and online banking transactions. This model uses advanced methods for anomalies, behaviors, and patterns to analyze past transactions and user behavior almost immediately. We provide an in-depth methodology for evaluating fraud detection systems based on parameters such as Accuracy Recall rate and False positive rate ROC curves. The findings can be used by financial institutions to develop and enhance fraud detection strategies as they demonstrate the effectiveness and reliability of the proposed approach. This study emphasizes the critical role that innovative technologies play in safeguarding the financial sector from the ever-changing strategies of fraudsters while also enhancing banking security.•This paper aims to implement the detection of fraudulent transactions using a state-of-the-art Graph Database approach.•The relational graph of features in the dataset used is modelled using Neo4J as a graph database.•Applying JSON features from the exported graph to various Machine Learning models, giving effective outcomes.