Beyond Weisfeiler–Lehman with Local Ego-Network Encodings
Identifying similar network structures is key to capturing graph isomorphisms and learning representations that exploit structural information encoded in graph data. This work shows that ego networks can produce a structural encoding scheme for arbitrary graphs with greater expressivity than the Wei...
Main Authors: | Nurudin Alvarez-Gonzalez, Andreas Kaltenbrunner, Vicenç Gómez |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-09-01
|
Series: | Machine Learning and Knowledge Extraction |
Subjects: | |
Online Access: | https://www.mdpi.com/2504-4990/5/4/63 |
Similar Items
-
Portable network resolving huge-graph isomorphism problem
by: Xin An, et al.
Published: (2024-01-01) -
An ego network analysis of sextortionists
by: Oggier, Frederique, et al.
Published: (2020) -
Detecting Drug–Target Interactions with Feature Similarity Fusion and Molecular Graphs
by: Xiaoli Lin, et al.
Published: (2022-06-01) -
Graph Coloring Algorithm Based on Minimal Cost Graph Neural Network
by: Ming Gao, et al.
Published: (2024-01-01) -
Remarks on the Reachability Graphs of Petri Nets
by: Yuriy Anatol’yevich Belov
Published: (2022-12-01)