|
int | getDefaultK () |
|
void | setDefaultK (int val) |
|
bool | getIsClassifier () |
|
void | setIsClassifier (bool val) |
|
int | getEmax () |
|
void | setEmax (int val) |
|
int | getAlgorithmType () |
|
void | setAlgorithmType (int val) |
|
float | findNearest (Mat samples, int k, Mat results, Mat neighborResponses, Mat dist) |
| Finds the neighbors and predicts responses for input vectors. More...
|
|
float | findNearest (Mat samples, int k, Mat results, Mat neighborResponses) |
| Finds the neighbors and predicts responses for input vectors. More...
|
|
float | findNearest (Mat samples, int k, Mat results) |
| Finds the neighbors and predicts responses for input vectors. More...
|
|
int | getVarCount () |
| Returns the number of variables in training samples. More...
|
|
override bool | empty () |
| Returns true if the Algorithm is empty (e.g. in the very beginning or after unsuccessful read. More...
|
|
bool | isTrained () |
| Returns true if the model is trained. More...
|
|
bool | isClassifier () |
| Returns true if the model is classifier. More...
|
|
bool | train (TrainData trainData, int flags) |
| Trains the statistical model. More...
|
|
bool | train (TrainData trainData) |
| Trains the statistical model. More...
|
|
bool | train (Mat samples, int layout, Mat responses) |
| Trains the statistical model. More...
|
|
float | calcError (TrainData data, bool test, Mat resp) |
| Computes error on the training or test dataset. More...
|
|
virtual float | predict (Mat samples, Mat results, int flags) |
| Predicts response(s) for the provided sample(s) More...
|
|
virtual float | predict (Mat samples, Mat results) |
| Predicts response(s) for the provided sample(s) More...
|
|
virtual float | predict (Mat samples) |
| Predicts response(s) for the provided sample(s) More...
|
|
IntPtr | getNativeObjAddr () |
|
virtual void | clear () |
| Clears the algorithm state. More...
|
|
void | save (string filename) |
|
virtual string | getDefaultName () |
|
void | Dispose () |
|
void | ThrowIfDisposed () |
|
The class implements K-Nearest Neighbors model.
- See also
- ml_intro_knn
float OpenCVForUnity.MlModule.KNearest.findNearest |
( |
Mat |
samples, |
|
|
int |
k, |
|
|
Mat |
results, |
|
|
Mat |
neighborResponses, |
|
|
Mat |
dist |
|
) |
| |
Finds the neighbors and predicts responses for input vectors.
- Parameters
-
samples | Input samples stored by rows. It is a single-precision floating-point matrix of <number_of_samples> * k size. |
k | Number of used nearest neighbors. Should be greater than 1. |
results | Vector with results of prediction (regression or classification) for each input sample. It is a single-precision floating-point vector with <number_of_samples> elements. |
neighborResponses | Optional output values for corresponding neighbors. It is a single- precision floating-point matrix of <number_of_samples> * k size. |
dist | Optional output distances from the input vectors to the corresponding neighbors. It is a single-precision floating-point matrix of <number_of_samples> * k size. |
For each input vector (a row of the matrix samples), the method finds the k nearest neighbors. In case of regression, the predicted result is a mean value of the particular vector's neighbor responses. In case of classification, the class is determined by voting.
For each input vector, the neighbors are sorted by their distances to the vector.
In case of C++ interface you can use output pointers to empty matrices and the function will allocate memory itself.
If only a single input vector is passed, all output matrices are optional and the predicted value is returned by the method.
The function is parallelized with the TBB library.
float OpenCVForUnity.MlModule.KNearest.findNearest |
( |
Mat |
samples, |
|
|
int |
k, |
|
|
Mat |
results, |
|
|
Mat |
neighborResponses |
|
) |
| |
Finds the neighbors and predicts responses for input vectors.
- Parameters
-
samples | Input samples stored by rows. It is a single-precision floating-point matrix of <number_of_samples> * k size. |
k | Number of used nearest neighbors. Should be greater than 1. |
results | Vector with results of prediction (regression or classification) for each input sample. It is a single-precision floating-point vector with <number_of_samples> elements. |
neighborResponses | Optional output values for corresponding neighbors. It is a single- precision floating-point matrix of <number_of_samples> * k size. |
dist | Optional output distances from the input vectors to the corresponding neighbors. It is a single-precision floating-point matrix of <number_of_samples> * k size. |
For each input vector (a row of the matrix samples), the method finds the k nearest neighbors. In case of regression, the predicted result is a mean value of the particular vector's neighbor responses. In case of classification, the class is determined by voting.
For each input vector, the neighbors are sorted by their distances to the vector.
In case of C++ interface you can use output pointers to empty matrices and the function will allocate memory itself.
If only a single input vector is passed, all output matrices are optional and the predicted value is returned by the method.
The function is parallelized with the TBB library.
float OpenCVForUnity.MlModule.KNearest.findNearest |
( |
Mat |
samples, |
|
|
int |
k, |
|
|
Mat |
results |
|
) |
| |
Finds the neighbors and predicts responses for input vectors.
- Parameters
-
samples | Input samples stored by rows. It is a single-precision floating-point matrix of <number_of_samples> * k size. |
k | Number of used nearest neighbors. Should be greater than 1. |
results | Vector with results of prediction (regression or classification) for each input sample. It is a single-precision floating-point vector with <number_of_samples> elements. |
neighborResponses | Optional output values for corresponding neighbors. It is a single- precision floating-point matrix of <number_of_samples> * k size. |
dist | Optional output distances from the input vectors to the corresponding neighbors. It is a single-precision floating-point matrix of <number_of_samples> * k size. |
For each input vector (a row of the matrix samples), the method finds the k nearest neighbors. In case of regression, the predicted result is a mean value of the particular vector's neighbor responses. In case of classification, the class is determined by voting.
For each input vector, the neighbors are sorted by their distances to the vector.
In case of C++ interface you can use output pointers to empty matrices and the function will allocate memory itself.
If only a single input vector is passed, all output matrices are optional and the predicted value is returned by the method.
The function is parallelized with the TBB library.