3 ms·
Right, bertopic's double clustering is interesting. I've also seen people combine that with louvain instead of k-means. My intuition was: UMAP itself tries to
by uniqueuid 4y ago
Right, bertopic's double clustering is interesting. I've also seen people combine that with louvain instead of k-means.
My intuition was: UMAP itself tries to optimize for 2d separation in the projection. So we should expect at least some correspondence between the kmeans results and the layout in the UMAP plot (except in some pathological edge cases perhaps).
Nevertheless, nice example and blog post!
- jayalammar 4y agoTIL louvain clustering! I see it used for graphs. Can also be used for vectors/points? Thank you!
- uniqueuid 4y agoYou're welcome! You can actually create a graph by using k-means similarities as edge weights. Then you do graph clustering on it. (using any algorithm, but louvain is one of the saner ones ... clique percolation, girvan-newman etc all have known problems).