Degree Matrix

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

مصفوفة قطرية يمثّل كل عنصر فيها عدد الروابط المتصلة بالعقدة المقابلة (درجتها). تُستخدم في تسوية مصفوفة التجاور لمنع هيمنة العُقد كثيرة الروابط.

A diagonal matrix where each entry represents the number of edges connected to the corresponding node (its degree). Used to normalize the adjacency matrix and prevent high-degree nodes from dominating.

Also translated asمصفوفة درجات العُقد، مصفوفة الاتصالية

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

Appears in these papers

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 ✦
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 ✦