10000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent ca344be commit 8595fe4Copy full SHA for 8595fe4
doc/modules/manifold.rst
@@ -132,7 +132,7 @@ The Isomap algorithm comprises three stages:
132
:math:`N \times N` isomap kernel. For a dense solver, the cost is
133
approximately :math:`O[d N^2]`. This cost can often be improved using
134
the ``ARPACK`` solver. The eigensolver can be specified by the user
135
- with the ``path_method`` keyword of ``Isomap``. If unspecified, the
+ with the ``eigen_solver`` keyword of ``Isomap``. If unspecified, the
136
code attempts to choose the best algorithm for the input data.
137
138
The overall complexity of Isomap is
0 commit comments