Heterogeneous graph

As explained in Graph Neural Networks in Action

A heterogeneous graph is a graph containing multiple types of nodes or edges.

A heterogeneous graph contains multiple node types, edge types, or both. It models richer networks than a homogeneous graph, where every node and edge shares one type. section 1.2.2

Use the model when the network’s entities and relationships carry different meanings:

• Represent recruitment with candidate and company nodes, plus candidate relationships and employment edges. section 1.2.2
• Distinguish relationship semantics instead of collapsing every connection into one generic edge type. section 1.2.2
• Treat a bipartite graph as a specialized heterogeneous graph when nodes divide into subsets and connect only across subsets. section 1.2.2

Figure 1.2 A homogeneous graph and a heterogeneous graph. Here, the shade of a node or edge represents its type or class. For the homogeneous graph, all nodes are of the same type, and all edges are of the same type. For the heterogeneous graph, nodes and edges have multiple types.

Compare uniform and typed networks visually: node and edge shades indicate their types. section 1.2.2

How Graph Neural Networks in Action covers it

How deep it goes

Defines heterogeneous structure through contrasts and a recruitment example, but stops short of algorithmic implementation.

Examples

Uses recruitment networks with candidates, companies, relationships, and employment edges.

What you can do after

Evaluate graph structure and choose suitable analysis, transformation, or machine-learning methods.

How it connects

Connects heterogeneous graphs to homogeneous graphs and bipartite graphs.

liveBookmanning.com

Read Graph Neural Networks in Action on liveBook Get the book at manning.com

Also explained in

• 

  liveBookmanning.com
  Knowledge Graphs and LLMs in ActionA heterogeneous graph is a graph containing multiple types of nodes, relationships, or both.
• 

  liveBookmanning.com
  Graph Algorithms for Data ScienceA heterogeneous graph contains multiple node types or multiple relationship types.

Compare how 3 books explain heterogeneous graph →

Related concepts

• homogeneous graphcontrasts with · A homogeneous graph is a graph whose nodes share one type and whose edges or relationships share one type.
• knowledge graphincludes · A knowledge graph is a graph-structured representation of entities and their semantically meaningful relationships, often including associated attributes or facts.
• graphkind of · A graph is a mathematical structure consisting of vertices connected by edges that represent relationships or connections.
• knowledge graph embeddingaddressed by · Knowledge graph embedding is a technique that represents entities and relationships as low-dimensional vectors while preserving patterns expressed by valid triples.

This explainer was generated by Manning's knowledge graph from the text of Graph Neural Networks in Action. The section links point to the parts of the book it draws on.