Table of Contents

Enum KNNAlgorithm

Namespace
AiDotNet.Models.Options
Assembly
AiDotNet.dll

Algorithms for finding nearest neighbors.

public enum KNNAlgorithm

Fields

Auto = 0

Automatically choose the best algorithm.

BallTree = 3

Ball tree for higher-dimensional data.

BruteForce = 1

Compute all pairwise distances (O(n*d) per query).

KDTree = 2

K-D tree for faster queries in low dimensions.