Name
classify_class_knnT_classify_class_knnClassifyClassKnnclassify_class_knnClassifyClassKnnClassifyClassKnn — Search for the next neighbors for a given feature vector.
classify_class_knnclassify_class_knnClassifyClassKnnclassify_class_knnClassifyClassKnnClassifyClassKnn searches for the next 'k'"k""k""k""k""k"
neighbors of the feature vector given in FeaturesFeaturesFeaturesFeaturesFeaturesfeatures.
The distance which is used to determine the next neighbor is
the L2-norm of the given vector and the trainings samples.
The value of 'k'"k""k""k""k""k" can be set via set_params_class_knnset_params_class_knnSetParamsClassKnnset_params_class_knnSetParamsClassKnnSetParamsClassKnn.
The results can either be the determined class of the feature vector or
the indices of the nearest neighbors. The selection of the result behavior
can be made by set_params_class_knnset_params_class_knnSetParamsClassKnnset_params_class_knnSetParamsClassKnnSetParamsClassKnn via the generic parameters
'method'"method""method""method""method""method" and 'max_num_classes'"max_num_classes""max_num_classes""max_num_classes""max_num_classes""max_num_classes":
- 'classes_distance'"classes_distance""classes_distance""classes_distance""classes_distance""classes_distance":
returns the nearest samples
for each of maximally 'max_num_classes'"max_num_classes""max_num_classes""max_num_classes""max_num_classes""max_num_classes" different classes,
if they have a representative in the nearest 'k'"k""k""k""k""k" neighbors.
The results in ResultResultResultResultResultresult are classes sorted by their minimal
distance in RatingRatingRatingRatingRatingrating. There is no efficient way to determine in a
k-NN-tree the nearest neighbor for exactly 'max_num_classes'"max_num_classes""max_num_classes""max_num_classes""max_num_classes""max_num_classes"
classes.
- 'classes_frequency'"classes_frequency""classes_frequency""classes_frequency""classes_frequency""classes_frequency":
counts the occurrences of certain
classes among the nearest 'k'"k""k""k""k""k" neighbors and returns the occurrent
classes in ResultResultResultResultResultresult sorted by their relative frequency that is
returned in RatingRatingRatingRatingRatingrating. Again, maximally 'max_num_classes'"max_num_classes""max_num_classes""max_num_classes""max_num_classes""max_num_classes"
values are returned.
- 'classes_weighted_frequencies'"classes_weighted_frequencies""classes_weighted_frequencies""classes_weighted_frequencies""classes_weighted_frequencies""classes_weighted_frequencies":
counts the occurrences of certain classes among the
nearest 'k'"k""k""k""k""k" neighbors and returns the occurrent classes
in ResultResultResultResultResultresult sorted by their relative frequency weighted with the
average distance that is returned in RatingRatingRatingRatingRatingrating.
Again, maximally 'max_num_classes'"max_num_classes""max_num_classes""max_num_classes""max_num_classes""max_num_classes" values are returned.
- 'neighbors_distance'"neighbors_distance""neighbors_distance""neighbors_distance""neighbors_distance""neighbors_distance":
returns the indices of the nearest
'k'"k""k""k""k""k" neighbors in ResultResultResultResultResultresult
and the distances in RatingRatingRatingRatingRatingrating.
The default behavior is 'classes_distance'"classes_distance""classes_distance""classes_distance""classes_distance""classes_distance" and returns the
classes and distances.
- Multithreading type: reentrant (runs in parallel with non-exclusive operators).
- Multithreading scope: global (may be called from any thread).
- Processed without parallelization.
Handle of the k-NN classifier.
Features that should be classified.
The classification result, either class IDs or sample
indices.
A rating for the results. This value contains either a
distance, a frequency or a weighted frequency.
If the parameters are valid, the operator classify_class_knnclassify_class_knnClassifyClassKnnclassify_class_knnClassifyClassKnnClassifyClassKnn
returns the value 2 (H_MSG_TRUE). If necessary, an exception is raised.
train_class_knntrain_class_knnTrainClassKnntrain_class_knnTrainClassKnnTrainClassKnn,
read_class_knnread_class_knnReadClassKnnread_class_knnReadClassKnnReadClassKnn,
set_params_class_knnset_params_class_knnSetParamsClassKnnset_params_class_knnSetParamsClassKnnSetParamsClassKnn
clear_class_knnclear_class_knnClearClassKnnclear_class_knnClearClassKnnClearClassKnn
create_class_knncreate_class_knnCreateClassKnncreate_class_knnCreateClassKnnCreateClassKnn,
read_class_knnread_class_knnReadClassKnnread_class_knnReadClassKnnReadClassKnn
Marius Muja, David G. Lowe: “Fast Approximate Nearest Neighbors with
Automatic Algorithm Configuration”;
International Conference on Computer Vision Theory
and Applications (VISAPP 09); 2009.
Foundation