Clustering using Latent Dirichlet Allocation algo in gensim

python algorithm cluster-analysis latent-semantic-indexing
Sharmila picture Sharmila · Jun 26, 2011 · Viewed 13.8k times · Source

Is it possible to do clustering in gensim for a given set of inputs using LDA? How can I go about it?

Answer

cdf picture cdf · Jun 29, 2011

LDA produces a lower dimensional representation of the documents in a corpus. To this low-d representation you could apply a clustering algorithm, e.g. k-means. Since each axis corresponds to a topic, a simpler approach would be assigning each document to the topic onto which its projection is largest.

Related questions

Python k-means algorithm

I am looking for Python implementation of k-means algorithm with examples to cluster and cache my database of coordinates.

Read More
Can I use K-means algorithm on a string?

I am working on a python project where I study RNA structure evolution (represented as a string for example: "(((...)))" where the parenthesis represent basepairs). The point being is that I have an ideal structure and a population that evolves towards …

Read More
Removing duplicates in the lists

Pretty much I need to write a program that checks if a list has any duplicates and if it does it removes them and returns a new list with the items that weren't duplicated/removed. This is what I have …

Read More