U |e;@sdZddlZddlZddlmZmZddlmZddl m Z ddl m Z ddl m Z mZmZdd lmZmZdd lmZdd lmZdd lmZdd lmZddlmZddlmZmZddlm Z Gdddeee Z!dS)zIsomap for manifold learningN)IntegralReal)issparse) shortest_path)connected_components) BaseEstimatorTransformerMixinClassNamePrefixFeaturesOutMixin)NearestNeighborskneighbors_graph)radius_neighbors_graph)check_is_fitted) KernelPCA)KernelCenterer)_fix_connected_components)Interval StrOptions)_VALID_METRICSc@s*eZdZUdZeedddddgeedddddgeeddddgedd d hgeeddddgeedddddgedd d hgedd ddhgedgeeddddgeee dhBe ge dgd Z e e d<ddddddddddddd ddZddZddZd%ddZd&dd Zd!d"Zd#d$ZdS)'IsomapaIsomap Embedding. Non-linear dimensionality reduction through Isometric Mapping Read more in the :ref:`User Guide `. Parameters ---------- n_neighbors : int or None, default=5 Number of neighbors to consider for each point. If `n_neighbors` is an int, then `radius` must be `None`. radius : float or None, default=None Limiting distance of neighbors to return. If `radius` is a float, then `n_neighbors` must be set to `None`. .. versionadded:: 1.1 n_components : int, default=2 Number of coordinates for the manifold. eigen_solver : {'auto', 'arpack', 'dense'}, default='auto' 'auto' : Attempt to choose the most efficient solver for the given problem. 'arpack' : Use Arnoldi decomposition to find the eigenvalues and eigenvectors. 'dense' : Use a direct solver (i.e. LAPACK) for the eigenvalue decomposition. tol : float, default=0 Convergence tolerance passed to arpack or lobpcg. not used if eigen_solver == 'dense'. max_iter : int, default=None Maximum number of iterations for the arpack solver. not used if eigen_solver == 'dense'. path_method : {'auto', 'FW', 'D'}, default='auto' Method to use in finding shortest path. 'auto' : attempt to choose the best algorithm automatically. 'FW' : Floyd-Warshall algorithm. 'D' : Dijkstra's algorithm. neighbors_algorithm : {'auto', 'brute', 'kd_tree', 'ball_tree'}, default='auto' Algorithm to use for nearest neighbors search, passed to neighbors.NearestNeighbors instance. n_jobs : int or None, 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. metric : str, or callable, default="minkowski" The metric to use when calculating distance between instances in a feature array. If metric is a string or callable, it must be one of the options allowed by :func:`sklearn.metrics.pairwise_distances` for its metric parameter. If metric is "precomputed", X is assumed to be a distance matrix and must be square. X may be a :term:`Glossary `. .. versionadded:: 0.22 p : int, default=2 Parameter for the Minkowski metric from sklearn.metrics.pairwise.pairwise_distances. 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. .. versionadded:: 0.22 metric_params : dict, default=None Additional keyword arguments for the metric function. .. versionadded:: 0.22 Attributes ---------- embedding_ : array-like, shape (n_samples, n_components) Stores the embedding vectors. kernel_pca_ : object :class:`~sklearn.decomposition.KernelPCA` object used to implement the embedding. nbrs_ : sklearn.neighbors.NearestNeighbors instance Stores nearest neighbors instance, including BallTree or KDtree if applicable. dist_matrix_ : array-like, shape (n_samples, n_samples) Stores the geodesic distance matrix of training data. 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 -------- sklearn.decomposition.PCA : Principal component analysis that is a linear dimensionality reduction method. sklearn.decomposition.KernelPCA : Non-linear dimensionality reduction using kernels and PCA. MDS : Manifold learning using multidimensional scaling. TSNE : T-distributed Stochastic Neighbor Embedding. LocallyLinearEmbedding : Manifold learning using Locally Linear Embedding. SpectralEmbedding : Spectral embedding for non-linear dimensionality. References ---------- .. [1] Tenenbaum, J.B.; De Silva, V.; & Langford, J.C. A global geometric framework for nonlinear dimensionality reduction. Science 290 (5500) Examples -------- >>> from sklearn.datasets import load_digits >>> from sklearn.manifold import Isomap >>> X, _ = load_digits(return_X_y=True) >>> X.shape (1797, 64) >>> embedding = Isomap(n_components=2) >>> X_transformed = embedding.fit_transform(X[:100]) >>> X_transformed.shape (100, 2) Nleft)closedrbothautoarpackdenseFWDbrutekd_tree ball_tree precomputed) n_neighborsradius n_components eigen_solvertolmax_iter path_methodneighbors_algorithmn_jobspmetric metric_params_parameter_constraintsr minkowski r#r$r%r&r'r(r)r*r+r-r,r.c CsL||_||_||_||_||_||_||_||_| |_| |_ | |_ | |_ dS)Nr2) selfr#r$r%r&r'r(r)r*r+r-r,r.r4U/var/www/website-v5/atlas_env/lib/python3.8/site-packages/sklearn/manifold/_isomap.py__init__szIsomap.__init__c Cs|jdk r&|jdk r&td|jdt|j|j|j|j|j|j|jd|_ |j ||j j |_ t |j drx|j j |_ t|jd|j|j|j|jd|_|jdk rt|j |j|j|j|jd|jd}n"t|j |j|j|j|jd|jd }t|\}}|d krb|jdkr$t|r$td |d tjd |d ddtf|j j|||d|j jd|j j}t||j dd|_!|j jj"t#j$kr|j!j%|j jj"dd|_!|j!d}|d9}|j&||_'|j'j(d |_)dS)Nz 1. The graph cannot be completed with metric='precomputed', and Isomap cannot befitted. Increase the number of neighbors to avoid this issue, or precompute the full distance matrix instead of passing a sparse neighbors graph.zm > 1. Completing the graph to fit Isomap might be slow. Increase the number of neighbors to avoid this issue.r) stacklevel)Xgraphn_connected_componentscomponent_labelsr;r-F)methoddirected)copy)*r#r$ ValueErrorr r*r-r,r.r+nbrs_fitn_features_in_hasattrr8rr%r&r'r( kernel_pca_r r rr RuntimeErrorwarningswarnr_fit_Xeffective_metric_effective_metric_params_rr) dist_matrix_dtypenpfloat32astype fit_transform embedding_shape_n_features_out)r3r=Znbgr?labelsGr4r4r5_fit_transforms              zIsomap._fit_transformcCsNd|jd}t|}|jj}tt|dt|d|jdS)a(Compute the reconstruction error for the embedding. Returns ------- reconstruction_error : float Reconstruction error. Notes ----- The cost function of an isomap embedding is ``E = frobenius_norm[K(D) - K(D_fit)] / n_samples`` Where D is the matrix of distances for the input data X, D_fit is the matrix of distances for the output embedding X_fit, and K is the isomap kernel: ``K(D) = -0.5 * (I - 1/n_samples) * D^2 * (I - 1/n_samples)`` rDrr) rQrrVrJ eigenvalues_rSsqrtsumrX)r3r[ZG_centerevalsr4r4r5reconstruction_error4s zIsomap.reconstruction_errorcCs||||S)aCompute the embedding vectors for data X. Parameters ---------- X : {array-like, sparse matrix, BallTree, KDTree, NearestNeighbors} Sample data, shape = (n_samples, n_features), in the form of a numpy array, sparse matrix, precomputed tree, or NearestNeighbors object. y : Ignored Not used, present for API consistency by convention. Returns ------- self : object Returns a fitted instance of self. )_validate_paramsr\r3r=yr4r4r5rGMs z Isomap.fitcCs||||jS)aFit the model from data in X and transform X. Parameters ---------- X : {array-like, sparse matrix, BallTree, KDTree} 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 ------- X_new : array-like, shape (n_samples, n_components) X transformed in the new space. )rbr\rWrcr4r4r5rVcs zIsomap.fit_transformc Cst||jdk r(|jj|dd\}}n|jj|dd\}}|jj}|jd}t|drl|jt j krlt j }nt j }t ||f|}t |D]2}t |j||||dddfd||<q|dC}|d9}|j|S)aTransform X. This is implemented by linking the points X into the graph of geodesic distances of the training data. First the `n_neighbors` nearest neighbors of X are found in the training data, and from these the shortest geodesic distances from each point in X to each point in the training data are computed in order to construct the kernel. The embedding of X is the projection of this kernel onto the embedding vectors of the training set. Parameters ---------- X : {array-like, sparse matrix}, shape (n_queries, n_features) If neighbors_algorithm='precomputed', X is assumed to be a distance matrix or a sparse graph of shape (n_queries, n_samples_fit). Returns ------- X_new : array-like, shape (n_queries, n_components) X transformed in the new space. NT)return_distancerrRrrD)rr#rF kneighborsradius_neighborsn_samples_fit_rXrIrRrSrTfloat64zerosrangeminrQrJ transform) r3r= distancesindices n_samples_fit n_queriesrRZG_Xir4r4r5rmxs   0zIsomap.transformcCsdtjtjgiS)Npreserves_dtype)rSrirT)r3r4r4r5 _more_tagsszIsomap._more_tags)N)N)__name__ __module__ __qualname____doc__rrrrsetrcallabledictr/__annotations__r6r\rarGrVrmrtr4r4r4r5rsD   c  3r)"rxrLnumpyrSnumbersrr scipy.sparserscipy.sparse.csgraphrrbaserr r neighborsr r r utils.validationr decompositionr preprocessingrZ utils.graphrZutils._param_validationrrZmetrics.pairwiserrr4r4r4r5s