Graph Construction Research Articles

The joint extraction of fact-condition statement and super relation in scientific text with table filling method

The fact-condition statements are of great significance in scientific text, via which the natural phenomenon and its precondition are detailly recorded. In previous study, the extraction of fact-condition statement and their relation (super relation) from scientific text is designed as a pipeline that the fact-condition statement and super relation are extracted successively, which leads to the error propagation and lowers the accuracy. To solve this problem, the table filling method is firstly adopted for joint extraction of fact-condition statement and super relation, and the Biaffine Convolution Neural Network model (BCNN) is proposed to complete the task. In the BCNN, the pretrained language model and Biaffine Neural Network work as the encoder, while the Convolution Neural Network is added into the model as the decoder that enhances the local semantic information. Benefiting from the local semantic enhancement, the BCNN achieves the best F1 score with different pretrained language models in comparison with other baselines. Its F1 scores in GeothCF (geological text) reach 73.17% and 71.04% with BERT and SciBERT as pretrained language model, respectively. Moreover, the local semantic enhancement also increases its training efficiency, via which the tags’ distribution can be more easily learned by the model. Besides, the BCNN trained with GeothCF also exhibits the best performance in BioCF (biomedical text), which indicates that it can be widely applied for the information extraction in all scientific domains. Finally, the geological fact-condition knowledge graph is built with BCNN, showing a new pipeline for construction of scientific fact-condition knowledge graph.

Dual De-confounded Causal Intervention method for knowledge graph error detection

Due to the Knowledge Graph (KG) construction process, erroneous triples are virtually inevitable to be introduced into real-world KGs. Since these errors hinder the expressiveness and applicability of KGs, the development of knowledge graph error detection (KGED) methods is necessary. Despite the overall effectiveness of current KGED methods, their capacity to identify challenging errors is limited. In this work, we conduct empirical studies and find that previous works introduce structural and semantic bias, impeding the identification of erroneous triples, especially in challenging cases. To address this issue, we design a causal graph for the KGED task and propose a Dual De-confounded Causal Intervention (DuDCI) method for debiasing. Firstly, DuDCI utilizes the neighborhood and textual descriptions of triples to calculate their graph and text embeddings. Next, a Causal De-confounded Module is constructed to mitigate the impact of shortcuts caused by the bias through the front-door adjustment. Furthermore, we introduce Disentanglement Constraints to disentangle the information expressed by each embedding, thereby facilitating further bias mitigation. Experimental results on three widely used KGED datasets validate the effectiveness of DuDCI and demonstrate that DuDCI outperforms current KGED methods, with an improvement of at least 2.2%, especially in more challenging noise scenarios.

A simulation data-driven semi-supervised framework based on MK-KNN graph and ESSGAT for bearing fault diagnosis

Current supervised intelligent fault diagnosis relies on abundant labeled data. However, collecting and labeling data are typically both expensive and time-consuming. Fault diagnosis with unlabeled data remains a significant challenge. To address this issue, a simulation data-driven semi-supervised framework based on multi-kernel K-nearest neighbor (MK-KNN) and edge self-supervised graph attention network (ESSGAT) is proposed. The novel MK-KNN establishes the neighborhood relationships between simulation data and real data. The developed multi-kernel function mitigates the risks of overfitting and underfitting, thereby enhancing the robustness of the simulation-real graphs. The designed ESSGAT employs two forms of self-supervised attention to predict the presence of edges, increasing the weights of crucial neighboring nodes in the MK-KNN graph. The performance of the proposed method is evaluated using a public bearing dataset and a self-constructed dataset of high-speed train axle box bearings. The results show that the proposed method achieves better diagnostic performance compared with other state-of-the-art graph construction methods and graph convolutional networks.

Efficient Discrete Clustering With Anchor Graph.

Spectral clustering (SC) has been applied to analyze varieties of data structures over the past few decades owing to its outstanding breakthrough in graph learning. However, the time-consuming eigenvalue decomposition (EVD) and information loss during relaxation and discretization impact the efficiency and accuracy especially for large-scale data. To address above issues, this brief proposes a simple and fast method named efficient discrete clustering with anchor graph (EDCAG) to circumvent postprocessing by binary label optimization. First of all, sparse anchors are adopted to accelerate graph construction and obtain a parameter-free anchor similarity matrix. Subsequently, inspired by intraclass similarity maximization in SC, we design an intraclass similarity maximization model between anchor-sample layer to cope with anchor graph cut problem and exploit more explicit data structures. Meanwhile, a fast coordinate rising (CR) algorithm is employed to alternatively optimize discrete labels of samples and anchors in designed model. Experimental results show excellent rapidity and competitive clustering effect of EDCAG.

A heterogeneous graph transformer framework for accurate cancer driver gene prediction and downstream analysis

Accurately predicting cancer driver genes remains a formidable challenge amidst the burgeoning volume and intricacy of cancer genomic data. In this investigation, we propose HGTDG, an innovative heterogeneous graph transformer framework tailored for precisely predicting cancer driver genes and exploring downstream tasks. A heterogeneous graph construction module is central to the framework, which assembles a gene-protein heterogeneous network leveraging the Kyoto Encyclopedia of Genes and Genomes (KEGG) pathways and protein-protein interactions sourced from the STRING (search tool for recurring instances of neighboring genes) database. Moreover, our framework introduces a pioneering heterogeneous graph transformer module, harnessing multi-head attention mechanisms for nuanced node embedding. This transformative module proficiently captures distinct representations for both nodes and edges, thereby enriching the model's predictive capacity. Subsequently, the generated node embeddings are seamlessly integrated into a classification module, facilitating the discrimination between driver and non-driver genes. Our experimental findings evince the superiority of HGTDG over existing methodologies, as evidenced by the enhanced performance metrics, including the area under the receiver operating characteristic curves (AUROC) and the area under the precision-recall curves (AUPRC). Furthermore, the downstream analysis utilizing the newly identified cancer driver genes underscores the efficacy and versatility of our proposed framework.

Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects

This study introduces an arc-flow formulation and the first branch-and-price-and-cut (BPC) algorithm designed to solve the bin-packing problem with fragile objects (BPPFO). This variant of the bin-packing problem originates in the field of telecommunications, particularly in the allocation of cellular calls to frequency channels. The arc-flow formulation is inspired by previous studies and modifies the graph construction method to accommodate fragility constraints. We proved the correctness of this formulation and demonstrated its superiority in instances with small maximum fragility through extensive experiments. The proposed BPC algorithm leverages advanced cutting and packing techniques and incorporates innovative elements such as problem reduction, additional cutting planes, and a label-setting-based exact pricing algorithm. The experimental results demonstrate that the proposed BPC algorithm is highly competitive with the state-of-the-art algorithm for solving the BPPFO and can successfully solve several previously unsolved instances.

Heuristic Heterogeneous Graph Reasoning Networks for Fact Verification.

Existing studies on table-based fact verification generally capture linguistic evidence from claim-table subgraphs or logical evidence from program-table subgraphs independently. However, there is insufficient association interaction between the two types of evidence, which makes it difficult to obtain valuable consistency features between them. In this work, we propose heuristic heterogeneous graph reasoning networks (H2GRN) to capture the shared consistent evidence by strengthening associations between linguistic and logical evidence from two perspectives of graph construction and reasoning mechanism. Specifically, 1) to enhance the close connectivity of the two subgraphs, rather than simply connecting two subgraphs by the nodes with the same content (the constructed graph in this way has severe sparsity), we construct a heuristic heterogeneous graph, which relies on claim semantics as heuristic knowledge to guide the connections of the program-table subgraph, and in turn expands the connectivity of the claim-table subgraph through logical information of programs as heuristic knowledge; and 2) to establish adequate association interaction between linguistic evidence and logical evidence, we design multiview reasoning networks. In detail, we propose local-view multihop knowledge reasoning (MKR) networks to enable the current node to establish association not only with one-hop neighbors, but also with multihop neighbors, to capture context-richer evidence information. We execute MKR on heuristic claim-table and program-table subgraphs to learn context-richer linguistic evidence and logical evidence, respectively. Meanwhile, we develop global-view graph dual-attention networks (DAN) that execute on the entire heuristic heterogeneous graph, reinforcing global-level significant consistency evidence. Finally, the consistency fusion layer is devised to weaken the disagreement between the three types of evidence to assist in capturing consistent shared evidence for verifying claims. Experiments on TABFACT and FEVEROUS demonstrate the effectiveness of H2GRN.

SF-GPT: A training-free method to enhance capabilities for knowledge graph construction in LLMs

Knowledge graphs (KGs) are constructed by extracting knowledge triples from text and fusing knowledge, enhancing information retrieval efficiency. Current methods for knowledge triple extraction include ”Pretrain and Fine-tuning” and Large Language Models (LLMs). The former shifts effort from manual extraction to dataset annotation and suffers from performance degradation with different test and training set distributions. LLMs-based methods face errors and incompleteness in extraction. We introduce SF-GPT, a training-free method to address these issues. Firstly, we propose the Entity Extraction Filter (EEF) module to filter triple generation results, addressing evaluation and cleansing challenges. Secondly, we introduce a training-free Entity Alignment Module based on Entity Alias Generation (EAG), tackling semantic richness and interpretability issues in LLM-based knowledge fusion. Finally, our Self-Fusion Subgraph strategy uses multi-response self-fusion and a common entity list to filter triple results, reducing noise from LLMs’ multi-responses. In experiments, SF-GPT showed a 55.5% increase in recall and a 32.6% increase in F1 score on the BDNC dataset compared to the UniRel model trained on the NYT dataset and achieved a 5% improvement in F1 score compared to GPT-4+EEF baseline on the WebNLG dataset in the case of a fusion round of three. SF-GPT offers a promising way to extract knowledge from unstructured information.

Knowledge graph construction in hyperbolic space for automatic image annotation

Automatic image annotation (AIA) is a fundamental and challenging task in computer vision. Considering the correlations between tags can lead to more accurate image understanding, benefiting various applications, including image retrieval and visual search. While many attempts have been made to incorporate tag correlations in annotation models, the method of constructing a knowledge graph based on external knowledge sources and hyperbolic space has not been explored. In this paper, we create an attributed knowledge graph based on vocabulary, integrate external knowledge sources such as WordNet, and utilize hyperbolic word embeddings for the tag representations. These embeddings provide a sophisticated tag representation that captures hierarchical and complex correlations more effectively, enhancing the image annotation results. In addition, leveraging external knowledge sources enhances contextuality and significantly enriches existing AIA datasets. We exploit two deep learning-based models, the Relational Graph Convolutional Network (R-GCN) and the Vision Transformer (ViT), to extract the input features. We apply two R-GCN operations to obtain word descriptors and fuse them with the extracted visual features. We evaluate the proposed approach using three public benchmark datasets. Our experimental results demonstrate that the proposed architecture achieves state-of-the-art performance across most metrics on Corel5k, ESP Game, and IAPRTC-12.

Entropy Stacked Autoencoder based Diffusion Model (ESADM) and Fuzzy Clustering with Semi Supervised Fuzzy Graph Convolutional Network (FC-SSFGCN) for Rail Surface Defect Detection

Rails, fasteners, and other parts of railway track lines eventually develop flaws due to continuous strain from train operations and direct exposure to the environment; these faults directly affect the safety of train operations. Detecting defects on rail surfaces presents a formidable challenge due to the wide array of possible flaws and their unpredictable nature. However, Defect identification errors, massive variances, inadequate training sample availability, and weak contrast between faults and the surrounding background all contribute to the complexity of this procedure. In this work, rail surface and fastener flaws may be detected non-destructively using a multi-crack detection approach based on the Entropy Stacked Autoencoder Diffusion Model (ESADM). A novel approach, ESAFM, has been developed, combining a rail surface image encoder with a multi-layer, Stacked Autoencoder to extract latent materials from images showcasing different types of cracks. This integration reduces the need for significant processing resources by integrating easily into the conventional physically-based image workflow. Additionally, the Zero Shot-Semi Supervised Fuzzy Class Knowledge Graph (ZS-SSFCKG) method proposes Class Knowledge Graph Construction (CKGC), which constructs a CKG to elucidate the connection between defects and non-defects. Class features are learned by using a Fuzzy Clustering with Semi Supervised Fuzzy Graph Convolutional Network (FC-SSFGCN). The method employs a transformer encoder to capture distant relationships, allowing for the extraction of features from defect samples. This facilitates the acquisition of distinct defect image characteristics, as industrial defects vary in shape and size. The experimental results on the public Railway Track Fault Detection (RTFD)and Rail Surface Defect Datasets (RSDDs) with rail surface defects are collected from rail tracks surface defect detection.

Structural characterisation for the synthesis of large‐scale combined electric–gas networks

AbstractIn this paper, the authors present a methodology for building realistic synthetic test cases to model combined electric and natural gas infrastructure networks. Because these networks are synthetic, that is, fictitious, they are able to be freely shared; hence, they serve to support research and development in the area of coupled‐infrastructure analysis with large‐scale realistic test cases that do not contain non‐public information. We anchor our process for building these synthetic networks in a structural characterisation of actual electric and natural gas networks. Supply and demand nodes are geographically placed, based on a combination of publicly available information from several sources and a clustering‐based method to match the right fraction of each node type, taking into account the intersection points between the electric and gas grids. Then the networks are connected with pipelines and transmission lines using a systematic graph construction method, validated against network properties including degree distribution, clustering, graph diameter, and degree of planarity, along with operational validation to ensure the simulated solution is realistic. The methodology is demonstrated by creating and validating a test case with 6717 electric buses and 2451 gas nodes.

HiMul-LGG: A hierarchical decision fusion-based local–global graph neural network for multimodal emotion recognition in conversation

Emotion recognition in conversation (ERC) is a vital task that requires deciphering human emotions through analysis of contextual and multimodal information. However, extant research on ERC concentrates predominantly on investigating multimodal fusion while overlooking the model’s constraints in dealing with unimodal representation discrepancy and speaker dependencies. To address the aforementioned problems, this paper proposes a Hierarchical decision fusion-based Local–Global Graph Neural Network for multimodal ERC (HiMul-LGG). HiMul-LGG employs a hierarchical decision fusion strategy to ensure feature alignment across modalities. Moreover, HiMul-LGG also adopts a local–global graph neural network architecture to reinforce inter-modality and intra-modality speaker dependency. Additionally, HiMul-LGG utilizes a cross-modal multi-head attention mechanism to promote interplay between modalities. We evaluate HiMul-LGG on two emotion recognition datasets, IEMOCAP and MELD, where HiMul-LGG outperforms existing methods. The results of the ablation study also imply the effectiveness of the proposed hierarchical decision fusion strategy and local–global structure of Graph construction.

Dual channel visible graph convolutional neural network for microleakage monitoring of pipeline weld homalographic cracks

When using a single sensor to monitor early microleakage of nuclear power pressure pipeline leakage, there are problems such as low monitoring accuracy and poor early warning reliability due to the limitations of the monitoring range and weak difference between the leakage signals. To address these challenges, this paper proposes a dual channel visible graph convolutional neural network (DCV-GCN). Firstly, the acoustic emission time-series data of each channel are truncated and divided, and the significant frequency bands are selected based on the envelope spectrum. On this basis, the sequence group is averaged to obtain the graph structure sequence. Then, the limited penetrable visibility (LPV) graph construction algorithm is used to calculate the adjacency matrix, and the important nodes is reserved according to the eigenvector centrality. Furthermore, the inverse ratio of the distance from the sensor in each single channel to the center of the crack is used as the fusion weight, and the adjacency matrices are merged after normalization to transform the construction of the graph structure dataset. Finally, the dataset is input into the graph convolutional neural network, and the effectiveness of the method is verified by carefully designing three homalographic cracks. The results show that the proposed method can effectively extract the distinguishing features with similar frequency components and similar leakage rates, and the recognition accuracy of different leakage states can reach 98.56 %. In addition, through ablation experiments and different parameter strategy settings, the operating mechanism is explained, which can provide a reference for monitoring and analysis by industrial technicians.

MLFGCN: short-term residential load forecasting via graph attention temporal convolution network.

Residential load forecasting is a challenging task due to the random fluctuations caused by complex correlations and individual differences. The existing short-term load forecasting models usually introduce external influencing factors such as climate and date. However, these additional information not only bring computational burden to the model, but also have uncertainty. To address these issues, we propose a novel multi-level feature fusion model based on graph attention temporal convolutional network (MLFGCN) for short-term residential load forecasting. The proposed MLFGCN model fully considers the potential long-term dependencies in a single load series and the correlations between multiple load series, and does not require any additional information to be added. Temporal convolutional network (TCN) with gating mechanism is introduced to learn potential long-term dependencies in the original load series. In addition, we design two graph attentive convolutional modules to capture potential multi-level dependencies in load data. Finally, the outputs of each module are fused through an information fusion layer to obtain the highly accurate forecasting results. We conduct validation experiments on two real-world datasets. The results show that the proposed MLFGCN model achieves 0.25, 7.58% and 0.50 for MAE, MAPE and RMSE, respectively. These values are significantly better than those of baseline models. The MLFGCN algorithm proposed in this paper can significantly improve the accuracy of short-term residential load forecasting. This is achieved through high-quality feature reconstruction, comprehensive information graph construction and spatiotemporal features capture.

A Scene Graph Similarity-Based Remote Sensing Image Retrieval Algorithm

With the rapid development of remote sensing image data, the efficient retrieval of target images of interest has become an important issue in various applications including computer vision and remote sensing. This research addressed the low-accuracy problem in traditional content-based image retrieval algorithms, which largely rely on comparing entire image features without capturing sufficient semantic information. We proposed a scene graph similarity-based remote sensing image retrieval algorithm. Firstly, a one-shot object detection algorithm was designed for remote sensing images based on Siamese networks and tailored to the objects of an unknown class in the query image. Secondly, a scene graph construction algorithm was developed, based on the objects and their attributes and spatial relationships. Several construction strategies were designed based on different relationships, including full connections, random connections, nearest connections, star connections, or ring connections. Thirdly, by making full use of edge features for scene graph feature extraction, a graph feature extraction network was established based on edge features. Fourthly, a neural tensor network-based similarity calculation algorithm was designed for graph feature vectors to obtain image retrieval results. Fifthly, a dataset named remote sensing images with scene graphs (RSSG) was built for testing, which contained 929 remote sensing images with their corresponding scene graphs generated by the developed construction strategies. Finally, through performance comparison experiments with remote sensing image retrieval algorithms AMFMN, MiLaN, and AHCL, in precision rates, Precision@1 improved by 10%, 7.2%, and 5.2%, Precision@5 improved by 3%, 5%, and 1.7%; and Precision@10 improved by 1.7%, 3%, and 0.6%. In recall rates, Recall@1 improved by 2.5%, 4.3%, and 1.3%; Recall@5 improved by 3.7%, 6.2%, and 2.1%; and Recall@10 improved by 4.4%, 7.7% and 1.6%.

Multi-view clustering with adaptive anchor and bipartite graph learning

Multi-view subspace clustering optimizes and integrates the graph structure information of each view. At present, the subspace clustering methods based on the abstract graph have better performance and improve the clustering results. Although the existing clustering algorithms have achieved excellent results, there are still four deficiencies: 1) Expensive time overhead, with most algorithms having a high time complexity; 2) Using fixed anchor points and the separation of anchor graph learning from subsequent graph construction, resulting in inadequate use of underlying graph structure between views; 3) Multi-view data have inevitable noise and in the original high-dimensional space data fusion may cause the loss of important information; 4) Most algorithms require additional post-processing to obtain clustering labels. To solve the above problems, we innovate a novel anchor-adaptive multi-view clustering algorithm based on a bipartite graph . Specifically, anchor graph learning and subspace graph construction are adaptively combined into a unified optimization framework. The projection matrix, consensus anchor matrix, and similarity matrix optimize each other to promote the clustering effect and structure a constrained bipartite graph to describe the relationship between representative points and sample points. At the same time, connectivity constraints are used to ensure that the connected components represent clusters directly. Our method has linear time complexity about sample size. Comparison experiments with the state-of-the-art algorithms demonstrate the effectiveness of the proposed method on various benchmark datasets. Moreover, our method is robust to noisy data and suitable for large-scale datasets.

A link prediction method for Chinese financial event knowledge graph based on graph attention networks and convolutional neural networks

Finance is a knowledge-intensive domain in nature, with its data containing a significant amount of interconnected information. Constructing a financial knowledge graph is an important application for transforming financial text/web content into machine-readable data. However, the complexity of Chinese financial knowledge and the dynamic and evolving nature of Chinese financial data often lead to incomplete knowledge graphs. To address this challenge, we propose a novel link prediction method for Chinese financial event knowledge graph based on Graph Attention Networks and Convolutional Neural Networks. Our method begins with the construction of the foundational Chinese financial event knowledge graph using a relational triple extraction module integrated with a large language model framework, along with a Prompting with Iterative Verification (PiVe) module for validation. To enhance the completeness of the knowledge graph, we introduce an encoder-decoder framework, where a graph attention network with joint embeddings of financial event entities and relations acts as the encoder, while a Convolutional Knowledge Base embedding model (ConvKB) serves as the decoder. This framework effectively aggregates crucial neighbor information and captures global relationships among entity and relation embeddings. Extensive comparative experiments demonstrate the utility and accuracy of this method, ultimately enabling the effective completion of Chinese financial event knowledge graphs.

Auto-weighted Graph Reconstruction for efficient ensemble clustering

Ensemble clustering (EC) is an important field in data clustering, which aims to combine multiple base clustering results of a given dataset into a single consensus result. Previous studies have shown that one of the effective methods is to convert the base clustering results into a graph partitioning problem. Existing spectral ensemble clustering methods typically obtain a spectral embedding matrix for the graph and then perform k-means, separating the graph construction and clustering tasks into two distinct stages. To address these challenges, we propose a novel and efficient ensemble clustering method named Auto-weighted Graph Reconstruction for efficient ensemble clustering. This method integrates weighted base clusters, consensus distance graph construction, and clustering into a unified framework. A consensus distance graph is constructed, from which a stable and discrete label matrix is derived using spectral clustering. An effective optimization algorithm is then employed to address the resulting problem. Finally, the experimental results on eight real-world datasets verify the effectiveness and superiority of the proposed method.

Knowledge Graph Construction Method for Commercial Aircraft Fault Diagnosis Based on Logic Diagram Model

Knowledge Graph Construction Method for Commercial Aircraft Fault Diagnosis Based on Logic Diagram Model

MAKG: A maritime accident knowledge graph for intelligent accident analysis and management

With the increasing frequency of human activities at sea, maritime accidents are occurring more often. Analyzing and mining maritime accident cases can help uncover the causal mechanisms behind these incidents, thereby enhancing maritime safety. As an emerging technology for knowledge management and mining, knowledge graphs offer significant support for the storage, reasoning, and decision-making processes related to maritime accidents.In this study, we established a knowledge graph construction and application framework for maritime accidents to facilitates the extraction and management of maritime knowledge from unstructured texts. First, 581 accident reports released by the China Maritime Safety Administration over the past decade (2014–2023) were used as the data basis for analysis and construction of the maritime accident ontology structure using the seven-step method, which comprises 8 entity types, 8 relationship types, and 18 attribute entity types. Second, We proposed MBERT-BiLSTM-CRF-SF, a named entity recognition model based on domain pretraining and self-training, to reduce graph construction costs. This model achieved state-of-the-art performance in the maritime domain, with an F1 score of 0.910 ± 0.006, which is about 5% higher than the mainstream model. In addition, we proposed an entity alignment method based on font and semantics to refine knowledge further. On the basis of the proposed method, we constructed a large, high-quality maritime accident knowledge graph (MAKG) system that contains 16,099 entities and 20,809 relationship instances. Finally, we reduced the complexity of applying knowledge graphs by integrating the CRISPE prompt learning framework of the large language model, and experiments on graph traversal, pattern recognition, and aggregation analysis were conducted to assess the quality of MAKG. Results demonstrate that MAKG can effectively enhance the efficiency of querying and reasoning about maritime accident information, thus providing significant support for the prevention and management of maritime accidents.