346 related articles for article (PubMed ID: 19129034)
1. Computational capabilities of graph neural networks.
Scarselli F; Gori M; Tsoi AC; Hagenbuchner M; Monfardini G
IEEE Trans Neural Netw; 2009 Jan; 20(1):81-102. PubMed ID: 19129034
[TBL] [Abstract][Full Text] [Related]
2. The graph neural network model.
Scarselli F; Gori M; Tsoi AC; Hagenbuchner M; Monfardini G
IEEE Trans Neural Netw; 2009 Jan; 20(1):61-80. PubMed ID: 19068426
[TBL] [Abstract][Full Text] [Related]
3. Weisfeiler-Lehman goes dynamic: An analysis of the expressive power of Graph Neural Networks for attributed and dynamic graphs.
Beddar-Wiesing S; D'Inverno GA; Graziani C; Lachi V; Moallemy-Oureh A; Scarselli F; Thomas JM
Neural Netw; 2024 May; 173():106213. PubMed ID: 38428377
[TBL] [Abstract][Full Text] [Related]
4. Augmented Graph Neural Network with hierarchical global-based residual connections.
Rassil A; Chougrad H; Zouaki H
Neural Netw; 2022 Jun; 150():149-166. PubMed ID: 35313247
[TBL] [Abstract][Full Text] [Related]
5. The Vapnik-Chervonenkis dimension of graph and recursive neural networks.
Scarselli F; Tsoi AC; Hagenbuchner M
Neural Netw; 2018 Dec; 108():248-259. PubMed ID: 30219742
[TBL] [Abstract][Full Text] [Related]
6. Intrinsic graph structure estimation using graph Laplacian.
Noda A; Hino H; Tatsuno M; Akaho S; Murata N
Neural Comput; 2014 Jul; 26(7):1455-83. PubMed ID: 24708372
[TBL] [Abstract][Full Text] [Related]
7. Simultaneous L(p)-approximation order for neural networks.
Xu ZB; Cao FL
Neural Netw; 2005 Sep; 18(7):914-23. PubMed ID: 15936925
[TBL] [Abstract][Full Text] [Related]
8. A general framework for adaptive processing of data structures.
Frasconi P; Gori M; Sperduti A
IEEE Trans Neural Netw; 1998; 9(5):768-86. PubMed ID: 18255765
[TBL] [Abstract][Full Text] [Related]
9. On the partitioning capabilities of feedforward neural networks with sigmoid nodes.
Koutroumbas K
Neural Comput; 2003 Oct; 15(10):2457-81. PubMed ID: 14511529
[TBL] [Abstract][Full Text] [Related]
10. Local coupled feedforward neural network.
Sun J
Neural Netw; 2010 Jan; 23(1):108-13. PubMed ID: 19596550
[TBL] [Abstract][Full Text] [Related]
11. A minimum resource neural network framework for solving multiconstraint shortest path problems.
Zhang J; Zhao X; He X
IEEE Trans Neural Netw Learn Syst; 2014 Aug; 25(8):1566-82. PubMed ID: 25050952
[TBL] [Abstract][Full Text] [Related]
12. The loading problem for recursive neural networks.
Gori M; Sperduti A
Neural Netw; 2005 Oct; 18(8):1064-79. PubMed ID: 16198537
[TBL] [Abstract][Full Text] [Related]
13. Function approximation on non-Euclidean spaces.
Courrieu P
Neural Netw; 2005 Jan; 18(1):91-102. PubMed ID: 15649664
[TBL] [Abstract][Full Text] [Related]
14. Random graph models for directed acyclic networks.
Karrer B; Newman ME
Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Oct; 80(4 Pt 2):046110. PubMed ID: 19905393
[TBL] [Abstract][Full Text] [Related]
15. Fitting a geometric graph to a protein-protein interaction network.
Higham DJ; Rasajski M; Przulj N
Bioinformatics; 2008 Apr; 24(8):1093-9. PubMed ID: 18344248
[TBL] [Abstract][Full Text] [Related]
16. Dynamics of neural networks over undirected graphs.
Goles E; Ruz GA
Neural Netw; 2015 Mar; 63():156-69. PubMed ID: 25544654
[TBL] [Abstract][Full Text] [Related]
17. A neural network model to minimize the connected dominating set for self-configuration of wireless sensor networks.
He H; Zhu Z; Mäkinen E
IEEE Trans Neural Netw; 2009 Jun; 20(6):973-82. PubMed ID: 19398401
[TBL] [Abstract][Full Text] [Related]
18. Combining hierarchy and energy for drawing directed graphs.
Carmel L; Harel D; Koren Y
IEEE Trans Vis Comput Graph; 2004; 10(1):46-57. PubMed ID: 15382697
[TBL] [Abstract][Full Text] [Related]
19. On the equivalence between kernel self-organising maps and self-organising mixture density networks.
Yin H
Neural Netw; 2006; 19(6-7):780-4. PubMed ID: 16759835
[TBL] [Abstract][Full Text] [Related]
20. Neural network for graphs: a contextual constructive approach.
Micheli A
IEEE Trans Neural Netw; 2009 Mar; 20(3):498-511. PubMed ID: 19193509
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
