K Nearest Neighbour Search
Uses a kd-tree to find the p number of near neighbours for each point in an input/output dataset.
K Nearest Neighbour Search
Uses a kd-tree to find the p number of near neighbours for each point in an input/output dataset.
01 Syntax
02 Methods
| Name | Overloads | Summary |
|---|---|---|
| PopulateVectors | 1 | Convert the matrix rows as the indexed vector |
| FindNeighbors | 1 | the output keeps the same order as the given input data |
03 Members
GeneralMatrix)Convert the matrix rows as the indexed vector
the vector is indexed via the input matrix row index
| Name | Type | Description |
|---|---|---|
data | GeneralMatrix | - |
IEnumerable(Of TagVector), Int32)the output keeps the same order as the given input data
| Name | Type | Description |
|---|---|---|
data | IEnumerable(Of TagVector) | - |
k | Int32 | - |