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
k-Nearest Neighbors
k-Nearest Neighbors (Batch Version)
k-Nearest Neighbors (Cross-Validation Version)
Maximal Independent Set
Weisfeiler-Lehman Isomorphism