Results in the standard Euclidean distance when p = 2. metric str or DistanceMetric object, default=’minkowski’ Satisfy leaf_size <= n_points <= 2 * leaf_size, except in Store the tree scales as approximately n_samples / leaf_size.įor a specified leaf_size, a leaf node is guaranteed to Significantly impact the speed of a query and the memory required Leaf_size will not affect the results of a query, but can Number of points at which to switch to brute-force. Otherwise, an internal copy will be made. Note: if X is a C-contiguous array of doubles then data will N_features is the dimension of the parameter space. N_samples is the number of points in the data set, and
Parameters : X array-like of shape (n_samples, n_features) KDTree for fast generalized N-point problems
KDTree ( X, leaf_size = 40, metric = 'minkowski', ** kwargs ) ¶
0 kommentar(er)
