---
title: "Node Embedding Algorithms"
description: "Overview of node embedding algorithms."
component: "graph-ml"
version: "3.10"
module: "node-embeddings"
html_url: "/graph-ml/3.10/node-embeddings/"
canonical_url: "https://www.tigergraph.com/docs/graph-ml/3.10/node-embeddings/"
markdown_url: "https://www.tigergraph.com/docs/graph-ml/3.10/node-embeddings/index.md"
---

[View as HTML](https://www.tigergraph.com/docs/graph-ml/3.10/node-embeddings/)

# Node Embedding Algorithms

Node embeddings are vector representations of properties of vertices in a graph. These vectors can be used for machine learning.

The TigerGraph Graph Data Science Library provides the following node embedding algorithms:

* [Fast Random Projection](https://www.tigergraph.com/docs/graph-ml/3.10/node-embeddings/fast-random-projection.md)
* [NodePiece](https://www.tigergraph.com/docs/pytigergraph/1.8/gds/nodepiece.md) is a highly scalable node embedding technique. It is implemented in the pyTigerGraph library. Using it requires a few additional steps, but it is our most scalable offering.
* **Weisfeiler-Lehman isomorphism** has been moved to the[Classification](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/index.md) category.
* **Node2Vec** has been retired (as of v3.9.2) because it did not meet our standards for efficiency and scalability of memory usage. [Fast Random Projection](https://www.tigergraph.com/docs/graph-ml/3.10/node-embeddings/fast-random-projection.md) is a better alternative.
