Computational cost of KNNsearch function

2 次查看(过去 30 天)
I want to know which is the computational cost of the knnsearch algorithm in Matlab.
[~, distX] = knnsearch(X,X,'K',N,'Distance','chebychev'); where N is length of a vector X.

回答(1 个)

Gaurav Garg
Gaurav Garg 2021-3-30
Hi,
knnsearch function can be run with many different input arguments. One such argument is 'NSMethod', which describes the search method for the function.
So, knnsearch can be either 'exhaustive' (which computes the result by comparing with each point in the train dataset), or 'kdtree' (which computes the result through a kD-tree, and can take O(log N) in the best case, where N is the number of points in train set).

类别

Help CenterFile Exchange 中查找有关 Statistics and Machine Learning Toolbox 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by