Graph neural network: Difference between revisions

Revision as of 20:36, 28 February 2022

Revision as of 21:20, 28 February 2022

Line 6:

In the case of the absence of a known graph structure for example a k-[[nearest neighbor graph]] can be heuristically induced.

GNNs can be understood as a generalization of [[convolutional neural net]]s.

==References==

Line 14 ⟶ 16:

[[Category:Artificial neural networks]]

[[Category:Graph algorithms]]

{{neuroscience-stub}}