Graph Data Research Articles

GRASNet: A novel graph neural network for improving human action recognition and well-being assessment in smart manufacturing

In the manufacturing environment, prioritizing the well-being of workers is both essential and challenging. Recognizing and monitoring workers’ actions in real time is crucial in ensuring safety and health. This study introduces innovative approaches leveraging smart manufacturing technologies and Graph Neural Networks (GNNs) to enhance human action recognition using accessible skeletal data. Traditional Neural Networks encounter limitations in processing readily accessible human-related data, such as image and skeletal data, prompting the development of the Graph Residual Attention SAGE Network (GRASNet). GRASNet exhibits superior capabilities in capturing intricate local connectivity within graph data, ensuring a delicate balance of complexity and efficiency. Furthermore, experimental validations on two manufacturing-related datasets, derived from the NTU RGB + D 120 benchmark dataset, underscore GRASNet’s ability for high-accuracy monitoring of human abnormal behaviors and health issues, positioning it ahead of other existing deep learning models.

Knowledge Representation Learning Method Based on Semantic Enhancement of External Information

Background: Knowledge representation learning aims at mapping entity and relational data in knowledge graphs to a low-dimensional space in the form of vectors. The existing work has mainly focused on structured information representation of triples or introducing only one additional kind of information, which has large limitations and reduces the representation efficiency. Objective: This study aims to combine entity description information and textual relationship description information with triadic structure information, and then use the linear mapping method to linearly transform the structure vector and text vector to obtain the joint representation vector. Methods: A knowledge representation learning (DRKRL) model that fuses external information for semantic enhancement is proposed, which combines entity descriptions and textual relations with a triadic structure. For entity descriptions, a vector representation is performed using a bi-directional long- and short-term memory network (Bi-LSTM) model and an attention mechanism. For the textual relations, a convolutional neural network is used to vectorially encode the relations between entities, and then an attention mechanism is used to obtain valuable information as complementary information to the triad. Results: Link prediction and triadic group classification experiments were conducted on the FB15K, FB15K-237, WN18, WN18RR, and NELL-995 datasets. Theoretical analysis and experimental results show that the DRKRL model proposed in this paper has higher accuracy and efficiency compared with existing models. Conclusion: Combining entity description information and textual relationship description information with triadic structure information can make the model have better performance and effectively improve the knowledge representation learning ability.

A Statistical Analysis of Knowledge Graph and its Applications

In today's fast-paced world driven by big data and artificial intelligence, organizing and representing vast amounts of knowledge is crucial. Knowledge graphs are dynamic structures serve as repositories for real-world knowledge, presented in the form of interconnected graph data. With their ability to encapsulate complex information, knowledge graphs have swiftly captured the attention of both academia and industry alike. In this paper, we dive deep into understanding knowledge graphs. In first Section, we start by looking at their origins and evolution. In second section describes knowledge graphs, compares them with other graph forms, and explores how academic societies have incorporated them. In conclusion, we discuss the various applications of knowledge graphs in various domains and highlight the software tools that are facilitating their advancement. By providing a systematic overview of knowledge graphs, we aim to illuminate new avenues for research and foster advancements in this burgeoning field.

GraNDe: Efficient Near-Data Processing Architecture for Graph Neural Networks

Graph Neural Network (GNN) models have attracted attention, given their high accuracy in interpreting graph data. One of the primary building blocks of a GNN model is aggregation, which gathers and averages the feature vectors corresponding to the nodes adjacent to each node. Aggregation works by multiplying the adjacency and feature matrices. The size of both matrices exceeds the on-chip cache capacity for many realistic datasets, and the adjacency matrix is highly sparse. These characteristics lead to little data reuse, causing intensive main-memory accesses during the aggregation process. Thus, aggregation exhibits memory-intensive characteristics and dominates most of the total execution time. In this paper, we propose GraNDe, an NDP architecture that accelerates memory-intensive aggregation operations by locating NDP modules near DRAM datapath to exploit rank-level parallelism. GraNDe maximizes bandwidth utilization by separating the memory channel path with the buffer chip in between so that pre-/post-processing in the host processor and reduction in NDP modules operate simultaneously. By exploring the preferred data mappings of the operand matrices to DRAM ranks, we architect GraNDe to support adaptive matrix mapping that applies the optimal mapping for each layer depending on the dimension of the layer and the configuration of a memory system. We also propose adj-bundle broadcasting and re-tiling optimizations to reduce the transfer time for adjacency matrix data and to improve feature vector data reusability by exploiting tiling with consideration of adjacency between nodes. GraNDe achieves 3.01× and 1.69× on average, and up to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$4.00\times$</tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$1.98\times$</tex-math></inline-formula> speedups of GCN aggregation over the baseline system and the state-of-the-art NDP architecture for GCN, respectively.

Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks.

Graph neural networks (GNNs) tend to suffer from high computation costs due to the exponentially increasing scale of graph data and a large number of model parameters, which restricts their utility in practical applications. To this end, some recent works focus on sparsifying GNNs (including graph structures and model parameters) with the lottery ticket hypothesis (LTH) to reduce inference costs while maintaining performance levels. However, the LTH-based methods suffer from two major drawbacks: 1) they require exhaustive and iterative training of dense models, resulting in an extremely large training computation cost, and 2) they only trim graph structures and model parameters but ignore the node feature dimension, where vast redundancy exists. To overcome the above limitations, we propose a comprehensive graph gradual pruning framework termed CGP. This is achieved by designing a during-training graph pruning paradigm to dynamically prune GNNs within one training process. Unlike LTH-based methods, the proposed CGP approach requires no retraining, which significantly reduces the computation costs. Furthermore, we design a cosparsifying strategy to comprehensively trim all the three core elements of GNNs: graph structures, node features, and model parameters. Next, to refine the pruning operation, we introduce a regrowth process into our CGP framework, to reestablish the pruned but important connections. The proposed CGP is evaluated over a node classification task across six GNN architectures, including shallow models [graph convolutional network (GCN) and graph attention network (GAT)], shallow-but-deep-propagation models [simple graph convolution (SGC) and approximate personalized propagation of neural predictions (APPNP)], and deep models [GCN via initial residual and identity mapping (GCNII) and residual GCN (ResGCN)], on a total of 14 real-world graph datasets, including large-scale graph datasets from the challenging Open Graph Benchmark (OGB). Experiments reveal that the proposed strategy greatly improves both training and inference efficiency while matching or even exceeding the accuracy of the existing methods.

Routing User-Interest Markov Tree for Scalable Personalized Knowledge-Aware Recommendation.

To facilitate more accurate and explainable recommendation, it is crucial to incorporate side information into user-item interactions. Recently, knowledge graph (KG) has attracted much attention in a variety of domains due to its fruitful facts and abundant relations. However, the expanding scale of real-world data graphs poses severe challenges. In general, most existing KG-based algorithms adopt exhaustively hop-by-hop enumeration strategy to search all the possible relational paths, this manner involves extremely high-cost computations and is not scalable with the increase of hop numbers. To overcome these difficulties, in this article, we propose an end-to-end framework Knowledge-tree-routed UseR-Interest Trajectories Network (KURIT-Net). KURIT-Net employs the user-interest Markov trees (UIMTs) to reconfigure a recommendation-based KG, striking a good balance for routing knowledge between short-distance and long-distance relations between entities. Each tree starts from the preferred items for a user and routes the association reasoning paths along the entities in the KG to provide a human-readable explanation for model prediction. KURIT-Net receives entity and relation trajectory embedding (RTE) and fully reflects potential interests of each user by summarizing all reasoning paths in a KG. Besides, we conduct extensive experiments on six public datasets, our KURIT-Net significantly outperforms state-of-the-art approaches and shows its interpretability in recommendation.

Efficient Task Scheduling for Large-scale Graph Data Processing in Cloud Computing: A Particle Swarm Optimization Approach

To fulfil the requirements of task scheduling for processing massive amounts of graph data in cloud computing environments, this thesis offers the LGPPSO method, which is based on Particle Swarm Optimisation. The LGPPSO algorithm considers the task’s overall structure when initialising numerous particles in order to broaden the search range and raise the likelihood of finding an approximation optimal solution. We evaluated it in large-scale simulation trials with 100 performance-heterogeneous virtual machines (VMs) using both randomly generated and real application graphs, and evaluated its effectiveness against the CCSH and HEFT algorithms. The experimental findings demonstrate that, in both randomly generated graphs and real graph structure applications, significantly reducing the scheduling duration of large-scale graph data is the LGPPSO algorithm. For randomly generated 200 and 400 node tasks, respectively, the scheduling length is shortened by approximately 8.3% and 9.7% on average when compared to the HEFT algorithm. The LGPPSO technique minimises the scheduling length for actual graphical structure applications by an average of 14.6% and 16.9% for the Gaussian 100 and 200 node examples, respectively.

Peningkatan Produktivitas Karyawan PT. NBI melalui Pelatihan Microsoft Excel sebagai Strategi dalam Pengelolaan Data Perusahaan

PT Nusantara Building Industries (NBI) is one of the national private companies located in Central Java Province which is engaged in the building materials industry in the form of symmetrical corrugated cement chrysotile fiber sheets. PT NBI tries to meet the needs of consumers according to demand and make various innovations in producing its products. Therefore, it is necessary to carry out a training to improve the soft skills of PT NBI employees in the form of Microsoft Excel training. Microsoft Excel is a software application used to carry out various activities, including data analysis, graph making, complex calculations, and various other tasks. Based on the purpose of implementing community service activities, namely increasing employee productivity. So that the implementation of this training is in accordance with the objectives, namely being able to assist PT NBI employees in finding effective ways to manage and analyze company data. In addition, it can increase understanding in the use of Microsoft Excel. The focus of Microsoft Excel training on the AND/OR function is used to perform logical evaluation of several conditions or criteria. This training is designed to introduce the use of AND/OR functions in the company. This method aims to increase the effectiveness and efficiency of work when encountering cases in several conditions or criteria. The evaluation results of the training implementation showed a good level of acceptance from PT NBI employees towards understanding and using the AND/OR formula. Keywords — Enterprise, Microsoft Excel, AND/OR Function, Data Analysis.

Finding meaningful paths in heterogeneous graphs with PathWays

Graphs, and notably RDF graphs, are a prominent way of sharing data. As data usage democratizes, users need help figuring out the useful content of a graph dataset. In particular, journalists with whom we collaborate are interested in identifying, in a graph, the connections between entities, e.g., people, organizations, emails, etc. We present a novel method for exploring data graphs through their data paths connecting Named Entities (NEs, in short); each data path leads to a tabular-looking set of results. NEs are extracted from the data through dedicated Information Extraction modules. Our method builds upon the pre-existing ConnectionLens platform and follow-up work in the Abstra project, which builds simple, visual ER-style summaries of semi-structured data. The contribution of the present work, and its novelty, is twofold. First, we propose a novel analysis of entity-to-entity paths contained in datasets of any nature, and propose a new method for ranking paths, leveraging a novel Information Extraction (IE) module we built on top of ChatGPT. Second, we present an efficient approach to enumerate and compute NE paths, based on an algorithm which automatically recommends sub-paths to materialize, and rewrites the path queries using these subpaths. Our experiments demonstrate the interest of NE paths and the efficiency of our method for computing and ranking them.

A Power Grid Topological Error Identification Method Based on Knowledge Graphs and Graph Convolutional Networks

Precise and comprehensive model development is essential for predicting power network balance and maintaining power system analysis and optimization. The development of big data technologies and measurement systems has introduced new challenges in power grid modeling, simulation, and fault prediction. In-depth analysis of grid data has become vital for maintaining steady and safe operations. Traditional knowledge graphs can structure data in graph form, but identifying topological errors remains a challenge. Meanwhile, Graph Convolutional Networks (GCNs) can be trained on graph data to detect connections between entities, facilitating the identification of potential topological errors. Therefore, this paper proposes a method for power grid topological error identification that combines knowledge graphs with GCNs. The proposed method first constructs a knowledge graph to organize grid data and introduces a new GCN model for deep training, significantly improving the accuracy and robustness of topological error identification compared to traditional GCNs. This method is tested on the IEEE 30-bus system, the IEEE 118-bus system, and a provincial power grid system. The results demonstrate the method’s effectiveness in identifying topological errors, even in scenarios involving branch disconnections and data loss.

Advancing Lung Ultrasound: The Development and Application of the Anatomical M-Mode Evaluation for Lung Swings (AMLES) Technique in Respiratory Assessment.

Exploring the frontiers of lung ultrasound, this document details a groundbreaking technique for lung function evaluation using anatomical M-mode, also known as angle-independent M-mode. The method, termed AMLES (Anatomical M-Mode Evaluation for Lung Swings), quantifies the displacement of the lung curtain observed at the bilateral costophrenic recesses. This approach translates lung curtain movements into graphical data, offering insights into respiratory mechanics and enhancing the assessment of lung ventilation in emergency settings.

Graph-Based Semi-Supervised Learning with Bipartite Graph for Large-Scale Data and Prediction of Unseen Data

Recently, considerable attention has been directed toward graph-based semi-supervised learning (GSSL) as an effective approach for data labeling. Despite the progress achieved by current methodologies, several limitations persist. Firstly, many studies treat all samples equally in terms of weight and influence, disregarding the potential increased importance of samples near decision boundaries. Secondly, the detection of outlier-labeled data is crucial, as it can significantly impact model performance. Thirdly, existing models often struggle with predicting labels for unseen test data, restricting their utility in practical applications. Lastly, most graph-based algorithms rely on affinity matrices that capture pairwise similarities across all data points, thus limiting their scalability to large-scale databases. In this paper, we propose a novel GSSL algorithm tailored for large-scale databases, leveraging anchor points to mitigate the challenges posed by large affinity matrices. Additionally, our method enhances the influence of nodes near decision boundaries by assigning different weights based on their importance and using a mapping function from feature space to label space. Leveraging this mapping function enables direct label prediction for test samples without requiring iterative learning processes. Experimental evaluations on two extensive datasets (Norb and Covtype) demonstrate that our approach is scalable and outperforms existing GSSL methods in terms of performance metrics.

SGIR-Tree: Integrating R-Tree Spatial Indexing as Subgraphs in Graph Database Management Systems

Efficient spatial query processing in Graph Database Management Systems (GDBMSs) has become increasingly important owing to the prevalence of spatial graph data. However, current GDBMSs lack effective spatial indexing, causing performance issues with complex spatial graph queries. This study proposes a spatial index called Subgraph Integrated R-Tree (SGIR-Tree) for efficient spatial query processing in GDBMSs. The SGIR-Tree integrates the hierarchical R-Tree structure with the graph structure of GDBMSs by converting R-Tree elements into graph components like nodes and edges. The Minimum Bounding Rectangle (MBR) information of spatial objects and R-Tree nodes is stored as properties of these graph elements, and the leaf nodes are directly connected to the spatial nodes. This approach combines the efficiency of spatial indexing with the flexibility of graph databases, thereby allowing spatial query results to be directly utilized in graph traversal. Experiments using OpenStreetMap datasets demonstrate that the SGIR-Tree outperforms the previous approaches in terms of query overhead and index overhead. The results are expected to improve spatial graph data processing in various fields, including location-based service and urban planning, significantly advancing spatial data management in GDBMSs.

Domination based graph neural networks

Graph Neural Networks (GNNs) have emerged as a widely used and effective method across various domains for learning from graph data. Despite the abundance of GNN variants, many struggle with effectively propagating messages over long distances. This paper introduces a novel hierarchical message passing framework for graph learning, specifically designed to address the challenge of long-distance message propagation in graphs. By constructing smaller graphs from the main graph using the concept of domination, a fundamental principle in graph theory, we facilitate more efficient message passing within each subgraph. Subsequently, we employ a Graph Attention Network (GAT) to aggregate these features and propagate them to distant nodes across the graph. Experimental results on standard node classification datasets validate that the proposed architecture achieves performance comparable to or better than conventional GNNs. Additionally, our model consistently performs better on graphs with missing edges.

SPMGAE: Self-purified masked graph autoencoders release robust expression power

To tackle the scarcity of labeled graph data, graph self-supervised learning (SSL) has branched into two paradigms: Generative methods and Contrastive methods. Inspired by MAE and BERT in computer vision (CV) and natural language processing (NLP), masked graph autoencoders (MGAEs) are gaining popularity in the generative genre. However, prevailing MGAEs are mostly designed under the assumption that the data has high homophilic score and is out of adversarial distortion. When people deliberately improve the performance on homophilic graph datasets, they ignore a critical issue that both internal heterophily and artificial attack noise are quite common in the real world. Therefore, when data itself is highly heterophilic or confronted with attacks, they merely have no defensive capability. Especially under self-supervised conditions, it is much more difficult to detect internal heterophily and resist artificial attacks. In this paper, we propose a Self-Purified Masked Graph Autoencoder (SPMGAE) to make up for the shortcomings of prevailing MGAEs in terms of robustness. SPMGAE first utilizes a self-purified module to prune raw graph data and separate perturbation information. The purified graph provides a robust graph structure for the entire pre-training process. Next, the encoding module reuses perturbation information for auxiliary training to enhance robustness, while the decoding module reconstructs the effective graph data at a finer granularity. Extensive experiments on homophilic and heterophilic datasets attacked by various attack methods demonstrate SPMGAE has a considerable robust expressive ability. Especially on small datasets with large perturbations, the improvement of defensive performance could reaches 10%–25%.

A review of feature selection strategies utilizing graph data structures and Knowledge Graphs.

Feature selection in Knowledge Graphs (KGs) is increasingly utilized in diverse domains, including biomedical research, Natural Language Processing (NLP), and personalized recommendation systems. This paper delves into the methodologies for feature selection (FS) within KGs, emphasizing their roles in enhancing machine learning (ML) model efficacy, hypothesis generation, and interpretability. Through this comprehensive review, we aim to catalyze further innovation in FS for KGs, paving the way for more insightful, efficient, and interpretable analytical models across various domains. Our exploration reveals the critical importance of scalability, accuracy, and interpretability in FS techniques, advocating for the integration of domain knowledge to refine the selection process. We highlight the burgeoning potential of multi-objective optimization and interdisciplinary collaboration in advancing KG FS, underscoring the transformative impact of such methodologies on precision medicine, among other fields. The paper concludes by charting future directions, including the development of scalable, dynamic FS algorithms and the integration of explainable AI principles to foster transparency and trust in KG-driven models.

On the Inference of Original Graph Information from Graph Embeddings

Graph embedding converts a graph data into a low dimensional space to preserve the original graph information. However, graph data can be reconstructed by malicious adversaries to train machine learning models from graph embeddings. This paper studies to what extent an adversary (without the original graph data) can recover the original graph data from graph embeddings. To quantify the original graph information leakage from graph embeddings, we develop a deep neural network model InferNet that can be used by adversaries to infer the original graph information from an adversary-accessible graph embedding database. More specifically, we propose the data-free reversed knowledge distillation technique to support the InferNet training even if the original graph dataset is absent. To ensure the performance of InferNet, we design two cycle-consistency loss functions to have an interactive training of InferNet over three series of datasets. To further enhance the performance of InferNet, we provide a joint training algorithm that simultaneously trains the pseudo-sample generator and InferNet, which significantly reduces the storage space. We evaluate the performance of InferNet on three datasets, and the intensive experiments demonstrate that InferNet can infer the original graph information from the graph embedding dataset with high accuracy.

Asymmetric augmented paradigm-based graph neural architecture search

In most scenarios of graph-based tasks, graph neural networks (GNNs) are trained end-to-end with labeled samples. Labeling graph samples, a time-consuming and expert-dependent process, leads to huge costs. Graph data augmentations can provide a promising method to expand labeled samples cheaply. However, graph data augmentations will damage the capacity of GNNs to distinguish non-isomorphic graphs during the supervised graph representation learning process. How to utilize graph data augmentations to expand labeled samples while preserving the capacity of GNNs to distinguish non-isomorphic graphs is a challenging research problem. To address the above problem, we abstract a novel asymmetric augmented paradigm in this paper and theoretically prove that it offers a principled approach. The asymmetric augmented paradigm can preserve the capacity of GNNs to distinguish non-isomorphic graphs while utilizing augmented labeled samples to improve the generalization capacity of GNNs. To be specific, the asymmetric augmented paradigm will utilize similar yet distinct asymmetric weights to classify the real sample and augmented sample, respectively. To systemically explore the benefits of asymmetric augmented paradigm under different GNN architectures, rather than studying individual asymmetric augmented GNN (A2GNN) instance, we then develop an auto-search engine called Asymmetric Augmented Graph Neural Architecture Search (A2GNAS) to save human efforts. We empirically validate our asymmetric augmented paradigm on multiple graph classification benchmarks, and demonstrate that representative A2GNN instances automatically discovered by our A2GNAS method achieve state-of-the-art performance compared with competitive baselines. Our codes are available at: https://github.com/csubigdata-Organization/A2GNAS.

Thermoelastic damping in asymmetric vibrations of nonlocal circular plate resonators with Moore-Gibson-Thompson heat conduction

Precise estimation of the amount of thermoelastic damping (TED) in small-sized resonators is one of the crucial issues in their optimal design. According to several experimental, numerical and theoretical findings, the behavior of structures with such small dimensions in structural and thermal domains does not follow classical elasticity theory and the Fourier law of heat conduction. The objective of this work is to develop a nonclassical formulation for computing TED in asymmetric vibrations of circular nanoplates according to nonlocal theory (NT) and Moore-Gibson-Thompson (MGT) heat transfer model. To do so, first, the coupled equations of motion and heat are derived in the purview of NT and MGT model. Then, the real and imaginary parts of the system frequency are extracted from the frequency equation affected by thermoelastic coupling. Finally, by means of the existing definition for TED, a mathematical expression including nonlocal parameter of NT and nonclassical constants of MGT model is obtained to make an estimate of TED value. In the numerical examples section, to ensure the credibility of the provided formulation, the results obtained through this model are compared with those reported in the literature in the context of simpler models. Then, by presenting various graphical data, the type and extent of the role of different factors in TED changes are appraised. The obtained results indicate that employing NT and MGT model can substantially impact the amount of TED compared to the estimations of the classical formulation. Furthermore, the comparison of results reveals that the magnitude of TED in asymmetric vibration modes surpasses that in symmetric ones, and consequently incorporating asymmetric vibration modes is crucial for thorough analysis of TED in circular nanoplates. Thus, the formulation presented in this article can aid in achieving an optimal design for such plates, particularly in terms of minimizing energy loss.

Portable Network Resolving Huge-Graph Isomorphism Problem

Abstract The graph isomorphism, as a key task in graph data analysis, is of great significance for the understanding, feature extraction, and pattern recognition of graph data. The best performance of traditional methods is the quasi-polynomial time complexity, which is infeasible for huge graphs. This paper aims to propose a lightweight graph network to resolve the problem of isomorphism in huge graphs. We propose a partitioning algorithm with linear time complexity based on isomorphic necessary condition to handle network graphs that cannot be fully computed by a single computer. We use anti-weight convolution analysis and skip connections to obtain a more stable representation with fewer layers and parameters. We implement simulations on personal computer (PC) with graphs consisting of hundred millions of edges, demonstrating the identification performance ($&gt;98\%$) and time efficiency.