GraphAcademy

Graphs

multipartite graph

A graph with three or more kinds of node, where relationships only ever join nodes of different kinds.

Also written: multipartite graphs, multipartite

Learn more in Projecting bipartite and multipartite graphs

Example

Customers, products and categories make three kinds of node. Every [:BOUGHT] relationship runs from a (:Customer) to a (:Product), and every [:IN_CATEGORY] relationship from a (:Product) to a (:Category).

Adding a (:Product)-[:SIMILAR_TO]->(:Product) relationship would join two nodes of the same kind. The graph would no longer be multipartite.

Lessons that use this term

The lesson and course links below open in a new tab.

7 lessons use this term. Results are ordered by term density.

Get started with Graph Data Science18 mentions

  • Projecting bipartite and multipartite graphsGDS basic conceptsthis lesson, you'll learn about bipartite and multipartite graphs, when to preserve labels in your projections, and which algorithms work well with multi-type12 mentions
  • Module recap and what's nextGDS basic conceptsactors) Bipartite - Different node types preserved (users ↔ movies) Multipartite - Multiple types and2 mentions
  • Projection modeling for algorithmsEssential projection techniquesthe same data can be projected in different ways—monopartite, bipartite, or multipartite1 mention
  • Practice monopartite projectionsGDS basic conceptsdataset to create various monopartite projections—transforming bipartite and multipartite structures into single-type networks that reveal different patterns within the same2 mentions
  • List and drop graphsGDS basic conceptspracticed creating various types of projections—monopartite, bipartite, and multipartite—it's time to learn how to manage them1 mention

Graph Data Science in Practice6 mentions

  • Graph Projections and StructureGDS Foundationsgraph structure and node labels in GDS Identify monopartite, bipartite, multipartite, and heterogeneous graph structures Choose appropriate projection strategies based on your target5 mentions
  • Projection PracticeGDS Foundationsa multipartite graph1 mention

Related terms

monopartite graph
A graph in which every node is the same kind of thing, so relationships connect like to like.7 shared lessons
node similarity
An algorithm that scores how alike two nodes are by comparing the neighbours they share.5 shared lessons
bipartite graph
A graph with two kinds of node, where every relationship joins one kind to the other and never two of the same kind.7 shared lessons
graph catalog
The set of projections currently held in memory, each listed and dropped by name.2 shared lessons
PageRank
A centrality algorithm that scores a node by the number of nodes pointing at it and by how important those nodes are.6 shared lessons
degree centrality
A score for each node equal to its number of outgoing relationships.4 shared lessons
heterogeneous graph
A graph that holds more than one node label or more than one relationship type.2 shared lessons
projection
An in-memory copy of part of your database that graph algorithms run against. You choose which nodes and relationships it holds.7 shared lessons

All glossary terms