Adjacency Matrix

مصفوفة التجاور

مصفوفة مربعة N×N تمثّل الروابط بين عُقد الرسم البياني، حيث العنصر (i,j) يساوي 1 إذا وُجد رابط بين العقدة i والعقدة j وصفراً خلاف ذلك.

An N×N square matrix representing connections between graph nodes, where entry (i,j) is 1 if there is an edge between node i and node j, and 0 otherwise.

Also translated asمصفوفة الجوار، مصفوفة الاتصال، مصفوفة الروابط

First appears in this corpus in: On Spectral Clustering: Analysis and an Algorithm (2001)

Appears in these papers

DeepWalk: Online Learning of Social Representations2014 in the sky ✦
Graph Attention Networks2018 in the sky ✦
Graph Attention Networks2018 in the sky ✦
Semi-Supervised Classification with Graph Convolutional Networks2017 in the sky ✦
Semi-Supervised Classification with Graph Convolutional Networks2017 in the sky ✦
The Graph Neural Network Model2009 in the sky ✦
The Graph Neural Network Model2009 in the sky ✦
Do Transformers Really Perform Bad for Graph Representation?2021 in the sky ✦
Inductive Representation Learning on Large Graphs2017 in the sky ✦
Neural Message Passing for Quantum Chemistry2017 in the sky ✦
PinSage: Graph Convolutional Neural Networks for Web-Scale Recommender Systems2018 in the sky ✦
PinSage: Graph Convolutional Neural Networks for Web-Scale Recommender Systems2018 in the sky ✦
On Spectral Clustering: Analysis and an Algorithm2001 in the sky ✦
On Spectral Clustering: Analysis and an Algorithm2001 in the sky ✦
Spectral Networks and Deep Locally Connected Networks on Graphs2014 in the sky ✦
Spectral Networks and Deep Locally Connected Networks on Graphs2014 in the sky ✦