-i8XSrSSKJrJr SSKrSSKJr SSKJ r SSK J r SSK J r JrJrJr SS KJr SS KJr SS KJr SS KJr SS KJrJr SSKJrJr SSKJ r J!r!J"r" "SS\\\ 5r#g)z%Kernel Principal Components Analysis.)IntegralRealN)linalg)eigh)eigsh) BaseEstimatorClassNamePrefixFeaturesOutMixinTransformerMixin _fit_context)NotFittedError)pairwise_kernels)KernelCenterer)_init_arpack_v0)Interval StrOptions)_randomized_eigshsvd_flip)_check_psd_eigenvaluescheck_is_fitted validate_datac^\rSrSr%Sr0S\"\SSSS9S/_S\"1S k5\/_S \"\ S SSS9S/_S \"\ S SSS9/_S \"\ SSSS9/_S\ S/_S\"\ S SSS9/_SS/_S\"1Sk5/_S\"\ S SSS9/_S\"\SSSS9S/_S\"\S SSS9\"S15/_SS/_SS/_SS/_SS\/_r \ \ S'S0SSSSSS S!SS SSS!SS"SS#.S$jjr S0S%jrS&rS'r\"S"S(9S0S)j5rS0S*jrS+rS,rU4S-jr\S.5rS/rU=r$)1 KernelPCA u Kernel Principal component analysis (KPCA). Non-linear dimensionality reduction through the use of kernels [1]_, see also :ref:`metrics`. It uses the :func:`scipy.linalg.eigh` LAPACK implementation of the full SVD or the :func:`scipy.sparse.linalg.eigsh` ARPACK implementation of the truncated SVD, depending on the shape of the input data and the number of components to extract. It can also use a randomized truncated SVD by the method proposed in [3]_, see `eigen_solver`. For a usage example and comparison between Principal Components Analysis (PCA) and its kernelized version (KPCA), see :ref:`sphx_glr_auto_examples_decomposition_plot_kernel_pca.py`. For a usage example in denoising images using KPCA, see :ref:`sphx_glr_auto_examples_applications_plot_digits_denoising.py`. Read more in the :ref:`User Guide `. Parameters ---------- n_components : int, default=None Number of components. If None, all non-zero components are kept. kernel : {'linear', 'poly', 'rbf', 'sigmoid', 'cosine', 'precomputed'} or callable, default='linear' Kernel used for PCA. gamma : float, default=None Kernel coefficient for rbf, poly and sigmoid kernels. Ignored by other kernels. If ``gamma`` is ``None``, then it is set to ``1/n_features``. degree : float, default=3 Degree for poly kernels. Ignored by other kernels. coef0 : float, default=1 Independent term in poly and sigmoid kernels. Ignored by other kernels. kernel_params : dict, default=None Parameters (keyword arguments) and values for kernel passed as callable object. Ignored by other kernels. alpha : float, default=1.0 Hyperparameter of the ridge regression that learns the inverse transform (when fit_inverse_transform=True). fit_inverse_transform : bool, default=False Learn the inverse transform for non-precomputed kernels (i.e. learn to find the pre-image of a point). This method is based on [2]_. eigen_solver : {'auto', 'dense', 'arpack', 'randomized'}, default='auto' Select eigensolver to use. If `n_components` is much less than the number of training samples, randomized (or arpack to a smaller extent) may be more efficient than the dense eigensolver. Randomized SVD is performed according to the method of Halko et al [3]_. auto : the solver is selected by a default policy based on n_samples (the number of training samples) and `n_components`: if the number of components to extract is less than 10 (strict) and the number of samples is more than 200 (strict), the 'arpack' method is enabled. Otherwise the exact full eigenvalue decomposition is computed and optionally truncated afterwards ('dense' method). dense : run exact full eigenvalue decomposition calling the standard LAPACK solver via `scipy.linalg.eigh`, and select the components by postprocessing arpack : run SVD truncated to n_components calling ARPACK solver using `scipy.sparse.linalg.eigsh`. It requires strictly 0 < n_components < n_samples randomized : run randomized SVD by the method of Halko et al. [3]_. The current implementation selects eigenvalues based on their module; therefore using this method can lead to unexpected results if the kernel is not positive semi-definite. See also [4]_. .. versionchanged:: 1.0 `'randomized'` was added. tol : float, default=0 Convergence tolerance for arpack. If 0, optimal value will be chosen by arpack. max_iter : int, default=None Maximum number of iterations for arpack. If None, optimal value will be chosen by arpack. iterated_power : int >= 0, or 'auto', default='auto' Number of iterations for the power method computed by svd_solver == 'randomized'. When 'auto', it is set to 7 when `n_components < 0.1 * min(X.shape)`, other it is set to 4. .. versionadded:: 1.0 remove_zero_eig : bool, default=False If True, then all components with zero eigenvalues are removed, so that the number of components in the output may be < n_components (and sometimes even zero due to numerical instability). When n_components is None, this parameter is ignored and components with zero eigenvalues are removed regardless. random_state : int, RandomState instance or None, default=None Used when ``eigen_solver`` == 'arpack' or 'randomized'. Pass an int for reproducible results across multiple function calls. See :term:`Glossary `. .. versionadded:: 0.18 copy_X : bool, default=True If True, input X is copied and stored by the model in the `X_fit_` attribute. If no further changes will be done to X, setting `copy_X=False` saves memory by storing a reference. .. versionadded:: 0.18 n_jobs : int, default=None The number of parallel jobs to run. ``None`` means 1 unless in a :obj:`joblib.parallel_backend` context. ``-1`` means using all processors. See :term:`Glossary ` for more details. .. versionadded:: 0.18 Attributes ---------- eigenvalues_ : ndarray of shape (n_components,) Eigenvalues of the centered kernel matrix in decreasing order. If `n_components` and `remove_zero_eig` are not set, then all values are stored. eigenvectors_ : ndarray of shape (n_samples, n_components) Eigenvectors of the centered kernel matrix. If `n_components` and `remove_zero_eig` are not set, then all components are stored. dual_coef_ : ndarray of shape (n_samples, n_features) Inverse transform matrix. Only available when ``fit_inverse_transform`` is True. X_transformed_fit_ : ndarray of shape (n_samples, n_components) Projection of the fitted data on the kernel principal components. Only available when ``fit_inverse_transform`` is True. X_fit_ : ndarray of shape (n_samples, n_features) The data used to fit the model. If `copy_X=False`, then `X_fit_` is a reference. This attribute is used for the calls to transform. 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 gamma_ : float Kernel coefficient for rbf, poly and sigmoid kernels. When `gamma` is explicitly provided, this is just the same as `gamma`. When `gamma` is `None`, this is the actual value of kernel coefficient. .. versionadded:: 1.3 See Also -------- FastICA : A fast algorithm for Independent Component Analysis. IncrementalPCA : Incremental Principal Component Analysis. NMF : Non-Negative Matrix Factorization. PCA : Principal Component Analysis. SparsePCA : Sparse Principal Component Analysis. TruncatedSVD : Dimensionality reduction using truncated SVD. References ---------- .. [1] `Schölkopf, Bernhard, Alexander Smola, and Klaus-Robert Müller. "Kernel principal component analysis." International conference on artificial neural networks. Springer, Berlin, Heidelberg, 1997. `_ .. [2] `Bakır, Gökhan H., Jason Weston, and Bernhard Schölkopf. "Learning to find pre-images." Advances in neural information processing systems 16 (2004): 449-456. `_ .. [3] :arxiv:`Halko, Nathan, Per-Gunnar Martinsson, and Joel A. Tropp. "Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions." SIAM review 53.2 (2011): 217-288. <0909.4061>` .. [4] `Martinsson, Per-Gunnar, Vladimir Rokhlin, and Mark Tygert. "A randomized algorithm for the decomposition of matrices." Applied and Computational Harmonic Analysis 30.1 (2011): 47-68. `_ Examples -------- >>> from sklearn.datasets import load_digits >>> from sklearn.decomposition import KernelPCA >>> X, _ = load_digits(return_X_y=True) >>> transformer = KernelPCA(n_components=7, kernel='linear') >>> X_transformed = transformer.fit_transform(X) >>> X_transformed.shape (1797, 7) n_componentsNleft)closedkernel>rbfpolycosinelinearsigmoid precomputedgammardegreecoef0neither kernel_paramsalphafit_inverse_transformboolean eigen_solver>autodensearpack randomizedtolmax_iteriterated_powerr/remove_zero_eig random_statecopy_Xn_jobs_parameter_constraintsr#g?FT)rr&r'r(r*r+r,r.r3r4r5r6r7r8r9cXlX lX`lX0lX@lXPlXplXlXlXl Xl Xl Xl Xl UUlXlgN)rrr*r&r'r(r+r,r.r3r4r5r6r7r9r8)selfrrr&r'r(r*r+r,r.r3r4r5r6r7r8r9s T/var/www/html/venv/lib/python3.13/site-packages/sklearn/decomposition/_kernel_pca.py__init__KernelPCA.__init__s]() *    %:"( ,.(  c[UR5(aUR=(d 0nO$URURUR S.n[ X4URSURS.UD6$)N)r&r'r(T)metric filter_paramsr9)callablerr*gamma_r'r(rr9)r>XYparamss r? _get_kernelKernelPCA._get_kernel?se DKK ''-2F#{{dkkDJJWF  D PV  rBc URRU5RUSS9nURcURSnO#[ URSUR5nUR S:XaURSS:a US:aSnOS nO UR nUS :Xa9[XRSU- URSS - 4S 9uUlUl OUS:XaR[URSUR5n[XS URURUS 9uUlUl O4US:Xa.[UUUR URSS9uUlUl [#URSS9Ul[%URSS9uUl nURR'5SSS2nURUUlURSS2U4Ul UR((d URcFURSS2URS:4Ul URURS:UlU$)zFit's using kernel KF)copyNrr/ r1r0r)subset_by_indexLA)whichr3maxiterv0r2module)rn_iterr7 selection)enable_warnings)uv) _centererfit transformrshapeminr.r eigenvalues_ eigenvectors_rr7rr3r4rr5rrargsortr6)r>Krr.rU_indicess r?_fit_transform_in_place!KernelPCA._fit_transform_in_placeHs; NN  q ! + +AE + :    $771:Lqwwqz4+<+<=L    &wwqzCL2$5' & ,,L 7 "48GGAJ$=qwwqzA~#N5 1D t1X % T->->?B49t4==UW5 1D t1\ )4E)**!.." 5 1D t13   u  !)4+=+= FA##++-dd3 --g6!//7 ;   4#4#4# X_transformedrH n_samplesres r?_fit_inverse_transform KernelPCA._fit_inverse_transforms} 1g  %H "''*   ] + )a- DJJ.  ,,qeN"/rB)prefer_skip_nested_validationcUR(aURS:Xa [S5e[XSURS9nUR cSUR S- O UR Ul[5RSS9Ul URU5nURU5 UR(a>UR[R"UR 5-nUR#XA5 XlU$)alFit the model from data in X. Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) Training vector, where `n_samples` is the number of samples and `n_features` is the number of features. y : Ignored Not used, present for API consistency by convention. Returns ------- self : object Returns the instance itself. r%z7Cannot fit_inverse_transform with a precomputed kernel.csr) accept_sparserNrdefault)r_)r,r ValueErrorrr8r&r`rGr set_outputr]rKrhrcnpsqrtrbrwX_fit_)r>rHyrerus r?r^ KernelPCA.fits$  % %$++*FVW W $T[[ I(, (:a!''!*n  ')44y4I   Q  $$Q'  % % ..9J9J1KKM  ' ' 9  rBc UR"U40UD6 UR[R"UR5-nUR (aUR XA5 U$)aFit the model from data in X and transform X. Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) Training vector, where `n_samples` is the number of samples and `n_features` is the number of features. y : Ignored Not used, present for API consistency by convention. **params : kwargs Parameters (keyword arguments) and values passed to the fit_transform instance. Returns ------- X_new : ndarray of shape (n_samples, n_components) Transformed values. )r^rcrrrbr,rw)r>rHrrJrus r? fit_transformKernelPCA.fit_transformsS* f**RWWT5F5F-GG  % %  ' ' 9rBc[U5 [XSSS9nURRUR XR 55n[ R"UR5n[ R"UR5nURSS2U4[ R"URU5- USS2U4'[ R"X$5$)aTransform X. Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) Training vector, where `n_samples` is the number of samples and `n_features` is the number of features. Returns ------- X_new : ndarray of shape (n_samples, n_components) Projection of X in the first principal components, where `n_samples` is the number of samples and `n_components` is the number of the components. r{F)r|resetN) rrr]r_rKrr flatnonzerorb zeros_likercrdot)r>rHre non_zeros scaled_alphass r?r_KernelPCA.transforms  $e D NN $ $T%5%5a%E FNN4#4#45  d&8&89 &*&8&8I&F   i (J ' al# vva''rBcUR(d [S5eURXR5n[R "X R 5$)u Transform X back to original space. ``inverse_transform`` approximates the inverse transformation using a learned pre-image. The pre-image is learned by kernel ridge regression of the original data on their low-dimensional representation vectors. .. note: :meth:`~sklearn.decomposition.fit` internally uses a centered kernel. As the centered kernel no longer contains the information of the mean of kernel features, such information is not taken into account in reconstruction. .. note:: When users want to compute inverse transformation for 'linear' kernel, it is recommended that they use :class:`~sklearn.decomposition.PCA` instead. Unlike :class:`~sklearn.decomposition.PCA`, :class:`~sklearn.decomposition.KernelPCA`'s ``inverse_transform`` does not reconstruct the mean of data when 'linear' kernel is used due to the use of centered kernel. Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_components) Training vector, where `n_samples` is the number of samples and `n_features` is the number of features. Returns ------- X_original : ndarray of shape (n_samples, n_features) Original data, where `n_samples` is the number of samples and `n_features` is the number of features. References ---------- `Bakır, Gökhan H., Jason Weston, and Bernhard Schölkopf. "Learning to find pre-images." Advances in neural information processing systems 16 (2004): 449-456. `_ z|The fit_inverse_transform parameter was not set to True when instantiating and hence the inverse transform is not available.)r,r rKrtrrrs)r>rHres r?inverse_transformKernelPCA.inverse_transformsKT)) :    Q 7 7 8vva))rBc>[TU]5nSURlSS/URlUR S:HURlU$)NTfloat64float32r%)super__sklearn_tags__ input_tagssparsetransformer_tagspreserves_dtyperpairwise)r>tags __class__s r?rKernelPCA.__sklearn_tags__9sIw')!%1:I0F-#';;-#?  rBc4URRS$)z&Number of transformed output features.r)rbr`)r>s r?_n_features_outKernelPCA._n_features_out@s  &&q))rB)rrtr]r+r(r8r'rsr.rbrcr,r&rGr5rr*r4rr9r7r6r3r=)__name__ __module__ __qualname____firstlineno____doc__rrrrFrdictr:__annotations__r@rKrhrwr r^rr_rrpropertyr__static_attributes__ __classcell__)rs@r?rr s$Un $ Xq$v 6   $  T U  $  T1d6 2   $ 8D!T&9: $ (4tI>? $ $ $ (4D89! $" )# $$ $MNO% $& q$v67' $(  Xq$v 6  ) $0  Xq$v 6 x  1 $8 I;9 $: (; $< 9+= $> 4"? $D H## %#J L\ 05"6"H>(>2*h**rBr)$rnumbersrrnumpyrscipyr scipy.linalgrscipy.sparse.linalgrbaser r r r exceptionsr metrics.pairwiser preprocessingr utils._arpackrutils._param_validationrr utils.extmathrrutils.validationrrrrrBr?rsU+ #% (/*+:7c*/1A=c*rB