Datumorphism Datumorphism
Notebooks
Awesome Blog Cards Hologram Reading Notes TIL Wiki
  Hologram   Deep Learning Book
Blog AmNeumarkt
  • Datumorphism
  • Cards
  • Graph
  • Structural Equivalence on Graph

Structural Equivalence on Graph

GROWING This note is being developed. It is readible but changes are being applied.
cards/graph/structural-equivalence.md Current Note ID: The unique ID of this note.
#Graph

Structural Equivalence means that nodes with similar neighborhood structures will share similar attributes.

Planted: 2021-09-25 by L Ma;

References:
  1. Hamilton2020 Hamilton WL. Graph Representation Learning. Morgan & Claypool Publishers; 2020. pp. 1–159. doi:10.2200/S01045ED1V01Y202009AIM046
Dynamic Backlinks:
Solving Problems on Graph
Graphs can be used in many problem and there are many possible problems on graphs. We will mention a …

L Ma (2021). 'Structural Equivalence on Graph', Datumorphism, 09 April. Available at: https://datumorphism.leima.is/cards/graph/structural-equivalence/.

« Node Degree Weisfeiler-Lehman Kernel »

Created and maintained by L Ma. Acknowledgement: Hugo, Bulma, KausalFlow. love.
Use CMD/WIN+k to activate the command palette
About Feed JSON Data