Using Graph Embedding Techniques in Process-Oriented Case-Based Reasoning. Hoffmann, M. & Bergmann, R. Algorithms, 2022. ![Using Graph Embedding Techniques in Process-Oriented Case-Based Reasoning [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex 18 downloads 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 knowledge-rich 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 knowledge-intensive, 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.
@article{Hoffmann.2022_GraphEmbeddingPOCBR,
title = {{Using Graph Embedding Techniques in Process-Oriented Case-Based Reasoning}},
author = {Maximilian Hoffmann and Ralph Bergmann},
year = 2022,
journal = {Algorithms},
volume = 15,
number = 2,
doi = {10.3390/a15020027},
issn = {1999-4893},
url = {https://www.mdpi.com/1999-4893/15/2/27/pdf},
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 knowledge-rich 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 knowledge-intensive, 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.}
}
Downloads: 18
{"_id":"hFa2oWDaZ2adsCw8w","bibbaseid":"hoffmann-bergmann-usinggraphembeddingtechniquesinprocessorientedcasebasedreasoning-2022","author_short":["Hoffmann, M.","Bergmann, R."],"bibdata":{"bibtype":"article","type":"article","title":"Using Graph Embedding Techniques in Process-Oriented Case-Based Reasoning","author":[{"firstnames":["Maximilian"],"propositions":[],"lastnames":["Hoffmann"],"suffixes":[]},{"firstnames":["Ralph"],"propositions":[],"lastnames":["Bergmann"],"suffixes":[]}],"year":"2022","journal":"Algorithms","volume":"15","number":"2","doi":"10.3390/a15020027","issn":"1999-4893","url":"https://www.mdpi.com/1999-4893/15/2/27/pdf","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 knowledge-rich 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 knowledge-intensive, 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.","bibtex":"@article{Hoffmann.2022_GraphEmbeddingPOCBR,\n\ttitle = {{Using Graph Embedding Techniques in Process-Oriented Case-Based Reasoning}},\n\tauthor = {Maximilian Hoffmann and Ralph Bergmann},\n\tyear = 2022,\n\tjournal = {Algorithms},\n\tvolume = 15,\n\tnumber = 2,\n\tdoi = {10.3390/a15020027},\n\tissn = {1999-4893},\n\turl = {https://www.mdpi.com/1999-4893/15/2/27/pdf},\n\tabstract = {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 knowledge-rich 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 knowledge-intensive, 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.}\n}\n","author_short":["Hoffmann, M.","Bergmann, R."],"key":"Hoffmann.2022_GraphEmbeddingPOCBR","id":"Hoffmann.2022_GraphEmbeddingPOCBR","bibbaseid":"hoffmann-bergmann-usinggraphembeddingtechniquesinprocessorientedcasebasedreasoning-2022","role":"author","urls":{"Paper":"https://www.mdpi.com/1999-4893/15/2/27/pdf"},"metadata":{"authorlinks":{}},"downloads":18},"bibtype":"article","biburl":"https://web.wi2.uni-trier.de/publications/WI2Publikationen.bib","dataSources":["vtdjwAo6eNiqRLfnG","CnwPa99ZchEF4SZgh","nZxfXH3fRFhwWejKL","MSp3DzP4ToPojqkFy"],"keywords":[],"search_terms":["using","graph","embedding","techniques","process","oriented","case","based","reasoning","hoffmann","bergmann"],"title":"Using Graph Embedding Techniques in Process-Oriented Case-Based Reasoning","year":2022,"downloads":18}