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
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959 · cited 3×
“Random walks and, more generally, Markov chain models are useful in several application areas and have been recently used to develop ranking algorithms for internet search engines [18], [21].”
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
Neural networks: A comprehensive foundation
Tadeusiewicz, R. (1995) · Control Engineering Practice · doi:10.1016/0967-0661(95)90080-2 · Cited by 7,218
Cellular neural networks: theory
Chua, L. O., & Yang, L. (1988) · IEEE Transactions on Circuits and Systems · doi:10.1109/31.7600 · Cited by 4,769 · cited 1×
“[47]–[50] and Hopfield neural networks [51].”
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632 · cited 1×
“In fact, (4) implements the Jacobi iterative method for solving nonlinear equations [55].”
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
A direct adaptive method for faster backpropagation learning: the RPROP algorithm
Riedmiller, M., & Braun, H. (2002) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1993.298623 · Cited by 3,917 · cited 1×
“In our GNN simulator, the weights are updated by the resilient backpropagation [61] strategy, which, according to the literature”
Nazuno, J. F. (2000) · Computación y Sistemas · Cited by 3,201
Non-negative Matrices and Markov Chains
Seneta, E. (1981) · Springer Series in Statistics · doi:10.1007/0-387-32792-4 · Cited by 2,807 · cited 1×
“Markov chain theory suggests that if there exists such that all the elements of the matrix are nonnull, then (15) is a contraction map [70].”
BackgroundAdvances in Neural Information Processing Systems 37
(2024) · doi:10.52202/079017 · Cited by 2,791
Universal Approximation using Incremental Constructive Feedforward Networks with Random Hidden Nodes
Huang, G.-B., Chen, L., & Siew, C.-K. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.875977 · Cited by 2,614 · cited 1×
“Thus, second-order learning algorithms [62], pruning [63], and growing learning algorithms [64]–[66] designed for static networks cannot be directly applied to GNNs.”
BackgroundIntroduction to Bayesian Networks
(2019) · Operational Risk Modelling in Financial Services · doi:10.1002/9781119508557.ch12 · Cited by 2,569
Cellular neural networks: applications
Chua, L. O., & Yang, L. (1988) · IEEE Transactions on Circuits and Systems · doi:10.1109/31.7601 · Cited by 2,375
The Cascade-Correlation learning architecture
Fahlman, S. E., & Lebiere, C. J. (2018) · doi:10.1184/r1/6610403 · Cited by 2,372
A new model for learning in graph domains
Gori, M., Monfardini, G., & Scarselli, F. (2006) · Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005. · doi:10.1109/ijcnn.2005.1555942 · Cited by 2,075
Self-citationReed, R. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.248452 · Cited by 1,708 · cited 1×
“Thus, second-order learning algorithms [62], pruning [63], and growing learning algorithms [64]–[66] designed for static networks cannot be directly applied to GNNs.”
Introduction to Statistical Relational Learning
(2007) · doi:10.7551/mitpress/7432.001.0001 · Cited by 1,643 · cited 1×
“Those techniques include random fields [42], Bayesian networks [43], statistical relational learning [44], transductive learning [45], and semisupervised approaches for graph processing [46].”
Kronecker Products and Matrix Calculus: With Applications
Graham, A. (1981) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,630
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
CONTE, D., FOGGIA, P., SANSONE, C., & VENTO, M. (2004) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001404003228 · Cited by 1,370 · cited 1×
“Even if the performance of our method is not comparable in terms of best accuracy on the same problem with the most efficient algorithms in the literature, the proposed approach is a very general technique that can be applied on extension of the subgraph matching problems [73]–[75].”
Scaling personalized web search
Jeh, G., & Widom, J. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775191 · Cited by 1,195
Real and complex analisis / Walter Rudin
Rudin, W. (1987) · McGraw-Hill, Inc. eBooks · Cited by 1,117
Structural Pattern Recognition
Pavlidis, T. (1977) · Springer eBooks · doi:10.1007/978-3-642-88304-0 · Cited by 1,055
Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search
Haveliwala, T. H. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1208999 · Cited by 1,052
(2012) · SpringerReference · doi:10.1007/springerreference_117344 · Cited by 1,047
Generalization of back-propagation to recurrent neural networks
Pineda, F. J. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.2229 · Cited by 931 · cited 1×
“6 On the other hand, in our case, a more efficient approach is possible, based on the Almeida–Pineda algorithm [58], [59].”
Debnath, A. K., Lopez de Compadre, R. L., Debnath, G., Shusterman, A. J., & Hansch, C. (1991) · Journal of Medicinal Chemistry · doi:10.1021/jm00106a046 · Cited by 868
Efficient crawling through URL ordering
Cho, J., Garcia-Molina, H., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00108-1 · Cited by 837 · cited 1×
“, to improve the efficiency of crawlers [39].”
BackgroundConvolution Kernels for Natural Language
Collins, M., & Duffy, N. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0085 · Cited by 808 · cited 1×
“For example, the diffusion kernel [33] is based on heat diffusion equation; the kernels proposed in [34] and [35] exploit the vectors produced by a graph random walker and those designed in [36]–[38] use a method of counting the number of common substructures of two trees.”
Diffusion Kernels on Graphs and Other Discrete Input Spaces
Kondor, R., & Lafferty, J. (2002) · Cited by 725
Marginalized kernels between labeled graphs
Kashima, H., Tsuda, K., & Inokuchi, A. (2003) · Cited by 710
Supervised neural networks for the classification of structures
Sperduti, A., & Starita, A. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572108 · Cited by 666 · cited 3×
“The neural architectures, which have been suggested for realizing and , include multilayered FNNs [17], [19], cascade correlation [68], and self-organizing maps [20], [69].”
An Introduction to Metric Spaces and Fixed Point Theory
Khamsi, M. A., & Kirk, W. A. (2001) · Wiley eBooks · doi:10.1002/9781118033074 · Cited by 614
Scarselli, F., & Chung Tsoi, A. (1998) · Neural Networks · doi:10.1016/s0893-6080(97)00097-x · Cited by 571 · cited 1×
“Since three-layered neural networks are universal approximators [67], can approximate any desired function.”
Self-citationAn Introduction to Bayesian Networks
Yakowitz, S. J. (1997) · Technometrics · doi:10.1080/00401706.1997.10485130 · Cited by 564
Müller, B., & Reinhardt, J. (1990) · Physics of Neural Networks · doi:10.1007/978-3-642-97239-3 · Cited by 541
Quinlan, J. R., & Cameron-Jones, R. M. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-56602-3_124 · Cited by 528
Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)
Getoor, L. C., & Taskar, B. (2007) · The MIT Press eBooks · Cited by 502
Kwok, T.-Y., & Yeung, D.-Y. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572102 · Cited by 493
A general framework for adaptive processing of data structures
Frasconi, P., Gori, M., & Sperduti, A. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/72.712151 · Cited by 471 · cited 16×
“Finally, it can be observed that the total average error for FNNs is about 50% larger than the GNN error (12.7 for nonlinear GNNs, 13.5 for linear GNNs, and 22.8 for FNNs).”
InfluentialSelf-citationAn Introduction to Bayesian Networks
Neil, M., & p, S. (2006) · Cited by 453
A survey of kernels for structured data
Gärtner, T. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/959242.959248 · Cited by 452
Diffusion kernels on graphs and other discrete structures
Kondor, R. (2002) · Cited by 449
Chua, L. O., & Yang, L. (2003) · 1988., IEEE International Symposium on Circuits and Systems · doi:10.1109/iscas.1988.15089 · Cited by 404
Logical and Relational Learning
De Raedt, L. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88190-2_1 · Cited by 326
A learning rule for asynchronous perceptrons with feedback in a combinatorial environment
Almeida, L. B. (1990) · IEEE Press eBooks · Cited by 280
Logical and Relational Learning
(2008) · Cognitive Technologies · doi:10.1007/978-3-540-68856-3 · Cited by 233 · cited 1×
“Traditionally, data relationships exploitation has been the subject of many studies in the community of inductive logic programming and, recently, this research theme has been evolving in different directions [8], also because of the applications of”
Computational Capabilities of Graph Neural Networks
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005141 · Cited by 225
Self-citationA system for graph-based visualization of the evolution of software
Collberg, C., Kobourov, S., Nagra, J., Pitts, J., & Wampler, K. (2003) · Proceedings of the 2003 ACM symposium on Software visualization · doi:10.1145/774833.774844 · Cited by 209 · cited 1×
“D ATA can be naturally represented by graph structures in several application areas, including proteomics [1], image analysis [2], scene description [3], [4], software engineering [5], [6], and natural language processing [7].”
BackgroundGraph-Based Generation of Referring Expressions
Krahmer, E., Erk, S. V., & Verleg, A. (2003) · Computational Linguistics · doi:10.1162/089120103321337430 · Cited by 207 · cited 1×
“D ATA can be naturally represented by graph structures in several application areas, including proteomics [1], image analysis [2], scene description [3], [4], software engineering [5], [6], and natural language processing [7].”
BackgroundExtensions of marginalized graph kernels
Mahé, P., Ueda, N., Akutsu, T., Perret, J.-L., & Vert, J.-P. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015446 · Cited by 182 · cited 1×
“For example, the diffusion kernel [33] is based on heat diffusion equation; the kernels proposed in [34] and [35] exploit the vectors produced by a graph random walker and those designed in [36]–[38] use a method of counting the number of common substructures of two trees.”
A self-organizing map for adaptive processing of structured data
Hagenbuchner, M., Sperduti, A., & Tsoi, A. C. (2003) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2003.810735 · Cited by 181 · cited 3×
“The neural architectures, which have been suggested for realizing and , include multilayered FNNs [17], [19], cascade correlation [68], and self-organizing maps [20], [69].”
Self-citationTutorial Introduction to Graph Transformation: A Software Engineering Perspective
Baresi, L., & Heckel, R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45832-8_30 · Cited by 173
Kernels and Distances for Structured Data
Gärtner, T., Lloyd, J. W., & Flach, P. A. (2004) · Machine Learning · doi:10.1023/b:mach.0000039777.23772.30 · Cited by 159
Comparative Evaluation of Approaches to Propositionalization
Krogel, M.-A., Rawles, S., Železný, F., Flach, P. A., Lavrač, N., & Wrobel, S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39917-9_14 · Cited by 150
Giles, C. L., & Gori, M. (1998) · Lecture notes in computer science · doi:10.1007/bfb0053992 · Cited by 141
Self-citationGraph Neural Networks for Ranking Web Pages
Scarselli, F., Yong, S. L., Gori, M., Hagenbuchner, M., Tsoi, A. C., & Maggini, M. (2005) · The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) · doi:10.1109/wi.2005.67 · Cited by 119 · cited 2×
“More results achieved on a snapshot of the web are available in [79].”
Self-citationQuinlan, J. R. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61863-5_42 · Cited by 114
Learning to rank networked entities
Agarwal, A., Chakrabarti, S., & Aggarwal, S. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150409 · Cited by 112 · cited 1×
“Finally, the web page ranking is an interesting problem, since it is important in information retrieval and very few techniques have been proposed for its solution [76].”
Logical and Relational Learning: From ILP to MRDM (Cognitive Technologies)
Raedt, L. D. (2008) · Springer eBooks · Cited by 92
Feature Construction with Version Spaces for Biochemical Applications
Krämer, S., & Raedt, L. D. (2001) · Lirias · Cited by 83
A system for graph-based visualization of the evolution of software
Collberg, C. S., Kobourov, S., Nagra, J., Pitts, J., & Wampler, K. (2003) · doi:10.1145/774841.774844 · Cited by 81
Micheli, A., Sperduti, A., Starita, A., & Bianucci, A. M. (2000) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci9903399 · Cited by 78 · cited 1×
“The neural architectures, which have been suggested for realizing and , include multilayered FNNs [17], [19], cascade correlation [68], and self-organizing maps [20], [69].”
BackgroundLogo recognition by recursive neural networks
Francesconi, E., Frasconi, P., Gori, M., Marinai, S., Sheng, J. Q., Soda, G., & Sperduti, A. (1998) · Lecture notes in computer science · doi:10.1007/3-540-64381-8_43 · Cited by 75
Self-citationLearning to Create Customized Authority Lists
Chang, H., Cohn, D. A., & McCallum, A. (2000) · International Conference on Machine Learning · Cited by 65
Graph matching applications in pattern recognition and image processing
Conte, D., Foggia, P., Sansone, C., & Vento, M. (2004) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2003.1246606 · Cited by 64
(2000) · Applied Physics Letters · doi:10.1162/153244304773936054 · Cited by 62
Using logical decision trees for clustering
Raedt, L. D., & Blockeel, H. (1997) · Lecture notes in computer science · doi:10.1007/3540635149_41 · Cited by 55
Web page scoring systems for horizontal and vertical search
Diligenti, M., Gori, M., & Maggini, M. (2002) · International World Wide Web Conference (WWW) · doi:10.1145/511446.511512 · Cited by 55 · cited 1×
“gether the information provided by web connectivity and page content has been a matter of recent research [93]–[96].”
Self-citationTsoi, A. C., Morini, G., Scarselli, F., Hagenbuchner, M., & Maggini, M. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775203 · Cited by 51 · cited 3×
“Recursive neural networks [17], [19], [20] and Markov chains [18], [21], [22] belong to this set of techniques and are commonly applied both to graph and node-focused problems.”
Self-citationInductive learning in symbolic domains using structure-driven recurrent neural networks
Küchler, A., & Goller, C. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61708-6_60 · Cited by 48 · cited 1×
“Recursive neural networks have been applied to several problems including logical term classification [25], chemical compound classification [26], logo recognition [2], [27], web page scoring [28], and face localization [29].”
Recursive neural networks for processing graphs with labelled edges: theory and applications
Bianchini, M., Maggini, M., Sarti, L., & Scarselli, F. (2005) · Neural Networks · doi:10.1016/j.neunet.2005.07.003 · Cited by 48
Self-citationThesis: clustering and instance based learning in first order logic
Ramon, J. (2002) · Lirias · Cited by 43
A Comparison between Recursive Neural Networks and Graph Neural Networks
Di Massa, V., Monfardini, G., Sarti, L., Scarselli, F., Maggini, M., & Gori, M. (2006) · The 2006 IEEE International Joint Conference on Neural Network Proceedings · doi:10.1109/ijcnn.2006.1716174 · Cited by 41 · cited 1×
“It is worth mentioning that the GNN model has been already successfully applied on larger applications, which include image classification and object localization in images [77], [78], web page ranking [79], relational learning [80], and XML classification [81].”
Self-citationConvolution kernels with feature selection for natural language processing tasks
Suzuki, J., Isozaki, H., & Maeda, E. (2004) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/1218955.1218971 · Cited by 38 · cited 1×
“For example, the diffusion kernel [33] is based on heat diffusion equation; the kernels proposed in [34] and [35] exploit the vectors produced by a graph random walker and those designed in [36]–[38] use a method of counting the number of common substructures of two trees.”
Processing directed acyclic graphs with recursive neural networks
Bianchini, M., Gori, M., & Scarselli, F. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.963781 · Cited by 36 · cited 1×
“Similarly, using a preprocessing phase, it is possible to handle certain types of cyclic graphs [24].”
Self-citationNeural methods for non-standard data
Hammer, B., & Jain, B. J. (2004) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 35
A Supervised Self-Organizing Map for Structured Data
Hagenbuchner, M., Tsoi, A. C., & Sperduti, A. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0715-6_4 · Cited by 32 · cited 1×
“The neural architectures, which have been suggested for realizing and , include multilayered FNNs [17], [19], cascade correlation [68], and self-organizing maps [20], [69].”
BackgroundSelf-citationDocument Mining Using Graph Neural Network
Yong, S. L., Hagenbuchner, M., Tsoi, A. C., Scarselli, F., & Gori, M. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73888-6_43 · Cited by 29 · cited 1×
“It is worth mentioning that the GNN model has been already successfully applied on larger applications, which include image classification and object localization in images [77], [78], web page ranking [79], relational learning [80], and XML classification [81].”
MethodSelf-citationA supervised training algorithm for self-organizing maps for structures
Hagenbuchner, M., & Tsoi, A. C. (2005) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.03.009 · Cited by 27 · cited 1×
“Recursive neural networks have been applied to several problems including logical term classification [25], chemical compound classification [26], logo recognition [2], [27], web page scoring [28], and face localization [29].”
Self-citationRecursive neural networks learn to localize faces
Bianchini, M., Maggini, M., Sarti, L., & Scarselli, F. (2005) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.03.010 · Cited by 26 · cited 1×
“It consists of finding whether an image contains a given object, and, if so, localizing its position [15].”
Self-citationGraph Neural Networks for Object Localization
Monfardini, G., Massa, V. D., Scarselli, F., & Gori, M. (2006) · Use Siena air (University of Siena) · Cited by 21
Self-citationGradient based learning methods
Tsoi, A. C., & Tsoi, A. C. (1998) · Lecture notes in computer science · doi:10.1007/bfb0053994 · Cited by 21
Self-citationA graphical representation of the state spaces of hierarchical level-of-detail scene descriptions
Mason, A. E. W., & Blake, E. (2001) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.910824 · Cited by 19 · cited 1×
“D ATA can be naturally represented by graph structures in several application areas, including proteomics [1], image analysis [2], scene description [3], [4], software engineering [5], [6], and natural language processing [7].”
Giles, C. L., & Gori, M. (1998) · Springer eBooks · Cited by 18
Self-citationMachine Learning for Systems Biology
Muggleton, S. (2005) · Lecture notes in computer science · doi:10.1007/11536314_27 · Cited by 18
Computing customized page ranks
Tsoi, A. C., Hagenbuchner, M., & Scarselli, F. (2006) · ACM Transactions on Internet Technology · doi:10.1145/1183463.1183466 · Cited by 17 · cited 1×
“2 Some attempts have been made to extend these models with learning capabilities such that a parametric model representing the behavior of the system can be estimated from a set of training examples extracted from a collection [22], [40], [41].”
Self-citationFace Spotting in Color Images using Recursive Neural Networks
Bianchini, M., Mazzoni, P., Sarti, L., & Scarselli, F. (2003) · Use Siena air (University of Siena) · Cited by 17
Self-citationKernels for Structured Natural Language Data
Suzuki, J., Sasaki, Y., & Maeda, E. (2003) · neural information processing systems · Cited by 16
Learning User Profiles in NAUTILUS
Gori, M., Maggini, M., Martinelli, E., & Scarselli, F. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44595-1_39 · Cited by 14 · cited 1×
“Recursive neural networks have been applied to several problems including logical term classification [25], chemical compound classification [26], logo recognition [2], [27], web page scoring [28], and face localization [29].”
MethodSelf-citationTwo connectionist models for graph processing: An experimental comparison on relational data
Uwents, W., Monfardini, G., Blockeel, H., Scarselli, F., & Gori, M. (2006) · Lirias (KU Leuven) · Cited by 13
Self-citationMarkov Chains and Finite Stochastic Matrices
Seneta, E. B. (1981) · Springer series in statistics · doi:10.1007/0-387-32792-4_4 · Cited by 12
Recursive Neural Networks Applied to Discourse Representation Theory
Bua, A., Gori, M., & Santini, F. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46084-5_48 · Cited by 11 · cited 1×
“D ATA can be naturally represented by graph structures in several application areas, including proteomics [1], image analysis [2], scene description [3], [4], software engineering [5], [6], and natural language processing [7].”
Self-citationSchleif, F.-M., Clauss, U., Villmann, T., & Hammer, B. (2005) · International Conference on Machine Learning and Applications · doi:10.1109/icmla.2004.1383538 · Cited by 9
Pattern Recognition Using Finite-Iteration Cellular Systems
OGORZAŁEK, M. J., Merkwirth, C., & Wichard, J. (2005) · IEEE International Workshop on Cellular Neural Networks and their Applications · doi:10.1109/cnna.2005.1543160 · Cited by 5 · cited 1×
“[47]–[50] and Hopfield neural networks [51].”
Computing personalized pageranks
Scarselli, F., Tsoi, A. C., & Hagenbuchner, M. (2004) · International World Wide Web Conference (WWW) · doi:10.1145/1013367.1013486 · Cited by 5
Self-citationRelational Learning and Inductive Logic Programming Made Easy: abstract of tutorial
Raedt, L. D., & Blockeel, H. (1999) · Lecture notes in computer science · doi:10.1007/978-3-540-48247-5_82 · Cited by 5
Counting stable equilibria of cellular neural networks-A graph theoretic approach
Kałużny, P. (2003) · IEEE International Workshop on Cellular Neural Networks and their Applications · doi:10.1109/cnna.1992.274345 · Cited by 2
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
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.