Flow
sklearn.neighbors._classification.KNeighborsClassifier

sklearn.neighbors._classification.KNeighborsClassifier

Visibility: public Uploaded 24-02-2021 by Test Test sklearn==0.24.1 numpy>=1.6.1 scipy>=0.9 139 runs
0 likes downloaded by 0 people 0 issues 0 downvotes , 0 total downloads
  • openml-python python scikit-learn sklearn sklearn_0.24.1 study_3919 study_4342 study_4788 study_5406 study_5409 study_5428 study_5429 study_5432 study_5435 study_5734 study_6676 study_6697 study_6710 study_6723 study_6799 study_6927 study_7430 study_9640 study_10857 study_10863 study_11770 study_11782 study_11790 study_11800 study_11807 study_11815 study_11844 study_11851 study_11948 study_11983 study_12022 study_12023 study_12027 study_12052 study_12081 study_12096 study_12117 study_12133 study_12139 study_12147 study_12271 study_12357 study_12423 study_13006 study_13667 study_13670
Issue #Downvotes for this reason By


Loading wiki
Help us complete this description Edit
Classifier implementing the k-nearest neighbors vote.

Parameters

algorithmdefault: "auto"
leaf_sizeLeaf size passed to BallTree or KDTree. This can affect the speed of the construction and query, as well as the memory required to store the tree. The optimal value depends on the nature of the problemdefault: 30
metricthe distance metric to use for the tree. The default metric is minkowski, and with p=2 is equivalent to the standard Euclidean metric. See the documentation of :class:`DistanceMetric` for a list of available metrics If metric is "precomputed", X is assumed to be a distance matrix and must be square during fit. X may be a :term:`sparse graph`, in which case only "nonzero" elements may be considered neighborsdefault: "minkowski"
metric_paramsAdditional keyword arguments for the metric functiondefault: null
n_jobsThe number of parallel jobs to run for neighbors search ``None`` means 1 unless in a :obj:`joblib.parallel_backend` context ``-1`` means using all processors. See :term:`Glossary ` for more details Doesn't affect :meth:`fit` method.default: null
n_neighborsNumber of neighbors to use by default for :meth:`kneighbors` queries weights : {'uniform', 'distance'} or callable, default='uniform' weight function used in prediction. Possible values: - 'uniform' : uniform weights. All points in each neighborhood are weighted equally - 'distance' : weight points by the inverse of their distance in this case, closer neighbors of a query point will have a greater influence than neighbors which are further away - [callable] : a user-defined function which accepts an array of distances, and returns an array of the same shape containing the weights algorithm : {'auto', 'ball_tree', 'kd_tree', 'brute'}, default='auto' Algorithm used to compute the nearest neighbors: - 'ball_tree' will use :class:`BallTree` - 'kd_tree' will use :class:`KDTree` - 'brute' will use a brute-force search - 'auto' will attempt to decide the most appropriate algorithm based on the values passed to :meth:`fit` method No...default: 5
pPower parameter for the Minkowski metric. When p = 1, this is equivalent to using manhattan_distance (l1), and euclidean_distance (l2) for p = 2. For arbitrary p, minkowski_distance (l_p) is useddefault: 2
weightsdefault: "uniform"

0
Runs

List all runs
Parameter:
Rendering chart
Rendering table