Informed Machine Learning for Improved Similarity Assessment in Process-Oriented Case-Based Reasoning

• URL: http://arxiv.org/abs/2106.15931v1
• Date: Wed, 30 Jun 2021 09:31:58 GMT
• Title: Informed Machine Learning for Improved Similarity Assessment in Process-Oriented Case-Based Reasoning
• Authors: Maximilian Hoffmann, Ralph Bergmann
• Abstract summary: We investigate the potential of integrating domain knowledge into Graph Neural Networks (GNNs) First, a special data representation and processing method is used that encodes structural knowledge about the semantic annotations of each graph node and edge. Second, the message-passing component of the GNNs is constrained by knowledge on legal node mappings.
• Score: 1.370633147306388
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Currently, Deep Learning (DL) components within a Case-Based Reasoning (CBR) application often lack the comprehensive integration of available domain knowledge. The trend within machine learning towards so-called Informed machine learning can help to overcome this limitation. In this paper, we therefore investigate the potential of integrating domain knowledge into Graph Neural Networks (GNNs) that are used for similarity assessment between semantic graphs within process-oriented CBR applications. We integrate knowledge in two ways: First, a special data representation and processing method is used that encodes structural knowledge about the semantic annotations of each graph node and edge. Second, the message-passing component of the GNNs is constrained by knowledge on legal node mappings. The evaluation examines the quality and training time of the extended GNNs, compared to the stock models. The results show that both extensions are capable of providing better quality, shorter training times, or in some configurations both advantages at once.

Related papers

• VLSI Hypergraph Partitioning with Deep Learning [0.0]
  Graph Neural Networks (GNNs) have demonstrated strong performance in various node, edge, and graph prediction tasks. We introduce a new set of synthetic partitioning benchmarks that emulate real-world netlist characteristics. We evaluate existing state-of-the-art partitioning algorithms alongside GNN-based approaches, highlighting their respective advantages and disadvantages.
  arXiv  Detail & Related papers  (2024-09-02T17:32:01Z)
• On the verification of Embeddings using Hybrid Markov Logic [2.113770213797994]
  We propose a framework to verify complex properties of a learned representation. We present an approach to learn parameters for the properties within this framework. We illustrate verification in Graph Neural Networks, Deep Knowledge Tracing and Intelligent Tutoring Systems.
  arXiv  Detail & Related papers  (2023-12-13T17:04:09Z)
• Exploring Causal Learning through Graph Neural Networks: An In-depth Review [12.936700685252145]
  We introduce a novel taxonomy that encompasses various state-of-the-art GNN methods employed in studying causality. GNNs are further categorized based on their applications in the causality domain. This review also touches upon the application of causal learning across diverse sectors.
  arXiv  Detail & Related papers  (2023-11-25T10:46:06Z)
• Information Flow in Graph Neural Networks: A Clinical Triage Use Case [49.86931948849343]
  Graph Neural Networks (GNNs) have gained popularity in healthcare and other domains due to their ability to process multi-modal and multi-relational graphs. We investigate how the flow of embedding information within GNNs affects the prediction of links in Knowledge Graphs (KGs) Our results demonstrate that incorporating domain knowledge into the GNN connectivity leads to better performance than using the same connectivity as the KG or allowing unconstrained embedding propagation.
  arXiv  Detail & Related papers  (2023-09-12T09:18:12Z)
• Graph Neural Networks Provably Benefit from Structural Information: A Feature Learning Perspective [53.999128831324576]
  Graph neural networks (GNNs) have pioneered advancements in graph representation learning. This study investigates the role of graph convolution within the context of feature learning theory.
  arXiv  Detail & Related papers  (2023-06-24T10:21:11Z)
• CADGE: Context-Aware Dialogue Generation Enhanced with Graph-Structured Knowledge Aggregation [25.56539617837482]
  A novel context-aware graph-attention model (Context-aware GAT) is proposed. It assimilates global features from relevant knowledge graphs through a context-enhanced knowledge aggregation mechanism. Empirical results demonstrate that our framework outperforms conventional GNN-based language models in terms of performance.
  arXiv  Detail & Related papers  (2023-05-10T16:31:35Z)
• Inducing Gaussian Process Networks [80.40892394020797]
  We propose inducing Gaussian process networks (IGN), a simple framework for simultaneously learning the feature space as well as the inducing points. The inducing points, in particular, are learned directly in the feature space, enabling a seamless representation of complex structured domains. We report on experimental results for real-world data sets showing that IGNs provide significant advances over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-04-21T05:27:09Z)
• Noise-robust Graph Learning by Estimating and Leveraging Pairwise Interactions [123.07967420310796]
  This paper bridges the gap by proposing a pairwise framework for noisy node classification on graphs. PI-GNN relies on the PI as a primary learning proxy in addition to the pointwise learning from the noisy node class labels. Our proposed framework PI-GNN contributes two novel components: (1) a confidence-aware PI estimation model that adaptively estimates the PI labels, and (2) a decoupled training approach that leverages the estimated PI labels.
  arXiv  Detail & Related papers  (2021-06-14T14:23:08Z)
• Multi-Level Graph Convolutional Network with Automatic Graph Learning for Hyperspectral Image Classification [63.56018768401328]
  We propose a Multi-level Graph Convolutional Network (GCN) with Automatic Graph Learning method (MGCN-AGL) for HSI classification. By employing attention mechanism to characterize the importance among spatially neighboring regions, the most relevant information can be adaptively incorporated to make decisions. Our MGCN-AGL encodes the long range dependencies among image regions based on the expressive representations that have been produced at local level.
  arXiv  Detail & Related papers  (2020-09-19T09:26:20Z)
• Benchmarking neural embeddings for link prediction in knowledge graphs under semantic and structural changes [6.23228063561537]
  We propose an open-source evaluation pipeline, which benchmarks the accuracy of neural embeddings. We define relation-centric connectivity measures that allow us to connect the link prediction capacity to the structure of the knowledge graph.
  arXiv  Detail & Related papers  (2020-05-15T17:15:45Z)
• Graph Representation Learning via Graphical Mutual Information Maximization [86.32278001019854]
  We propose a novel concept, Graphical Mutual Information (GMI), to measure the correlation between input graphs and high-level hidden representations. We develop an unsupervised learning model trained by maximizing GMI between the input and output of a graph neural encoder.
  arXiv  Detail & Related papers  (2020-02-04T08:33:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.