Subgraph Matching Using Graph Neural Network

HTML  Download Download as PDF (Size: 90KB)  PP. 274-278  
DOI: 10.4236/jilsa.2012.44028    4,447 Downloads   8,033 Views  Citations

ABSTRACT

Subgraph matching problem is identifying a target subgraph in a graph. Graph neural network (GNN) is an artificial neural network model which is capable of processing general types of graph structured data. A graph may contain many subgraphs isomorphic to a given target graph. In this paper GNN is modeled to identify a subgraph that matches the target graph along with its characteristics. The simulation results show that GNN is capable of identifying a target sub-graph in a graph.

Share and Cite:

G. Baskararaja and M. Manickavasagam, "Subgraph Matching Using Graph Neural Network," Journal of Intelligent Learning Systems and Applications, Vol. 4 No. 4, 2012, pp. 274-278. doi: 10.4236/jilsa.2012.44028.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.