EUVIMEDEUVIMED entdecken
Crossref

Learning to Count Isomorphisms with Graph Neural Networks

Xingtong Yu, Zemin Liu, Yuan Fang, Xinming Zhang

Proceedings of the AAAI Conference on Artificial Intelligence · 26.06.2023 · 37 (4) · 4845-4853

DOI: 10.1609/aaai.v37i4.25610 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the AAAI Conference on Artificial Intelligence, online erschienen am 26.06.2023. Verfasst von Xingtong Yu und 3 weiteren Autor:innen. Die Arbeit wurde bisher 19-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Subgraph isomorphism counting is an important problem on graphs, as many graph-based tasks exploit recurring subgraph patterns. Classical methods usually boil down to a backtracking framework that needs to navigate a huge search space with prohibitive computational cost. Some recent studies resort to graph neural networks (GNNs) to learn a low-dimensional representation for both the query and input graphs, in order to predict the number of subgraph isomorphisms on the input graph. However, typical GNNs employ a node-centric message passing scheme that receives and aggregates messages on nodes, which is inadequate in complex structure matching for isomorphism counting. Moreover, on an input graph, the space of possible query graphs is enormous, and different parts of the input graph will be triggered to match different queries. Thus, expecting a fixed representation of the input graph to match diversely structured query graphs is unrealistic. In this paper, we propose a novel GNN called Count-GNN for subgraph isomorphism counting, to deal with the above challenges. At the edge level, given that an edge is an atomic unit of encoding graph structures, we propose an edge-centric message passing scheme, where messages on edges are propagated and aggregated based on the edge adjacency to preserve fine-grained structural information. At the graph level, we modulate the input graph representation conditioned on the query, so that the input graph can be adapted to each query individually to improve their matching. Finally, we conduct extensive experiments on a number of benchmark datasets to demonstrate the superior performance of Count-GNN.

Zitieren

APA

Yu, X., Liu, Z., Fang, Y., & Zhang, X. (2023). Learning to Count Isomorphisms with Graph Neural Networks. Proceedings of the AAAI Conference on Artificial Intelligence, 37(4), 4845-4853. https://doi.org/10.1609/aaai.v37i4.25610

Vancouver

Yu X, Liu Z, Fang Y, Zhang X. Learning to Count Isomorphisms with Graph Neural Networks. Proceedings of the AAAI Conference on Artificial Intelligence. 2023;37(4):4845-4853. doi:10.1609/aaai.v37i4.25610

BibTeX
@article{Yu2023,
  author = {Yu, Xingtong and Liu, Zemin and Fang, Yuan and Zhang, Xinming},
  title = {Learning to Count Isomorphisms with Graph Neural Networks},
  journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
  year = {2023},
  volume = {37},
  number = {4},
  pages = {4845--4853},
  doi = {10.1609/aaai.v37i4.25610}
}
Kostenlos starten →