0Ph=P dZddlZddlmZmZddlZddlmZddl m Z m Z m Z ddl mZddlmZmZdd lmZdd lmZmZmZdd lmZmZd Zd ZedgdgddddddddddddZGdde e ZdS)z*Affinity Propagation clustering algorithm.N)IntegralReal)config_context) BaseEstimator ClusterMixin _fit_context)ConvergenceWarning)euclidean_distancespairwise_distances_argmin)check_random_state)Interval StrOptionsvalidate_params)check_is_fitted validate_datacBfd}fd}|o |S)NcJtjjdkS)Nr)npallflat) preferencese/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/sklearn/cluster/_affinity_propagation.pyall_equal_preferenceszB_equal_similarities_and_preferences..all_equal_preferencessvjJOA$66777ctjjt}tj|dtj|j|jdkS)N)dtyper)ronesshapebool fill_diagonalrr)maskSs rall_equal_similaritieszC_equal_similarities_and_preferences..all_equal_similaritiessQwqwd+++ q!!!vaglagl1o5666r)r#rrr$s`` r#_equal_similarities_and_preferencesr&sV8888877777 ! " " ?'='='?'??rc n |jd}|dkst||rtjd|jd|j|dz krS|r)t j|t j|dfn't j|t j|fS|r.t jdgt jdg|zdfn,t jdgt jdg|zfS||jdd|dz<t j||f} t j||f} t j||f} |t j |j j |zt j |j j dzz| ||fzz }t j||f} t j|} t|D]}t j| || t j| d}| | |f}t j | | |f<t j| d}t j||dddf| || |f|z | | |f<| d|z z} | |z} | | z } t j| d| | jdd|dz| jdd|dz<| t j| dz} t j| }| dt j| || jdd|dz<| d|z z} | |z} | | z} t j| t j| zdk}|| dd||zf<t j|d}||kr_t j| d}t j||k|dkz|k}|s|dks||krd}|rt3d |znd }|rt3d t j|}|j}|dkr;|rtjd t8t j|dd|fd}t j|||<t|D]o}t j||kd}t jt j||ddt jf|fd}||||<pt j|dd|fd}t j|||<||}t j|}t j ||}n4tjd t8t jdg|z}g}|r|||dzfS||fS)z$Main affinity propagation algorithm.rzTAll samples have mutually equal similarities. Returning arbitrary cluster center(s).Nd)size)axisFzConverged after %d iterations.TzDid not convergezcAffinity propagation did not converge, this model may return degenerate cluster centers and labels.zWAffinity propagation did not converge and this model will not have any cluster centers.)!rr&warningswarnrrarangearrayzerosfinforepstinystandard_normalrangeaddargmaxinfmaxsubtractmaximumsumdiagcopyclipprint flatnonzeror*r wherenewaxisunique searchsorted)r#rconvergence_itermax_iterdampingverbose return_n_iter random_state n_samplesARtmpeinditIYY2dAEKse unconvergednever_convergedckiijlabelscluster_centers_indicess r_affinity_propagationrc"s  IA~~%>? ",AF  y1}  )Y'((A )Y'((A (Iy) * *C !BHQW$5$5$:S$@@$$9i*@$AA BBA )-.//A )I  CHoo0&0& q!S Ic " " " QKvgCF VCa  AqDz3'''Qi"nCF  q7{ W  S 1a%&V,<,`. Parameters ---------- S : array-like of shape (n_samples, n_samples) Matrix of similarities between points. preference : array-like of shape (n_samples,) or float, default=None Preferences for each point - points with larger values of preferences are more likely to be chosen as exemplars. The number of exemplars, i.e. of clusters, is influenced by the input preferences value. If the preferences are not passed as arguments, they will be set to the median of the input similarities (resulting in a moderate number of clusters). For a smaller amount of clusters, this can be set to the minimum value of the similarities. convergence_iter : int, default=15 Number of iterations with no change in the number of estimated clusters that stops the convergence. max_iter : int, default=200 Maximum number of iterations. damping : float, default=0.5 Damping factor between 0.5 and 1. copy : bool, default=True If copy is False, the affinity matrix is modified inplace by the algorithm, for memory efficiency. verbose : bool, default=False The verbosity level. return_n_iter : bool, default=False Whether or not to return the number of iterations. random_state : int, RandomState instance or None, default=None Pseudo-random number generator to control the starting state. Use an int for reproducible results across function calls. See the :term:`Glossary `. .. versionadded:: 0.23 this parameter was previously hardcoded as 0. Returns ------- cluster_centers_indices : ndarray of shape (n_clusters,) Index of clusters centers. labels : ndarray of shape (n_samples,) Cluster labels for each point. n_iter : int Number of iterations run. Returned only if `return_n_iter` is set to True. Notes ----- For an example usage, see :ref:`sphx_glr_auto_examples_cluster_plot_affinity_propagation.py`. You may also check out, :ref:`sphx_glr_auto_examples_applications_plot_stock_market.py` When the algorithm does not converge, it will still return a arrays of ``cluster_center_indices`` and labels if there are any exemplars/clusters, however they may be degenerate and should be used with caution. When all training samples have equal similarities and equal preferences, the assignment of cluster centers and labels depends on the preference. If the preference is smaller than the similarities, a single cluster center and label ``0`` for every sample will be returned. Otherwise, every training sample becomes its own cluster center and is assigned a unique label. References ---------- Brendan J. Frey and Delbert Dueck, "Clustering by Passing Messages Between Data Points", Science Feb. 2007 Examples -------- >>> import numpy as np >>> from sklearn.cluster import affinity_propagation >>> from sklearn.metrics.pairwise import euclidean_distances >>> X = np.array([[1, 2], [1, 4], [1, 0], ... [4, 2], [4, 4], [4, 0]]) >>> S = -euclidean_distances(X, squared=True) >>> cluster_centers_indices, labels = affinity_propagation(S, random_state=0) >>> cluster_centers_indices array([0, 3]) >>> labels array([0, 0, 0, 1, 1, 1]) precomputedrIrHrGr?raffinityrJrL)AffinityPropagationfitcluster_centers_indices_labels_n_iter_) r#rrGrHrIr?rJrKrL estimators raffinity_propagationrussd$) !    c!ffX193DiFWWW  -y/@ @@rc .eZdZUdZeedddgeedddgeedddgdgd eeddd dged d hgd gdgdZe e d<dddddd ddddZ fdZ e dddZdZdfd ZxZS)roamPerform Affinity Propagation Clustering of data. Read more in the :ref:`User Guide `. Parameters ---------- damping : float, default=0.5 Damping factor in the range `[0.5, 1.0)` is the extent to which the current value is maintained relative to incoming values (weighted 1 - damping). This in order to avoid numerical oscillations when updating these values (messages). max_iter : int, default=200 Maximum number of iterations. convergence_iter : int, default=15 Number of iterations with no change in the number of estimated clusters that stops the convergence. copy : bool, default=True Make a copy of input data. preference : array-like of shape (n_samples,) or float, default=None Preferences for each point - points with larger values of preferences are more likely to be chosen as exemplars. The number of exemplars, ie of clusters, is influenced by the input preferences value. If the preferences are not passed as arguments, they will be set to the median of the input similarities. affinity : {'euclidean', 'precomputed'}, default='euclidean' Which affinity to use. At the moment 'precomputed' and ``euclidean`` are supported. 'euclidean' uses the negative squared euclidean distance between points. verbose : bool, default=False Whether to be verbose. random_state : int, RandomState instance or None, default=None Pseudo-random number generator to control the starting state. Use an int for reproducible results across function calls. See the :term:`Glossary `. .. versionadded:: 0.23 this parameter was previously hardcoded as 0. Attributes ---------- cluster_centers_indices_ : ndarray of shape (n_clusters,) Indices of cluster centers. cluster_centers_ : ndarray of shape (n_clusters, n_features) Cluster centers (if affinity != ``precomputed``). labels_ : ndarray of shape (n_samples,) Labels of each point. affinity_matrix_ : ndarray of shape (n_samples, n_samples) Stores the affinity matrix used in ``fit``. n_iter_ : int Number of iterations taken to converge. 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 See Also -------- AgglomerativeClustering : Recursively merges the pair of clusters that minimally increases a given linkage distance. FeatureAgglomeration : Similar to AgglomerativeClustering, but recursively merges features instead of samples. KMeans : K-Means clustering. MiniBatchKMeans : Mini-Batch K-Means clustering. MeanShift : Mean shift clustering using a flat kernel. SpectralClustering : Apply clustering to a projection of the normalized Laplacian. Notes ----- For an example usage, see :ref:`sphx_glr_auto_examples_cluster_plot_affinity_propagation.py`. The algorithmic complexity of affinity propagation is quadratic in the number of points. When the algorithm does not converge, it will still return a arrays of ``cluster_center_indices`` and labels if there are any exemplars/clusters, however they may be degenerate and should be used with caution. When ``fit`` does not converge, ``cluster_centers_`` is still populated however it may be degenerate. In such a case, proceed with caution. If ``fit`` does not converge and fails to produce any ``cluster_centers_`` then ``predict`` will label every sample as ``-1``. When all training samples have equal similarities and equal preferences, the assignment of cluster centers and labels depends on the preference. If the preference is smaller than the similarities, ``fit`` will result in a single cluster center and label ``0`` for every sample. Otherwise, every training sample becomes its own cluster center and is assigned a unique label. References ---------- Brendan J. Frey and Delbert Dueck, "Clustering by Passing Messages Between Data Points", Science Feb. 2007 Examples -------- >>> from sklearn.cluster import AffinityPropagation >>> import numpy as np >>> X = np.array([[1, 2], [1, 4], [1, 0], ... [4, 2], [4, 4], [4, 0]]) >>> clustering = AffinityPropagation(random_state=5).fit(X) >>> clustering AffinityPropagation(random_state=5) >>> clustering.labels_ array([0, 0, 0, 1, 1, 1]) >>> clustering.predict([[0, 0], [4, 4]]) array([0, 1]) >>> clustering.cluster_centers_ array([[1, 2], [4, 2]]) rjg?left)closedr(Nrerdneither euclideanrlrJrLrm_parameter_constraintsrirhTFcv||_||_||_||_||_||_||_||_dSN)rIrHrGr?rJrrnrL) selfrIrHrGr?rrnrJrLs r__init__zAffinityPropagation.__init__sD   0  $  (rct}|jdk|j_|jdk|j_|S)Nrl)super__sklearn_tags__rn input_tagspairwisesparse)r~tags __class__s rrz$AffinityPropagation.__sklearn_tags__s?ww''))#'=M#A !%-!? rrfc |jdkr t|||jd}||_n)t||d}t |d |_|jjd|jjdkrt d |jjd |jtj |j}n|j}tj |}t|j }t|j|j|j||j|jd| \|_|_|_|jdkr$||j|_|S) aFit the clustering from features, or affinity matrix. Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features), or array-like of shape (n_samples, n_samples) Training instances to cluster, or similarities / affinities between instances if ``affinity='precomputed'``. If a sparse feature matrix is provided, it will be converted into a sparse ``csr_matrix``. y : Ignored Not used, present here for API consistency by convention. Returns ------- self Returns the instance itself. rlT)r?force_writeablecsr) accept_sparse)squaredrr(z7The matrix of similarities must be a square array. Got z instead.N)rHrGrrIrJrKrL)rnrr?affinity_matrix_r r ValueErrorrrmedianasarrayr rLrcrHrGrIrJrqrrrscluster_centers_)r~XyrrLs rrpzAffinityPropagation.fitsq( =M ) )dADItLLLA$%D ! !dAU;;;A%8D%I%I%I$ID !  &q )T-B-H-K K K>,2>>>  ? "4#899JJJZ ++ )$*;<< "  !]!2!LL%   ) L L =M ) )$%d&C$D$I$I$K$KD ! rct|t||dd}t|dstd|jjddkr?t d5t||jcd d d S#1swxYwYd Stj d ttj d g|jdzS) aPredict the closest cluster each sample in X belongs to. Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) New data to predict. If a sparse matrix is provided, it will be converted into a sparse ``csr_matrix``. Returns ------- labels : ndarray of shape (n_samples,) Cluster labels. Fr)resetrrz;'( $ $D   $ )))))* \555:::65:x!/!/!/F))))))))))rro)rr-numbersrrnumpyr_configrbaserrr exceptionsr metricsr r utilsr utils._param_validationrrrutils.validationrrr&rcruror%rrrs00 """"""""$$$$$$<<<<<<<<<<++++++DDDDDDDD&&&&&&KKKKKKKKKK======== @ @ @M/M/M/h^##(    xAxAxAxAxAvd)d)d)d)d), d)d)d)d)d)r