Using Graph Embedding Techniques in Process-Oriented Case-Based Reasoning

8Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Similarity-based retrieval of semantic graphs is a core task of Process-Oriented Case-Based Reasoning (POCBR) with applications in real-world scenarios, e.g., in smart manufacturing. The involved similarity computation is usually complex and time-consuming, as it requires some kind of inexact graph matching. To tackle these problems, we present an approach to modeling similarity measures based on embedding semantic graphs via Graph Neural Networks (GNNs). Therefore, we first examine how arbitrary semantic graphs, including node and edge types and their knowledgerich semantic annotations, can be encoded in a numeric format that is usable by GNNs. Given this, the architecture of two generic graph embedding models from the literature is adapted to enable their usage as a similarity measure for similarity-based retrieval. Thereby, one of the two models is more optimized towards fast similarity prediction, while the other model is optimized towards knowledgeintensive, more expressive predictions. The evaluation examines the quality and performance of these models in preselecting retrieval candidates and in approximating the ground-truth similarities of a graph-matching-based similarity measure for two semantic graph domains. The results show the great potential of the approach for use in a retrieval scenario, either as a preselection model or as an approximation of a graph similarity measure.

References Powered by Scopus

Long Short-Term Memory

76724Citations
N/AReaders
Get full text

Deep learning

63441Citations
N/AReaders
Get full text

Learning phrase representations using RNN encoder-decoder for statistical machine translation

11619Citations
N/AReaders
Get full text

Cited by Powered by Scopus

An Overview and Comparison of Case-Based Reasoning Frameworks

12Citations
N/AReaders
Get full text

Improving Automated Hyperparameter Optimization with Case-Based Reasoning

4Citations
N/AReaders
Get full text

Checking for non-Euclidean latent geometry of biological networks

3Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Hoffmann, M., & Bergmann, R. (2022). Using Graph Embedding Techniques in Process-Oriented Case-Based Reasoning. Algorithms, 15(2). https://doi.org/10.3390/a15020027

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 4

57%

Lecturer / Post doc 3

43%

Readers' Discipline

Tooltip

Computer Science 3

60%

Engineering 2

40%

Save time finding and organizing research with Mendeley

Sign up for free