The Graph Neural Network Model
Open accessThe DOI matches its Crossref record; 109 of the 111 references it cites were found in a registry or an index.
Abstract
Many underlying relationships among data in several areas of science and engineering, e.g., computer vision, molecular chemistry, molecular biology, pattern recognition, and data mining, can be represented in terms of graphs. In this paper, we propose a new neural network model, called graph neural network (GNN) model, that extends existing neural network methods for processing the data represented in graph domains. This GNN model, which can directly process most of the practically useful types of graphs, e.g., acyclic, cyclic, directed, and undirected, implements a function tau(G,n) is an element of IR(m) that maps a graph G and one of its nodes n into an m-dimensional Euclidean space. A supervised learning algorithm is derived to estimate the parameters of the proposed GNN model. The computational cost of the proposed algorithm is also considered. Some experimental results are shown to validate the proposed learning algorithm, and to demonstrate its generalization capabilities.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“most rely on homogeneous and static structures, which limits their ability to capture the heterogeneity and temporal evolution of real-world environments.”
From A Survey of Heterogeneous Graph Neural Networks for Cybersecurity Anomaly Detection (2025) · cites this paper as [3]
In the citing paper
“Despite notable progress in heterogeneous graph neural networks (HGNNs) for anomaly detection, several obstacles remain before such methods can be reliably deployed in real-world cybersecurity systems [3], [18], [75].”
From A Survey of Heterogeneous Graph Neural Networks for Cybersecurity Anomaly Detection (2025) · cites this paper as [3]
In the citing paper
“After convolution, feature maps consist of a large number of features that is prone to causing overfitting problem [21].”
From A Survey of Convolutional Neural Networks: Analysis, Applications, and Prospects (2022) · cites this paper as [21]
In the citing paper
“Graph neural networks (GNNs) are a type of deep learning model that are specifically designed and well-suited for analyzing complex relationships between objects represented in a graph structure [63]”
From Challenges in AI-driven Biomedical Multimodal Data Fusion and Analysis (2025) · cites this paper as [63]
In the citing paper
“One of the main advantages of using the GNN for processing MTS is its ability to incorporate the information represented by vertices and edges into the learning process.”
From TVGeAN: Tensor Visibility Graph-Enhanced Attention Network for Versatile Multivariant Time Series Learning Tasks (2024) · cites this paper as [26]
2 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Neural Networks: A Comprehensive Foundation
Haykin, S. (1998) · Cited by 30,070
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221 · cited 1×
“Those techniques include random fields [42], Bayesian networks [43], statistical relational learning [44], transductive learning [45], and semisu-pervised approaches for graph processing [46].”
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270 · cited 1×
“[47]–[50] and Hopfield neural networks [51].”
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004 · cited 8×
“More recently, there have been various approaches [17], [18] attempting to preserve the graph structured”
InfluentialParallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations
Rumelhart, D. E., McClelland, J. L., & AU (1986) · doi:10.7551/mitpress/5236.001.0001 · Cited by 15,686
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Garreau, G. A., & Rudin, W. (1987) · The Statistician · doi:10.2307/2348852 · Cited by 10,622
Research works printed but not linked: 13
- bunke, 2000, graph matching: theoretical foundations, algorithms, and applications, Proc Vis Interface, 82
- fahlman, 1989, Advances in neural information processing systems, 2, 524
- schmitt, 1998, relating chemical structure to activity: an application of the neural folding architecture, Proc Workshop Fuzzy-Neuro Syst /Conf Eng Appl Neural Netw, 170
- k�chler, 1996, Lecture Notes in Computer Science, 1137
- wo?nica, 2006, matching based kernels for labeled graphs, Proc Int Workshop Mining Learn Graphs/ECML/PKDD, 97
- 2005, Proc Int Workshop Sub-Symbol Paradigms Structured Domains
- 2005, Proc Int l Workshop Mining Graphs Trees and Sequences
- 2006, Proc Int l Workshop Mining Graphs Trees and Sequences
- srinivasan, 1994, mutagenesis: ilp experiments in a non-determinate biological domain, Proc 9th Int l Workshop Inductive Logic Programming, 217
- scarselli, 0, The GNN Toolbox
- bua, 2002, Lecture Notes in Computer Science, 2415
- kirsten, 2002, Multirelational distance-based clustering
- 2004, Proc Int Workshop Statist Relat Learn Connect Other Fields
Cited by
Semi-supervised classification with graph convolutional networks
Kipf, T. N., & Welling, M. (2016) · arXiv · doi:10.48550/arxiv.1609.02907 · Cited by 24,853
“In the following, we consider a two-layer GCN for semi-supervised node classification on a graph with a symmetric adjacency matrix A (binary or weighted).”
MethodWang, X., Girshick, R., Gupta, A., & He, K. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00813 · Cited by 11,596
“These methods and ours are also related to a more abstract model called graph neural networks [41].”
MethodA Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
“There are also a number of recent neural network approaches to supervised learning over graph structures [7, 10, 21, 31].”
Dynamic Graph CNN for Learning on Point Clouds
Wang, Y., Sun, Y., Liu, Z., Sarma, S. E., Bronstein, M. M., & Solomon, J. M. (2019) · ACM Transactions on Graphics · doi:10.1145/3326362 · Cited by 7,199
“plify a broad class of deep learning architectures on non-Euclidean structured data termed geometric deep learning [7]. These methods date back to early methods to construct neural networks on graphs [41]. More recently, [9] proposed a generalization of convolution for graphs via the Laplacian operator [44]. This foun…”
Background
Metadata
- Authors
- Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G.
- Affiliations
- University of Siena (IT)
- Hong Kong Baptist University (HK)
- University of Wollongong (AU)
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2009-01
- Volume
- 20
- Issue
- 1
- Pages
- 61-80
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2116341502
- Cited by
- 9,582
- References
- 111
- Citations by year
- 2026: 1235 · 2025: 1651 · 2024: 1503 · 2023: 1398 · 2022: 1177 · 2021: 1150 · 2020: 822 · 2019: 375 · 2018: 149 · 2017: 44 · 2016: 15 · 2015: 10 · 2014: 10 · 2013: 12 · 2012: 6
- FWCI
- 13.19
- Type
- journal article
- Language
- en
- Open access
- green
- figshare.com
- Locations
- IEEE Transactions on Neural Networks (publishedVersion)
- PubMed (publishedVersion)
- HKBU Institutional Repository (Hong Kong Baptist University) (submittedVersion)
- Research Online (University of Wollongong) (submittedVersion)
- Figshare (submittedVersion, cc-by)
- Use Siena air (University of Siena) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
- Keywords
- graph neural networks, graph-structured data, node embeddings, supervised learning algorithms, parameter estimation, computational cost, generalization, directed and undirected graphs
- MeSH terms
- Algorithms, Artificial Intelligence, Pattern Recognition, Automated, Regression Analysis, Reproducibility of Results, Linear Models, Databases, Factual, Neural Networks, Computer, Nonlinear Dynamics, Internet
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Graph Neural Network Model. https://app.cochat.ai/papers/10.1109/tnn.2008.2005605
- The paper
- Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009). The Graph Neural Network Model. IEEE Transactions on Neural Networks. https://doi.org/10.1109/tnn.2008.2005605
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.