---
title: "Classification Algorithms"
description: "Overview of classification algorithms."
component: "graph-ml"
version: "3.10"
module: "classification-algorithms"
html_url: "/graph-ml/3.10/classification-algorithms/"
canonical_url: "https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/"
markdown_url: "https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/index.md"
---

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

# Classification Algorithms

Classification algorithms assign a label (class name) to a vertex based on it satisfying the established conditions for membership in that class. This differs from community (or clustering) algorithms in which there are no pre-established conditions for membership.

The TigerGraph Graph Data Science Library provides the following classification algorithms:

* [Greedy Graph Coloring](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/greedy-graph-coloring.md)
* [k-Nearest Neighbors](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/k-nearest-neighbors.md)
* [k-Nearest Neighbors (Batch Version)](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/k-nearest-neighbors-batch.md)
* [k-Nearest Neighbors (Cross-Validation Version)](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/k-nearest-neighbors-cross-validation.md)
* [Maximal Independent Set](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/maximal-independent-set.md)
* [Weisfeiler-Lehman Isomorphism](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/weisfeiler-lehman.md)
