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.

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

rationale for finding topic words on original (non-reduced) vectors #357

Open
rbroc opened this issue Mar 12, 2024 · 0 comments
Open

rationale for finding topic words on original (non-reduced) vectors #357

rbroc opened this issue Mar 12, 2024 · 0 comments

Comments

@rbroc
Copy link

rbroc commented Mar 12, 2024

Hi there! Quick clarification question. To find topic words, it seems like you compute similarities between topic vectors and word vectors using the full-dimensionality vectors (i.e., not what you get after dimensionality reduction, which is, on the other hand, what the clustering models get as input). Just curious whether there a rationale for that, and whether you have experimented with using low-dimensional vectors?

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

No branches or pull requests

1 participant