Skip to content
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.

Sign up for GitHub

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

Jump to bottom

Getting Smallest EigenValues #2

Open
arainboldt opened this issue Jun 13, 2022 · 0 comments
Open

Getting Smallest EigenValues #2

arainboldt opened this issue Jun 13, 2022 · 0 comments

Comments

@arainboldt
Copy link

Hi,

Very interesting work! Given that spectral clustering methods use the eigenvectors for the smallest K eigenvalues when clustering graphs, I'm wondering if it's possible to compute only the smallest K eigenvectors using this method, as in scipy.sparse.linalg.svds when which='SM' ?

Thanks

Andrew
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@arainboldt