ml-recall

#self-loops

2 questions from Graph Neural Networks

Timed test

2 questions · 2 min · score and explanations at the end

Take a test

Q 1 / 2Score 0 / 0

Shuffle questions

Question 1: Short answer

easyAI-checkedGraph Neural Networks

An undirected graph has $N = 6$ nodes and $|E| = 7$ edges, with no self-loops and no repeated edges. A GCN works with $\tilde A = A + I$ , the adjacency matrix with a self-loop added at every node. How many entries of the $6 \times 6$ matrix $\tilde A$ are non-zero?

Enter: check / next