Thanks to visit codestin.com
Credit goes to github.com

Skip to content

[MRG+1] Add prominent mention of Laplacian Eigenmaps #8155

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Jan 18, 2017

Conversation

samsontmr
Copy link
Contributor

Fixes #5875

Adds prominent mention of Laplacian Eigenmaps being the algorithm that Spectral Embedding implements

@@ -305,7 +305,7 @@ The overall complexity of standard HLLE is
Spectral Embedding
====================

Spectral Embedding (also known as Laplacian Eigenmaps) is one method
Spectral Embedding (specifically, Laplacian Eigenmaps) is one method
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Perhaps "Spectral Embedding is an approach to calculating a non-linear embedding. Scikit-learn implements Laplacian Eigenmaps, which finds a low dimensional representation ..."

but this is not an area of my expertise.

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@amueller Thoughts?

@samsontmr samsontmr force-pushed the master branch 2 times, most recently from a8b09c0 to 5c9a6c4 Compare January 12, 2017 05:46
@samsontmr
Copy link
Contributor Author

@jnothman updated!

@jnothman
Copy link
Member

LGTM, but I don't know this part of the library well enough so I'll leave it for a second reviewer to confirm.

@jnothman jnothman changed the title [MRG] Add prominent mention of Laplacian Eigenmaps [MRG+1] Add prominent mention of Laplacian Eigenmaps Jan 13, 2017
@@ -319,7 +319,7 @@ function :func:`spectral_embedding` or its object-oriented counterpart
Complexity
----------

The Spectral Embedding algorithm comprises three stages:
The Laplacian Eigenmaps algorithm comprises three stages:
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I would prefer "The Spectral Embedding (Laplacian Eigenmaps) algorithm..."

Spectral embedding is an algorithm commonly used to denote this problem (see for instance
http://www.cs.cmu.edu/~aarti/Class/10701/readings/Luxburg06_TR.pdf
that has 4000 citations)

@@ -189,7 +191,7 @@ def spectral_embedding(adjacency, n_components=8, eigen_solver=None,

Notes
-----
Spectral embedding is most useful when the graph has one connected
Laplacian Eigenmaps is most useful when the graph has one connected
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Same remark here.

@samsontmr
Copy link
Contributor Author

Edited and squashed!

@jnothman
Copy link
Member

Thanks, though squashing is no longer necessary and indeed can be harmful to reviewing.

@jnothman
Copy link
Member

I fixed a line length issue and am merging

@jnothman jnothman merged commit 66443aa into scikit-learn:master Jan 18, 2017
@samsontmr
Copy link
Contributor Author

@jnothman are there any guidelines for squashing?

@jnothman
Copy link
Member

jnothman commented Jan 18, 2017 via email

@samsontmr
Copy link
Contributor Author

@jnothman got it! Apologies, I was told to squash my commits in another repo

raghavrv pushed a commit to raghavrv/scikit-learn that referenced this pull request Jan 18, 2017
* Add prominent mention of Laplacian Eigenmaps being the algorithm that Spectral Embedding implements
sergeyf pushed a commit to sergeyf/scikit-learn that referenced this pull request Feb 28, 2017
* Add prominent mention of Laplacian Eigenmaps being the algorithm that Spectral Embedding implements
@Przemo10 Przemo10 mentioned this pull request Mar 17, 2017
Sundrique pushed a commit to Sundrique/scikit-learn that referenced this pull request Jun 14, 2017
* Add prominent mention of Laplacian Eigenmaps being the algorithm that Spectral Embedding implements
NelleV pushed a commit to NelleV/scikit-learn that referenced this pull request Aug 11, 2017
* Add prominent mention of Laplacian Eigenmaps being the algorithm that Spectral Embedding implements
paulha pushed a commit to paulha/scikit-learn that referenced this pull request Aug 19, 2017
* Add prominent mention of Laplacian Eigenmaps being the algorithm that Spectral Embedding implements
maskani-moh pushed a commit to maskani-moh/scikit-learn that referenced this pull request Nov 15, 2017
* Add prominent mention of Laplacian Eigenmaps being the algorithm that Spectral Embedding implements
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants