:i<SrSSKrSSKJrJr SSKrSSKJr SSK J r J r SSK J r JrJrJr SSKJr SS KJr SS KJrJrJr SS KJr SS KJrJr SS KJr SSK J!r! "SS\\\ 5r"g)zIsomap for manifold learningN)IntegralReal)issparse)connected_components shortest_path) BaseEstimatorClassNamePrefixFeaturesOutMixinTransformerMixin _fit_context) KernelPCA)_VALID_METRICS)NearestNeighborskneighbors_graphradius_neighbors_graph)KernelCenterer)Interval StrOptions)_fix_connected_components)check_is_fittedc~\rSrSr%Sr\"\SSSS9S/\"\SSSS9S/\"\SSSS9/\"1S k5/\"\SSSS9/\"\SSSS9S/\"1S k5/\"1S k5/\S/\"\SSSS9/\"\ "\ 5S 1-5\ /\ S/S . r \ \S'SSSSSSSSSSSSS. SjrSrSr\"SS9SSj5r\"SS9SSj5rSrSrSrg)Isomapa:Isomap 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 : float, 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)closedrboth>autodensearpack>DFWr>rbrutekd_tree ball_tree precomputed) n_neighborsradius n_components eigen_solvertolmax_iter path_methodneighbors_algorithmn_jobspmetric metric_params_parameter_constraintsrr minkowski r'r(r)r*r+r,r-r.r/r1r0r2c XlX lX0lX@lXPlX`lXplXlXlXl Xl Xl gNr6) selfr'r(r)r*r+r,r-r.r/r1r0r2s [/srv/projetos/modelo_ml_acdoc/venv/lib/python3.13/site-packages/sklearn/manifold/_isomap.py__init__Isomap.__init__sF ' (( &#6   *c URb&URb[SURS35e[URURURUR UR URURS9Ul URRU5 URRUl [URS5(aURRUl [URSUR UR"UR$URS9R'SS9UlURbL[+URURUR UR URS URS 9nOK[-URURUR UR URS URS 9n[/U5up4US :aUR S:Xa[1U5(a[3S US35e[4R6"S US3SS9 [9SURR:UUUS URR<S.URR>D6n[AX RBSS9Ul"URR:RF[HRJ:Xa=URDRMURR:RFSS9Ul"URDS-nUS-nUR(ROU5Ul(URPRRS Ul*g)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_labelsrEr1F)methoddirected)copy࿩)+r'r( ValueErrorrr.r1r0r2r/nbrs_fitn_features_in_hasattrr@r r)r*r+r, set_output kernel_pca_rrrr RuntimeErrorwarningswarnr_fit_Xeffective_metric_effective_metric_params_rr- dist_matrix_dtypenpfloat32astype fit_transform embedding_shape_n_features_out)r9rGnbgrIlabelsGs r:_fit_transformIsomap._fit_transforms    'DKK,C""&++/**  &((;;..;;ff,,;;   q"jj77 4::2 3 3%)ZZ%A%AD "$** **]];;   *y* )     '"   {{&&"00{{C) {{{{&&"00{{C*>c)B& !A %{{m+ "123;; MM012((  ,**##'=!'zz33 **55C*#6F6FQVW ::   " "bjj 0 $ 1 1 8 8 !!''e!9!D    q  T **88;#44Q7r=c2SURS--n[5RU5nURRn[ R "[ R"US-5[ R"US-5- 5URS- $)aCompute 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)`` rNrr) r]rrbrV eigenvalues_r_sqrtsumrd)r9rhG_centerevalss r:reconstruction_errorIsomap.reconstruction_error8sx( 4$$a' '!#11!4  --wwrvvhk*RVVE1H-==>KKr=F)prefer_skip_nested_validationc(URU5 U$)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. )rir9rGys r:rR Isomap.fitQs, A r=c<URU5 UR$)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. )rircrus r:rbIsomap.fit_transformjs* Ar=c[U5 URbURRUSS9up#OURR USS9up#URR nUR Sn[US5(a/UR[R:Xa[RnO[Rn[R"XT4U5n[U5H7n[R"URX8X(SS2S4-S5Xx'M9 US-nUS-nUR R#U5$)a Transform 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_distancerr^rrN)rr'rQ kneighborsradius_neighborsn_samples_fit_rdrTr^r_r`float64zerosrangeminr]rVrC) r9rG distancesindices n_samples_fit n_queriesr^G_Xis r:rCIsomap.transforms.     '!%!6!6q$!6!O Iw!%!rsQ""!D &-RR*:3.[= ,.> [=r=