-iSrSSKrSSKJr SSKrSSKJr SSKJ r J r SSK J r J r SSKJr SS KJr SS KJr SS KJr SS KJrJrJrJr S SKJrJrJrJr SSjr "SS\\ \5r!"SS\\ \5r"g)zNearest Neighbor ClassificationN)Integral)_check_precomputed)ClassifierMixin _fit_context)ArgKminClassModeRadiusNeighborsClassMode) StrOptions)_all_with_any_reduction_axis_1) weighted_mode)_mode) _is_arraylike _num_samplescheck_is_fitted validate_data)KNeighborsMixin NeighborsBaseRadiusNeighborsMixin _get_weightscBU=(d 0nUS:Xa X!S'US:XaSnX4$)N minkowskipr euclideanmetric metric_kwargsrs T/var/www/html/venv/lib/python3.13/site-packages/sklearn/neighbors/_classification.py_adjusted_metricr s1!'RM c 6 F   c ^\rSrSr%Sr0\R Er\\S'\RS5 \RS\ "SS15\ S/05 SSS S S S SSS .U4Sjjjr \"SS9S5rSrSrSU4SjjrU4SjrSrU=r$)KNeighborsClassifier(aAClassifier implementing the k-nearest neighbors vote. Read more in the :ref:`User Guide `. Parameters ---------- n_neighbors : int, default=5 Number of neighbors to use by default for :meth:`kneighbors` queries. weights : {'uniform', 'distance'}, callable or None, 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. Refer to the example entitled :ref:`sphx_glr_auto_examples_neighbors_plot_classification.py` showing the impact of the `weights` parameter on the decision boundary. 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. Note: fitting on sparse input will override the setting of this parameter, using brute force. leaf_size : int, default=30 Leaf 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 problem. p : float, default=2 Power 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 used. This parameter is expected to be positive. metric : str or callable, default='minkowski' Metric to use for distance computation. Default is "minkowski", which results in the standard Euclidean distance when p = 2. See the documentation of `scipy.spatial.distance `_ and the metrics listed in :class:`~sklearn.metrics.pairwise.distance_metrics` for valid metric values. 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 neighbors. If metric is a callable function, it takes two arrays representing 1D vectors as inputs and must return one value indicating the distance between those vectors. This works for Scipy's metrics, but is less efficient than passing the metric name as a string. metric_params : dict, default=None Additional keyword arguments for the metric function. n_jobs : int, default=None The 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. Attributes ---------- classes_ : array of shape (n_classes,) Class labels known to the classifier effective_metric_ : str or callble The distance metric used. It will be same as the `metric` parameter or a synonym of it, e.g. 'euclidean' if the `metric` parameter set to 'minkowski' and `p` parameter set to 2. effective_metric_params_ : dict Additional keyword arguments for the metric function. For most metrics will be same with `metric_params` parameter, but may also contain the `p` parameter value if the `effective_metric_` attribute is set to 'minkowski'. n_features_in_ : int Number of features seen during :term:`fit`. .. versionadded:: 0.24 feature_names_in_ : ndarray of shape (`n_features_in_`,) Names of features seen during :term:`fit`. Defined only when `X` has feature names that are all strings. .. versionadded:: 1.0 n_samples_fit_ : int Number of samples in the fitted data. outputs_2d_ : bool False when `y`'s shape is (n_samples, ) or (n_samples, 1) during fit otherwise True. See Also -------- RadiusNeighborsClassifier: Classifier based on neighbors within a fixed radius. KNeighborsRegressor: Regression based on k-nearest neighbors. RadiusNeighborsRegressor: Regression based on neighbors within a fixed radius. NearestNeighbors: Unsupervised learner for implementing neighbor searches. Notes ----- See :ref:`Nearest Neighbors ` in the online documentation for a discussion of the choice of ``algorithm`` and ``leaf_size``. .. warning:: Regarding the Nearest Neighbors algorithms, if it is found that two neighbors, neighbor `k+1` and `k`, have identical distances but different labels, the results will depend on the ordering of the training data. https://en.wikipedia.org/wiki/K-nearest_neighbor_algorithm Examples -------- >>> X = [[0], [1], [2], [3]] >>> y = [0, 0, 1, 1] >>> from sklearn.neighbors import KNeighborsClassifier >>> neigh = KNeighborsClassifier(n_neighbors=3) >>> neigh.fit(X, y) KNeighborsClassifier(...) >>> print(neigh.predict([[1.1]])) [0] >>> print(neigh.predict_proba([[0.9]])) [[0.666 0.333]] _parameter_constraintsradiusweightsuniformdistanceNautorr)r' algorithm leaf_sizerr metric_paramsn_jobsc 8>[T U]UUUUUUUS9 X lg)N) n_neighborsr,r-rrr.r/)super__init__r') selfr1r'r,r-rrr.r/ __class__s rr3KNeighborsClassifier.__init__s3 #'   r!Fprefer_skip_nested_validationc$URX5$)aFit the k-nearest neighbors classifier from the training dataset. Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) or (n_samples, n_samples) if metric='precomputed' Training data. y : {array-like, sparse matrix} of shape (n_samples,) or (n_samples, n_outputs) Target values. Returns ------- self : KNeighborsClassifier The fitted k-nearest neighbors classifier. )_fit)r4Xys rfitKNeighborsClassifier.fits,yyr!c *[US5 URS:XaURS:Xa[R"XR UR 5(aURU5nUR(aV[R"[U5VVs/sH*up4URU[R"USS9PM, snnSS9$UR[R"USS9$URUSS9nSnOURU5upeURnURnUR(d(URR!S 5nUR/n[#U5n [%Uc UR OU5n ['X`R5n U b[)U S S 9(a [+S 5e[R,"X4US R.S 9n [U5HuupU c[1XU 4SS9unnO[3XU 4U SS9unn[R4"UR75[R8S 9nUR;U5U SS2U 4'Mw UR(dU R75n U $s snnf)Predict the class labels for the provided data. Parameters ---------- X : {array-like, sparse matrix} of shape (n_queries, n_features), or (n_queries, n_indexed) if metric == 'precomputed', or None Test samples. If `None`, predictions for all indexed points are returned; in this case, points are not considered their own neighbors. Returns ------- y : ndarray of shape (n_queries,) or (n_queries, n_outputs) Class labels for each data sample. _fit_methodr(bruteraxisFreturn_distanceNrrvalueAll neighbors of some sample is getting zero weights. Please modify 'weights' to avoid this case if you are using a user-defined function.dtype)rr'rAr is_usable_for_fit_Xr predict_proba outputs_2d_npstack enumerateclasses_argmax kneighbors_yreshapelenrrr ValueErroremptyrMr r asarrayravelintptake)r4r; probabilitiesidxprobas neigh_ind neigh_distrUrX n_outputs n_queriesr'y_predk classes_kmode_s rpredictKNeighborsClassifier.predicts8 m, <<9 $7*/?/M/M;; 00!% 2 21 5 ##8809/G/G !MM#.ryya/HI/G }}RYY}1%EFF5AIJ$(OOA$6 !J== WW)B HM   qA z<<8  #A'QR#S1  90 8I8IJ%h/LAa< 0q9a'a<(8'Ja::djjl"'':D$>>$/F1a4L0\\^F Ws1J c [US5 URS:Xa[URURUR S9up#UR S:Xa[R"XRU5(aUR(dxURS:Xa [U5nO [XSSSS 9n[R"UURURURURUR UUS S 9 nU$UR#USS 9nS nOUR#U5upeUR nURnUR(d(URR%S5nUR /n['Uc UROU5n [)X`R5n U c[*R,"U5n O[/U SS9(a [1S5e[*R2"U 5n /n[5U5HupUS S 2U 4Un[*R6"XR845n[5UR:5HunnXU4==U S S 2U4- ss'M UR=SS9S S 2[*R>4nUU-nURAU5 M UR(dUSnU$)aTReturn probability estimates for the test data X. Parameters ---------- X : {array-like, sparse matrix} of shape (n_queries, n_features), or (n_queries, n_indexed) if metric == 'precomputed', or None Test samples. If `None`, predictions for all indexed points are returned; in this case, points are not considered their own neighbors. Returns ------- p : ndarray of shape (n_queries, n_classes), or a list of n_outputs of such arrays if n_outputs > 1. The class probabilities of the input samples. Classes are ordered by lexicographic order. rAr(rrB precomputedcsrFC) accept_sparseresetorder parallel_on_X)rir'Y_labelsunique_Y_labelsrrstrategyrENrGrrIrKrrC)!rr'r rr.rrArrNrOrQrrcomputer1rXrUrWrYrrrR ones_liker r[arangerTzerossizeTsumnewaxisappend)r4r;rrrardrerUrXrgr'all_rowsrirj pred_labelsproba_kirb normalizers rrP"KNeighborsClassifier.predict_proba6si$ m, <<9 $%5{{$2D2D% !F  G+$221kk6JJ((;;-/*1-A%uEA!1 8 8KK&& LL!WW$(MM!"/-#! &%$5AIJ$(OOA$6 !J== WW)B H  qA z<<8 ?ll9-G +G1 =1  99Y' %h/LAQT(9-Khh >>:;G$KMM23# &'!Q$-7&3!!,Q ];J z !G   )0)!,Mr!c$>[TU]XU5$a Return the mean accuracy on the given test data and labels. In multi-label classification, this is the subset accuracy which is a harsh metric since you require for each sample that each label set be correctly predicted. Parameters ---------- X : array-like of shape (n_samples, n_features), or None Test samples. If `None`, predictions for all indexed points are used; in this case, points are not considered their own neighbors. This means that `knn.fit(X, y).score(None, y)` implicitly performs a leave-one-out cross-validation procedure and is equivalent to `cross_val_score(knn, X, y, cv=LeaveOneOut())` but typically much faster. y : array-like of shape (n_samples,) or (n_samples, n_outputs) True labels for `X`. sample_weight : array-like of shape (n_samples,), default=None Sample weights. Returns ------- score : float Mean accuracy of ``self.predict(X)`` w.r.t. `y`. r2scorer4r;r< sample_weightr5s rrKNeighborsClassifier.score:w}Q=11r!c>[TU]5nSURlURS:HUR lU$)NTrp)r2__sklearn_tags__classifier_tags multi_labelr input_tagspairwiser4tagsr5s rr%KNeighborsClassifier.__sklearn_tags__s8w')+/(#';;-#?  r!)r')N)__name__ __module__ __qualname____firstlineno____doc__rr%dict__annotations__popupdater callabler3rr=rmrPrr__static_attributes__ __classcell__r5s@rr#r#(sQf$Lm&J&J#KDKx(!! ZJ 78(DIJ  .&+ (CJgV2>r!r#c ^\rSrSr%Sr0\R E\"SS15\S/\ \ SS/S.Er\ \ S'\RS 5 SSS S S S SSSS.U4Sjjjr\"SS9S5rSrSrSU4SjjrU4SjrSrU=r$)RadiusNeighborsClassifieriaClassifier implementing a vote among neighbors within a given radius. Read more in the :ref:`User Guide `. Parameters ---------- radius : float, default=1.0 Range of parameter space to use by default for :meth:`radius_neighbors` queries. weights : {'uniform', 'distance'}, callable or None, 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. Uniform weights are used by default. 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. Note: fitting on sparse input will override the setting of this parameter, using brute force. leaf_size : int, default=30 Leaf 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 problem. p : float, default=2 Power 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 used. This parameter is expected to be positive. metric : str or callable, default='minkowski' Metric to use for distance computation. Default is "minkowski", which results in the standard Euclidean distance when p = 2. See the documentation of `scipy.spatial.distance `_ and the metrics listed in :class:`~sklearn.metrics.pairwise.distance_metrics` for valid metric values. 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 neighbors. If metric is a callable function, it takes two arrays representing 1D vectors as inputs and must return one value indicating the distance between those vectors. This works for Scipy's metrics, but is less efficient than passing the metric name as a string. outlier_label : {manual label, 'most_frequent'}, default=None Label for outlier samples (samples with no neighbors in given radius). - manual label: str or int label (should be the same type as y) or list of manual labels if multi-output is used. - 'most_frequent' : assign the most frequent label of y to outliers. - None : when any outlier is detected, ValueError will be raised. The outlier label should be selected from among the unique 'Y' labels. If it is specified with a different value a warning will be raised and all class probabilities of outliers will be assigned to be 0. metric_params : dict, default=None Additional keyword arguments for the metric function. n_jobs : int, default=None The 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. Attributes ---------- classes_ : ndarray of shape (n_classes,) Class labels known to the classifier. effective_metric_ : str or callable The distance metric used. It will be same as the `metric` parameter or a synonym of it, e.g. 'euclidean' if the `metric` parameter set to 'minkowski' and `p` parameter set to 2. effective_metric_params_ : dict Additional keyword arguments for the metric function. For most metrics will be same with `metric_params` parameter, but may also contain the `p` parameter value if the `effective_metric_` attribute is set to 'minkowski'. n_features_in_ : int Number of features seen during :term:`fit`. .. versionadded:: 0.24 feature_names_in_ : ndarray of shape (`n_features_in_`,) Names of features seen during :term:`fit`. Defined only when `X` has feature names that are all strings. .. versionadded:: 1.0 n_samples_fit_ : int Number of samples in the fitted data. outlier_label_ : int or array-like of shape (n_class,) Label which is given for outlier samples (samples with no neighbors on given radius). outputs_2d_ : bool False when `y`'s shape is (n_samples, ) or (n_samples, 1) during fit otherwise True. See Also -------- KNeighborsClassifier : Classifier implementing the k-nearest neighbors vote. RadiusNeighborsRegressor : Regression based on neighbors within a fixed radius. KNeighborsRegressor : Regression based on k-nearest neighbors. NearestNeighbors : Unsupervised learner for implementing neighbor searches. Notes ----- See :ref:`Nearest Neighbors ` in the online documentation for a discussion of the choice of ``algorithm`` and ``leaf_size``. https://en.wikipedia.org/wiki/K-nearest_neighbor_algorithm Examples -------- >>> X = [[0], [1], [2], [3]] >>> y = [0, 0, 1, 1] >>> from sklearn.neighbors import RadiusNeighborsClassifier >>> neigh = RadiusNeighborsClassifier(radius=1.0) >>> neigh.fit(X, y) RadiusNeighborsClassifier(...) >>> print(neigh.predict([[1.5]])) [0] >>> print(neigh.predict_proba([[1.0]])) [[0.66666667 0.33333333]] r(r)Nz array-like)r' outlier_labelr%r1r*r+rr)r'r,r-rrrr.r/c D>[T U]UUUUUUU S9 X lXplg)N)r&r,r-rrr.r/)r2r3r'r) r4r&r'r,r-rrrr.r/r5s rr3"RadiusNeighborsClassifier.__init__ks9 '   *r!Fr7cXURX5 URnURnUR(d(URR S5nUR/nUR cSnGOUR S:XaV/n[ U5HCupg[R"USS2U45nURXxR55 ME GOJ[UR 5(a|[UR [5(d][UR 5[U5:wa.[SR!UR [U555eUR nOUR /[U5-n[#X55Hup[U 5(a/[U [5(d[%SR!X55e[R"X5R&U R&:wdMt[%SR!X55e XPlU$)aFit the radius neighbors classifier from the training dataset. Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) or (n_samples, n_samples) if metric='precomputed' Training data. y : {array-like, sparse matrix} of shape (n_samples,) or (n_samples, n_outputs) Target values. Returns ------- self : RadiusNeighborsClassifier The fitted radius neighbors classifier. rGN most_frequentzJThe length of outlier_label: {} is inconsistent with the output length: {}zCThe outlier_label of classes {} is supposed to be a scalar, got {}.zCThe dtype of outlier_label {} is inconsistent with classes {} in y.)r:rUrXrQrYrrTrRbincountrrVr isinstancestrrZr[formatzip TypeErrorrMoutlier_label_) r4r;r<rUrXrrirj label_countclasseslabels rr=RadiusNeighborsClassifier.fits, !== WW)B H    %!N   ? 2N!*( 3  kk"QT(3 %%i0B0B0D&EF!4 T//00""C::t))*c(m;$%%+VD,>,>H %N "&!3!3"&"4"4!5H !E"%h"? '' 5#0F0F#$fW4 99W,22gmmC##VE3#@ - r!cbURU5nURnUR(dU/nUR/n[U5nUSRSn[ R "XT4USRS9n[U5HupxURSS9n X7RU 5USS2U4'US:HRSS9n U R5(dMW[ R"U 5n URUXkU4'M UR(dUR5nU$)r@rrLrrCN)rPrUrQrZshaperRr\rMrTrVr`allany flatnonzerorr^) r4r;probsrUrfrgrhriprobmax_prob_indexoutlier_zero_probszero_prob_indexs rrm!RadiusNeighborsClassifier.predicts"""1%==GE HM !HNN1% 90 8I8IJ 'GA"[[a[0N#;++N;F1a4L"&!)a!8 !%%''"$..1C"D-1-@-@-C)*(\\^F r!c `[US5 [Uc UROU5n[URUR UR S9up4URS:XaURS:XaUR(d[R"XRU5(a[[R"UURURURURURUR UUSS9 nU$UR#U5upg[$R&"U[(S9nUV s/sHn [+U 5S :HPM sn USS&[$R,"U5n [$R,"U)5n URn URn UR(d(URR/S 5n UR/n UR0cU R2S :a[5S U -5e[7X`R5nUbXn/n[9U 5GHunn[$R&"[+U5[:S9nUVs/sH nU UU4PM snUSS&[$R&"UUR245n[$R&"[+U 5UR245nUc?[9UU 5H,unn[$R<"UUR2S 9UUSS24'M. OB[9UU 5H0unn[$R<"UUUUR2S 9UUSS24'M2 UUU SS24'U R2S :auUR0Un[$R,"UU:H5nUR2S :Xa SUU US 4'O2[>R@"SRCUR0U55 URES S9SS2[$RF4nSUUS:H'UU-nURIU5 GM UR(dUS nU$s sn fs snf)aTReturn probability estimates for the test data X. Parameters ---------- X : {array-like, sparse matrix} of shape (n_queries, n_features), or (n_queries, n_indexed) if metric == 'precomputed', or None Test samples. If `None`, predictions for all indexed points are returned; in this case, points are not considered their own neighbors. Returns ------- p : ndarray of shape (n_queries, n_classes), or a list of n_outputs of such arrays if n_outputs > 1. The class probabilities of the input samples. Classes are ordered by lexicographic order. rANrr(rBrv) r;Yr&r'rwrxrrrryrLrrGzNo neighbors found for test samples %r, you can try using larger radius, giving a label for outliers, or considering removing them from your dataset.) minlengthr?ziOutlier label {} is not in training classes. All class probabilities of outliers will be assigned with 0.rCg)%rrrOr rr.rr'rArQr rNrzr&rXrUrradius_neighborsrRr}boolrZrrYrr~r[rrTobjectrwarningswarnrrrr)r4r;rgrrrarerd outlier_masknindoutliersinliersrUrXr'rirjrindr proba_inlrrb_outlier_label label_indexrs rrP'RadiusNeighborsClassifier.predict_probas$ m,  qA 0;;d.@.@DFF!  LLI %  G+$$(66q++vNN4<<++{{  $ "00+(M$! $ 5 5a 8 xx 6 6?@id3t9>i@ Q>>,/..,/== WW)B H    &8==1+<BEMM z<<8  &G %h/LAy((3y>@K4=>ISbajI>KNhh 9>>:;G#g, !?@I' G(<=FAs&(kk#&PIadO>( G(<=FAs&(kkWQZ9>>'IadO>#,GGQJ }}q !%!4!4Q!7 nnY.-HI ##q(8;GHk!n45MM"6$"5"5a"89 !!,Q ];J,/JzS( ) z !G   )I0L)!,MCA4?s 4P&P+c$>[TU]XU5$rrrs rrRadiusNeighborsClassifier.scoreurr!cF>[TU]5nSURlU$)NT)r2rrrrs rr*RadiusNeighborsClassifier.__sklearn_tags__s#w')+/( r!)rrr')rr)rrrrrrr%r rrrrrrr3rr=rmrPrrrrrs@rrrsZx$  . .$ :674H"Ct<$D }-+ ++2&+E EN*Xvt2>r!rr)#rrnumbersrnumpyrRsklearn.neighbors._baserbaserr%metrics._pairwise_distances_reductionrr utils._param_validationr utils.arrayfuncsr utils.extmathr utils.fixesr utils.validationrrrr_baserrrrr r#rrr!rrsj% 601=) VU!\?O]\~ P 4o}Pr!