File tree 1 file changed +2
-2
lines changed 1 file changed +2
-2
lines changed Original file line number Diff line number Diff line change @@ -460,7 +460,7 @@ Nearest Centroid Classifier
460
460
461
461
The :class: `NearestCentroid ` classifier is a simple algorithm that represents
462
462
each class by the centroid of its members. In effect, this makes it
463
- similar to the label updating phase of the :class: `sklearn.KMeans ` algorithm.
463
+ similar to the label updating phase of the :class: `sklearn.cluster. KMeans ` algorithm.
464
464
It also has no parameters to choose, making it a good baseline classifier. It
465
465
does, however, suffer on non-convex classes, as well as when classes have
466
466
drastically different variances, as equal variance in all dimensions is
@@ -572,7 +572,7 @@ implementation with special data types. The precomputed neighbors
572
572
.. note ::
573
573
When a specific number of neighbors is queried (using
574
574
:class: `KNeighborsTransformer `), the definition of `n_neighbors ` is ambiguous
575
- since it can either include each training point as its own neighbor, or
575
+ since it can either include each training point as its own neighbor, or
576
576
exclude them. Neither choice is perfect, since including them leads to a
577
577
different number of non-self neighbors during training and testing, while
578
578
excluding them leads to a difference between `fit(X).transform(X) ` and
You can’t perform that action at this time.
0 commit comments